Dorit Aharonov, Amnon Ta-Shma  Home/Search
Context Related
| cs.tau.ac.il/~amnon/...AT.quantph03.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.tau.ac.il/~amnon/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The design of new quantum algorithms has proven to be an extremely di#cult task. This paper considers a di#erent approach to the problem. (Update)
Cited by: More
Exponential Algorithmic Speedup by a Quantum Walk - Andrew Childs Richard (Correct)
Multilinear Formulas and Skepticism of Quantum Computing - Aaronson (2004) (Correct)
Hidden Translation and Orbit Coset in Quantum Computing - Friedl, Ivanyos.. (2003) (Correct)
Active bibliography (related documents): More All
10.4: Adiabatic Quantum State Generation and Statistical Zero.. - Aharonov, Ta-Shma (2003) (Correct)
1.1: Continuous-time Quantum Algorithms: Searching and Adiabatic.. - Ioannou (2002) (Correct)
0.3: Quantum Computation and Lattice Problems - Regev (2003) (Correct)
Similar documents based on text: More All
0.2: Quantum Walks On Graphs - Aharonov, Ambainis, Kempe, Vazirani (2000) (Correct)
0.2: Quantum Bit Escrow - Aharonov, Ta-Shma, Vazirani (Correct)
0.2: Quantum Circuits with Mixed States - Aharonov, Kitaev, Nisan (1998) (Correct)
Related documents from co-citation: More All
6: Quantum Computation and Quantum Information (context) - Nielsen, Huang - 2000
4: Quantum complexity theory - Bernstein, Vazirani - 1993
3: Multi-linear formulas for permanent and determinant are of super-polynomial size - Raz - 2003
BibTeX entry: (Update)
D. Aharonov and A. Ta-Shma. Adiabatic quantum state generation and statistical zero knowledge. In Proc. 35th ACM Symp. on Theory of Computing, 2003. http://citeseer.ist.psu.edu/aharonov03adiabatic.html More
@misc{ aharonov03adiabatic,
author = "D. Aharonov and A. Ta-Shma",
title = "Adiabatic quantum state generation and statistical zero knowledge",
text = "D. Aharonov and A. Ta-Shma. Adiabatic quantum state generation and statistical
zero knowledge. In Proc. 35th ACM Symp. on Theory of Computing, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/aharonov03adiabatic.html" }
Citations (may not include all citations):957 The Probabilistic Method (context) - Alon, Spencer - 1991
531 The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1989
126 Eigenvalues and Expanders (context) - Alon - 1986
86 The Markov chain Monte Carlo method: an approach to approxim.. - Jerrum, Sinclair - 1996
48 Quantum Mechanics helps in searching for a needle in a hayst.. (context) - Grover - 1997
32 the limits of non-approximability of lattice problems - Goldreich, Goldwasser - 1998
27 A Complete Promise Problem for Statistical ZeroKnowledge - Sahai, Vadhan - 1997
25 Sampling and integration of near log-concave functions (context) - Applegate, Kannan - 1991
25 Quantum measurements and the Abelian Stabilizer Problem - Yu
24 the adiabatic theorem of Quantum Mechanics (context) - Kato - 1951
22 Faster random generation of linear extensions - Bubley, Dyer - 1998
22 Honest-Verifier Statistical ZeroKnowledge Equals General Sta.. - Goldreich, Sahai et al. - 1998
20 Polynomial-Time Quantum Algorithms for Pell's Equation and t.. - Hallgren - 2002
15 The Graph Isomorphism Problem (context) - Kobler, Schoning et al. - 1993
12 A Perfect Zero-Knowledge Proof System for a Problem Equivale.. (context) - Goldreich, Kushilevitz - 1993
11 A Study of Statistical Zero Knowledge Proofs (context) - Vadhan - 1999
10 Adiabatic Theorem without a Gap Condition - Avron, Elgart - 1999
9 Kluwer Academic Publishers (context) - Peres, Theory et al. - 1995
7 Quantum lower bound for the collision problem - Aaronson - 2002
5 cient quantum algorithms for Shifted Quadratic Character Pro.. (context) - van Dam, Hallgren
5 erence between quantum and classical random walks (context) - Childs, Farhi et al.
5 A quantum adiabatic evolution algorithm applied to random in.. (context) - Farhi, Goldstone et al. - 2001
4 Combinatorial Optimization: A Survey (context) - Grotschel, Lovasz - 1993
4 Quantum Computation by Adiabatic Evolution (context) - Farhi, Goldstone et al.
3 Vigoda A Polynomial-Time Approximation Algorithm for the per.. (context) - Jerrum, Sinclair - 2000
3 A numerical study of the performance of a quantum adiabatic .. (context) - Farhi, Goldstone et al.
3 How Powerful is Adiabatic Quantum Computation (context) - van Dam, Mosca et al. - 2001
3 Creating superpositions that correspond to e#ciently integra.. (context) - Grover, Rudolph
3 Janos Bolyai Mathematical Society (context) - Lovasz, on et al. - 1996
3 oli and Controlled-NOT need little help to do universal quan.. (context) - Shi, To
3 Quantum Computation and Information (context) - Nielsen, Chuang - 2000
2 More on the power of adiabatic computation (context) - van Dam, Vazirani - 2001
2 Exponential algorithmic speedup by quantum walk - Childs, Cleve et al.
2 Quantum search by measurement (context) - Childs, Deotto et al. - 2002
2 Quantum Search by Local Adiabatic Evolution Phys (context) - Roland, Cerf - 2002
2 Improved bounds on the spectral gap above frustration free g.. (context) - Spitzer, Starr
2 des Adiabatensatzes (context) - Born, Fock - 1928
2 Second edition of English Translation (context) - Lifshitz, Mechanics - 1965
2 Quantum Adiabatic Evolution Algorithms with Di#erent Paths (context) - Farhi, Goldstone et al.
2 ect approach to simulating adiabatic Generators Proof (context) - Watrous, for et al. - 2001
2 A simple proof that To#oli and Hadamard are quantum universa.. (context) - Aharonov - 2002
2 John Willey & Sons (context) - Quantum - 1958
2 Finding cliques by quantum adiabatic evolution (context) - Childs, Farhi et al.
1 Universality of Adiabatic quantum computation (context) - Aharonov, van Dam et al. - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.tau.ac.il/~amnon/): More
Uniform hardness versus randomness tradeoffs for.. - Gutfreund, Shaltiel.. (2003) (Correct)
The Hidden Subgroup Problem And Quantum Computation.. - Hallgren, Russell.. (2003) (Correct)
Extractor Codes - Ta-Shma, Zuckerman (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC