Quantum Algorithms

Quantum computers use the quantum interference of diierent computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identiied when quantum computation is viewed as multi-particle interference. We use this approach to review (and improve) some of the existing quantum algorithms and to show how they are related to diierent instances of quantum phase estimation. We provide an explicit algorithm for generating any prescribed interference pattern with an arbitrary precision.

[1]  P. Benioff.  Quantum Mechanical Models of Turing Machines That Dissipate No Energy , 1982 .

[2]  Sandy Irani,et al.  The Power of Quantum Systems on a Line , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[3]  John Watrous,et al.  Quantum algorithms for solvable groups , 2000, STOC '01.

[4]  Felix Wu,et al.  The quantum query complexity of approximating the median and related statistics , 1998, STOC '99.

[5]  D. Coppersmith.  An approximate Fourier transform useful in quantum factoring , 2002, quant-ph/0201067.

[6]  Thomas Thierauf,et al.  The Quantum Query Complexity of Algebraic Properties , 2007, FCT.

[7]  Seth Lloyd,et al.  Adiabatic quantum computation is equivalent to standard quantum computation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[8]  Lov K. Grover.  A framework for fast quantum mechanical algorithms , 1997, STOC '98.

[9]  P. Høyer.  Efficient Quantum Transforms , 1997, quant-ph/9702028.

[10]  Simone Severini.  On the Digraph of a Unitary Matrix , 2003, SIAM J. Matrix Anal. Appl..

[11]  Gadiel Seroussi,et al.  Efficient Quantum Algorithms for Estimating Gauss Sums , 2002, quant-ph/0207131.

[12]  Andrew M. Childs,et al.  ANY AND-OR FORMULA OF SIZE N CAN BE EVALUATED IN TIME N ON A QUANTUM COMPUTER∗ , 2010 .

[13]  Andris Ambainis,et al.  Quantum Algorithms for Matching and Network Flows , 2006, STACS.

[14]  Umesh V. Vazirani,et al.  How powerful is adiabatic quantum computation? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[15]  Alexander Russell,et al.  Classical and quantum function reconstruction via character evaluation , 2004, J. Complex..

[16]  Dima Grigoriev,et al.  Testing Shift-Equivalence of Polynomials by Deterministic, Probabilistic and Quantum Machines , 1997, Theor. Comput. Sci..

[17]  A. Carlini,et al.  Quantum template matching , 2001 .

[18]  Amnon Ta-Shma,et al.  Adiabatic Quantum State Generation , 2007, SIAM J. Comput..

[19]  Alain Tapp.  Quantum Algorithm for the Collision Problem , 2008, Encyclopedia of Algorithms.

[20]  Sean Hallgren,et al.  Efficient Quantum Algorithms for Shifted Quadratic Character Problems , 2000, ArXiv.

[21]  Andrew M. Childs,et al.  Discrete-Query Quantum Algorithm for NAND Trees , 2009, Theory Comput..

[22]  Phillip Kaye.  Optimized quantum implementation of elliptic curve arithmetic over binary fields , 2005, Quantum Inf. Comput..

[23]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[24]  R. Cleve,et al.  Efficient Quantum Algorithms for Simulating Sparse Hamiltonians , 2005, quant-ph/0508139.

[25]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[26]  E. Knill,et al.  Simulating physical phenomena by quantum networks , 2001, quant-ph/0108146.

[27]  Edward Farhi,et al.  A Quantum Algorithm for the Hamiltonian NAND Tree , 2008, Theory Comput..

[28]  László Lovász,et al.  Approximate Counting and Quantum Computation , 2005, Combinatorics, Probability and Computing.

[29]  M. Ruskai,et al.  Bounds for the adiabatic approximation with applications to quantum computation , 2006, quant-ph/0603175.

[30]  Mehdi Mhalla,et al.  Quantum Query Complexity of Some Graph Problems , 2004, SIAM J. Comput..

[31]  A. Chatterjee,et al.  Introduction to Quantum Computation , 2003 .

[32]  T. Hogg.  Quantum search heuristics , 2000 .

[33]  Alexander Russell,et al.  Normal subgroup reconstruction and quantum computation using group representations , 2000, STOC '00.

[34]  Seth Lloyd,et al.  Universal Quantum Simulators , 1996, Science.

[35]  Frédéric Magniez,et al.  Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem , 2001, SPAA '01.

[36]  M. Szegedy,et al.  Quantum Walk Based Search Algorithms , 2008, TAMC.

[37]  Frédéric Magniez,et al.  Quantum algorithms for the triangle problem , 2005, SODA '05.

[38]  Schumacher,et al.  Quantum coding. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[39]  Andris Ambainis,et al.  Quantum search of spatial regions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[40]  L. Fortnow,et al.  Quantum property testing , 2002, SODA '03.

[41]  R. Jozsa.  Quantum algorithms and the Fourier transform , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[42]  Sean Hallgren,et al.  Fast quantum algorithms for computing the unit group and class group of a number field , 2005, STOC '05.

[43]  Martin Rötteler,et al.  Limitations of quantum coset states for graph isomorphism , 2006, STOC '06.

[44]  Frédéric Magniez,et al.  Search via quantum walk , 2006, STOC '07.

[45]  Greg Kuperberg.  A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem , 2005, SIAM J. Comput..

[46]  Louis H. Kauffman,et al.  Topological quantum computing and the Jones polynomial , 2006, SPIE Defense + Commercial Sensing.

[47]  R. Cleve,et al.  Quantum algorithms revisited , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[48]  Frédéric Magniez,et al.  Quantum Complexity of Testing Group Commutativity , 2005, Algorithmica.

[49]  N. Cerf,et al.  Quantum search by local adiabatic evolution , 2001, quant-ph/0107015.

[50]  J. Mark Ettinger.  Quantum Time-Frequency Transforms , 2000 .

[51]  Martin Rötteler,et al.  Fast Quantum Fourier Transforms for a Class of Non-Abelian Groups , 1999, AAECC.

[52]  Miklos Santha,et al.  An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups , 2007, Algorithmica.

[53]  Oded Regev,et al.  Quantum computation and lattice problems , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[54]  Pawel Wocjan,et al.  The Jones polynomial: quantum algorithms and applications in quantum complexity theory , 2008, Quantum Inf. Comput..

[55]  A. Russell,et al.  A classical one-way function to confound quantum adversaries , 2007, quant-ph/0701115.

[56]  Gilles Brassard,et al.  Quantum Counting , 1998, ICALP.

[57]  G. Brassard,et al.  Quantum Amplitude Amplification and Estimation , 2000, quant-ph/0005055.

[58]  Frédéric Magniez,et al.  Quantum Algorithms for Element Distinctness , 2005, SIAM J. Comput..

[59]  François Le Gall,et al.  Quantum Property Testing of Group Solvability , 2008, LATIN.

[60]  Anargyros Papageorgiou,et al.  Quantum Algorithms and Complexity for Continuous Problems , 2007, Encyclopedia of Complexity and Systems Science.

[61]  Sean Hallgren,et al.  An improved quantum Fourier transform algorithm and applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[62]  Matthias Christandl,et al.  Quantum Information Processing: From Theory to Experiment , 2006 .

[63]  M. Sipser,et al.  Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.

[64]  Mark Ettinger,et al.  On Quantum Algorithms for Noncommutative Hidden Subgroups , 1998, STACS.

[65]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[66]  Andris Ambainis,et al.  Quantum walk algorithm for element distinctness , 2003, 45th Annual IEEE Symposium on Foundations of Computer Science.

[67]  Miklos Santha,et al.  Efficient testing of groups , 2005, STOC '05.

[68]  H. Yuen.  Quantum detection and estimation theory , 1978, Proceedings of the IEEE.

[69]  D. Welsh.  Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .

[70]  Ben Reichardt,et al.  Span-program-based quantum algorithm for evaluating formulas , 2007, Theory Comput..

[71]  Michele Mosca,et al.  Quantum Computer Algorithms , 2003 .

[72]  E. Farhi,et al.  A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.

[73]  Alexander Russell,et al.  The power of basis selection in fourier sampling: hidden subgroup problems in affine groups , 2004, SODA '04.

[74]  L. Ballentine,et al.  Probabilistic and Statistical Aspects of Quantum Theory , 1982 .

[75]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[76]  Lov K. Grover,et al.  How significant are the known collision and element distinctness quantum algorithms? , 2004, Quantum Inf. Comput..

[77]  Michele Mosca,et al.  The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer , 1998, QCQC.

[78]  Michele Mosca,et al.  Exact quantum Fourier transforms and discrete logarithm algorithms , 2003 .

[79]  D. Welsh,et al.  On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.

[80]  Jaikumar Radhakrishnan,et al.  On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group , 2005, ICALP.

[81]  Michele Mosca,et al.  Decomposing finite Abelian groups , 2001, Quantum Inf. Comput..

[82]  Christoph Dürr,et al.  A Quantum Algorithm for Finding the Minimum , 1996, ArXiv.

[83]  D. Bacon,et al.  Efficient quantum circuits for Schur and Clebsch-Gordan transforms. , 2004, Physical review letters.

[84]  Alexei Y. Kitaev,et al.  Quantum measurements and the Abelian Stabilizer Problem , 1995, Electron. Colloquium Comput. Complex..

[85]  Richard J. Lipton,et al.  Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract) , 1995, CRYPTO.

[86]  Umesh V. Vazirani,et al.  Quantum mechanical algorithms for the nonabelian hidden subgroup problem , 2001, STOC '01.

[87]  Julia Kempe,et al.  The hidden subgroup problem and permutation group theory , 2004, SODA '05.

[88]  R. Feynman.  Simulating physics with computers , 1999 .

[89]  Pawel Wocjan,et al.  Efficient quantum algorithm for identifying hidden polynomials , 2007, Quantum Inf. Comput..

[90]  Alexander Russell,et al.  For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets , 2007, Quantum Inf. Comput..

[91]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[92]  M. Brown.  Classical Cryptosystems In A Quantum Setting , 2004, quant-ph/0404061.

[93]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 2001, JACM.

[94]  E. Farhi,et al.  Quantum computation and decision trees , 1997, quant-ph/9706062.

[95]  Igor E. Shparlinski,et al.  Classical and Quantum Algorithms for Exponential Congruences , 2008, TQC.

[96]  Alexander Russell,et al.  Generic quantum Fourier transforms , 2004, SODA '04.

[97]  Jan Neerbek,et al.  Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness , 2002, Algorithmica.

[98]  Dorit Aharonov,et al.  A Polynomial Quantum Algorithm for Approximating the Jones Polynomial , 2008, Algorithmica.

[99]  Christof Zalka,et al.  Efficient Simulation of Quantum Systems by Quantum Computers , 1998 .

[100]  Andris Ambainis,et al.  QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS , 2003, quant-ph/0403120.

[101]  Andris Ambainis,et al.  Quantum walks on graphs , 2000, STOC '01.

[102]  Charles H. Bennett.  Notes on the history of reversible computation , 2000, IBM J. Res. Dev..

[103]  S. Lloyd,et al.  Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors , 1998, quant-ph/9807070.

[104]  Christof Zalka,et al.  Shor's discrete logarithm quantum algorithm for elliptic curves , 2003, Quantum Inf. Comput..

[105]  Alan D. Sokal.  The multivariate Tutte polynomial (alias Potts model) for graphs and matroids , 2005, Surveys in Combinatorics.

[106]  Peter Høyer,et al.  Introduction to Recent Quantum Algorithms , 2001, MFCS.

[107]  M H Freedman,et al.  P/NP, and the quantum field computer , 1998, Proc. Natl. Acad. Sci. USA.

[108]  William K. Wootters,et al.  A ‘Pretty Good’ Measurement for Distinguishing Quantum States , 1994 .

[109]  Edward Farhi,et al.  An Example of the Difference Between Quantum and Classical Random Walks , 2002, Quantum Inf. Process..

[110]  Andris Ambainis,et al.  Quantum lower bounds by quantum arguments , 2000, STOC '00.

[111]  Andris Ambainis,et al.  Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer , 2010, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[112]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[113]  John Watrous,et al.  Continuous-Time Quantum Walks on the Symmetric Group , 2003, RANDOM-APPROX.

[114]  T. Beth,et al.  Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups , 1998, quant-ph/9812070.

[115]  Robert Beals,et al.  Quantum computation of Fourier transforms over symmetric groups , 1997, STOC '97.

[116]  E. Farhi,et al.  Quantum Adiabatic Evolution Algorithms with Different Paths , 2002, quant-ph/0208135.

[117]  Julia Kempe.  Approaches to quantum error correction , 2006 .

[118]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[119]  R. Cleve.  An Introduction to Quantum Complexity Theory , 1999, quant-ph/9906111.

[120]  Gadiel Seroussi,et al.  Quantum Algorithms for Estimating Gauss Sums and Calculating Discrete Logarithms , 2003 .

[121]  Emanuel Knill,et al.  The quantum query complexity of the hidden subgroup problem is polynomial , 2004, Inf. Process. Lett..

[122]  P. Høyer.  Conjugated operators in quantum algorithms , 1999 .

[123]  Stephen Wiesner,et al.  Conjugate coding , 1983, SIGA.

[124]  Dave Bacon,et al.  From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[125]  Harry Buhrman,et al.  Quantum verification of matrix products , 2004, SODA '06.

[126]  I. Chuang,et al.  Quantum Digital Signatures , 2001, quant-ph/0105032.

[127]  G. Brassard,et al.  Oracle Quantum Computing , 1992, Workshop on Physics and Computation.

[128]  D. Aharonov,et al.  Polynomial Quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane Preliminary Version , 2008 .

[129]  Gilles Brassard,et al.  The quantum challenge to structural complexity theory , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[130]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[131]  Scott Aaronson,et al.  Algorithms for Boolean Function Query Properties , 2001, SIAM J. Comput..

[132]  Alexander Russell,et al.  On the impossibility of a quantum sieve algorithm for graph isomorphism , 2007, STOC '07.

[133]  Julia Kempe,et al.  Quantum random walks: An introductory overview , 2003, quant-ph/0303081.

[134]  M. Ben-Or,et al.  Quantum Search in an Ordered List via Adaptive Learning , 2007, quant-ph/0703231.

[135]  Yuri I. Manin,et al.  Classical computing, quantum computing, and Shor's factoring algorithm , 1999, quant-ph/9903008.

[136]  Bartholomew Furrow,et al.  A panoply of quantum algorithms , 2006, Quantum Inf. Comput..

[137]  Michele Mosca,et al.  Counting by quantum eigenvalue estimation , 2001, Theor. Comput. Sci..

[138]  Shengyu Zhang.  New upper and lower bounds for randomized and quantum local search , 2006, STOC '06.

[139]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[140]  David Chaum,et al.  Advances in Cryptology: Proceedings Of Crypto 83 , 2012 .

[141]  Tim Byrnes,et al.  Simulating lattice gauge theories on a quantum computer (熱場の量子論とその応用) , 2006 .

[142]  Miklos Santha,et al.  An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups , 2007, STACS.

[143]  Andrew M. Childs,et al.  Quantum algorithm for a generalized hidden shift problem , 2005, SODA '07.

[144]  Alexander Russell,et al.  Quantum algorithms for Simon's problem over general groups , 2006, SODA '07.

[145]  Sean Hallgren,et al.  Quantum algorithms for some hidden shift problems , 2003, SODA '03.

[146]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[147]  Ulrich Vollmer,et al.  Polynomial time quantum algorithm for the computation of the unit group of a number field , 2005, STOC '05.

[148]  Frédéric Magniez,et al.  Hidden translation and orbit coset in quantum computing , 2002, STOC '03.

[149]  Richard Jozsa.  Notes on Hallgren's efficient quantum algorithm for solving Pell's equation , 2003 .

[150]  Andris Ambainis,et al.  Quantum search algorithms , 2004, SIGA.

[151]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[152]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[153]  Daniel A. Spielman,et al.  Exponential algorithmic speedup by a quantum walk , 2002, STOC '03.

[154]  Dmitry Gavinsky,et al.  Quantum Algorithms for Evaluating Min-MaxTrees , 2008, TQC.

[155]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.

[156]  Michele Mosca,et al.  Optimal phase estimation in quantum networks , 2007, 0706.4412.

[157]  M. Freedman,et al.  Simulation of Topological Field Theories¶by Quantum Computers , 2000, quant-ph/0001071.

[158]  Gilles Brassard,et al.  An exact quantum polynomial-time algorithm for Simon's problem , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[159]  A. Kitaev.  Quantum computations: algorithms and error correction , 1997 .

[160]  Richard Cleve,et al.  The query complexity of order-finding , 1999, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[161]  Ronald de Wolf,et al.  Quantum Search on Bounded-Error Inputs , 2003, ICALP.

[162]  Edward Farhi,et al.  Analog analogue of a digital quantum computation , 1996 .