Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Karp (1972)
Reducibility Among Combinatorial Problems
Charles Bennett, Ethan Bernstein, G. Brassard, U. Vazirani (1997)
Strengths and Weaknesses of Quantum ComputingSIAM J. Comput., 26
M. Mosca, A. Ekert (1999)
Proc. of the 1st NASA International Conference on Quantum Computing and Quantum Communication
Lov Grover (1997)
Quantum Computers Can Search Rapidly by Using Almost Any TransformationPhysical Review Letters, 80
Wim Dam, Sean Hallgren, Lawrence Ip
C Xxxx Society for Industrial and Applied Mathematics Quantum Algorithms for Some Hidden Shift Problems *
D. Aharonov, W. Dam, J. Kempe, Zeph Landau, S. Lloyd, O. Regev (2004)
Adiabatic quantum computation is equivalent to standard quantum computation45th Annual IEEE Symposium on Foundations of Computer Science
A. Ambainis (2003)
QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONSInternational Journal of Quantum Information, 01
Raymond Miller, J. Thatcher, Jean Bohlinger (1972)
Complexity of Computer ComputationsMathematics of Computation, 28
P. Shor (1995)
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Rev., 41
G. Kuperberg (2003)
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup ProblemSIAM J. Comput., 35
L. Sengupta (2001)
From Coupled Pendulums to Quantum SearcharXiv: Quantum Physics
W. Dam (2004)
Quantum Computing and Zeroes of Zeta FunctionsarXiv: Quantum Physics
M. Mosca, A. Ekert (1998)
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
SubgroupsMark Ettinger (1999)
On Quantum Algorithms for Non ommutative Hidden Subgroups
C. Audemard, F. Roux, A. Barnaud, C. Collins, B. Sautour, P. Sauriau, X. Montaudouin, C. Coustau, C. Combes, F. Berthe (2002)
Needle in a haystack: involvement of the copepod Paracartia grani in the life-cycle of the oyster pathogen Marteilia refringensParasitology, 124
E. Farhi, J. Goldstone, S. Gutmann, M. Sipser (2000)
Quantum Computation by Adiabatic EvolutionarXiv: Quantum Physics
U. Vazirani (1998)
On the power of quantum computationPhilosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 356
M. Sipser (1992)
The history and status of the P versus NP question
G. Brassard, P. Høyer, M. Mosca, A. Montreal, B. Aarhus, Cacr Waterloo (2000)
Quantum Amplitude Amplification and EstimationarXiv: Quantum Physics
Lov Grover (1997)
Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 79
P. Shor (2003)
Why haven't more quantum algorithms been found?J. ACM, 50
A. Ambainis, J. Kempe, Alexander Rivosh (2004)
Coins make quantum walks faster
S. Cook (1971)
Proc. of the 3rd Annual ACM Symposium on Theory of Computing
Sean Hallgren (2002)
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
Daniel Simon (1994)
On the power of quantum computationProceedings 35th Annual Symposium on Foundations of Computer Science
A. Ambainis (2003)
Quantum walk algorithm for element distinctness45th Annual IEEE Symposium on Foundations of Computer Science
D. R. Simon (1997)
On the Power of Quantum ComputationSiam", J. Comput., 26
Andrew Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, D. Spielman (2002)
Exponential algorithmic speedup by a quantum walk
Jasper Bongertz (1968)
The Needle in the HaystackThe Police Journal: Theory, Practice and Principles, 41
L. A. Levin (1973)
Universal Search ProblemsProblems of Information Transmission, 9
L. Levin (1973)
Problems of Information Transmission
S. Cook (1971)
The complexity of theorem-proving proceduresProceedings of the third annual ACM symposium on Theory of computing
Lattice problems in NP ∩ co-NP, " manuscript in preparation
R. Beals (1997)
Quantum computation of Fourier transforms over symmetric groups
M. Bordewich, M. Freedman, L. Lovász, D. Welsh (2005)
Approximate Counting and Quantum ComputationCombinatorics, Probability and Computing, 14
Mark Ettinger, P. Høyer, E. Knill (1999)
Hidden Subgroup States are Almost OrthogonalarXiv: Quantum Physics
We discuss the progress (or lack of it) that has been made in discovering algorithms for computation on a quantum computer. Some possible reasons are given for the paucity of quantum algorithms so far discovered, and a short survey is given of the state of the field.
Quantum Information Processing – Springer Journals
Published: Dec 30, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.