Quantum Algorithm Design: Techniques and Applications

In recent years, rapid developments of quantum computer are witnessed in both the hardware and the algorithm domains, making it necessary to have an updated review of some major techniques and applications in quantum algorithm design.In this survey as well as tutorial article, the authors first present an overview of the development of quantum algorithms, then investigate five important techniques: Quantum phase estimation, linear combination of unitaries, quantum linear solver, Grover search, and quantum walk, together with their applications in quantum state preparation, quantum machine learning, and quantum search. In the end, the authors collect some open problems influencing the development of future quantum algorithms.

[1]  Andris Ambainis,et al.  One-dimensional quantum walks , 2001, STOC '01.

[2]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[3]  Scott Pakin,et al.  Quantum Algorithm Implementations for Beginners , 2018, ACM Transactions on Quantum Computing.

[4]  Kai-Min Chung,et al.  SPACE-EFFICIENT CLASSICAL AND QUANTUM ALGORITHMS FOR THE SHORTEST , 2018 .

[5]  Scott Aaronson,et al.  BQP and the polynomial hierarchy , 2009, STOC '10.

[6]  E. Bagan,et al.  Quantum learning without quantum memory , 2011, Scientific Reports.

[7]  Steven D. Galbraith,et al.  Improved algorithm for the isogeny problem for ordinary elliptic curves , 2011, Applicable Algebra in Engineering, Communication and Computing.

[8]  Anton Stolbunov,et al.  Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves , 2010, Adv. Math. Commun..

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

[10]  Simon Haykin,et al.  Neural Networks and Learning Machines , 2010 .

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

[12]  Alexander Russell,et al.  The Hidden Subgroup Problem and Quantum Computation Using Group Representations , 2003, SIAM J. Comput..

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

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

[15]  Stacey Jeffery,et al.  A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates , 2013, ArXiv.

[16]  Hidenori Kuwakado,et al.  Security on the quantum-type Even-Mansour cipher , 2012, 2012 International Symposium on Information Theory and its Applications.

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

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

[19]  Xiaoming Sun.  A survey on quantum computing , 2016 .

[20]  L. Clark,et al.  Ramsey numbers and adiabatic quantum computing. , 2011, Physical review letters.

[21]  R. Cleve,et al.  Quantum fingerprinting. , 2001, Physical review letters.

[22]  Lane H. Clark,et al.  Graph isomorphism and adiabatic quantum computing , 2013, ArXiv.

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

[24]  Ben Reichardt,et al.  Reflections for quantum query algorithms , 2010, SODA '11.

[25]  Andris Ambainis,et al.  New Developments in Quantum Algorithms , 2010, MFCS.

[26]  Maria Schuld,et al.  The quest for a Quantum Neural Network , 2014, Quantum Information Processing.

[27]  Roger Melko,et al.  Quantum Boltzmann Machine , 2016, 1601.02036.

[28]  Ben Reichardt,et al.  Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection , 2012, ESA.

[29]  Iordanis Kerenidis,et al.  Quantum Recommendation Systems , 2016, ITCS.

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

[31]  H. Briegel,et al.  Experimental demonstration of five-photon entanglement and open-destination teleportation , 2004, Nature.

[32]  Peng Li,et al.  Simulation of a Multidimensional Input Quantum Perceptron , 2018, Quantum Inf. Process..

[33]  Ashley Montanaro,et al.  Applying quantum algorithms to constraint satisfaction problems , 2018, Quantum.

[34]  Seth Lloyd,et al.  Quantum algorithm for data fitting. , 2012, Physical review letters.

[35]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[36]  Ronald de Wolf,et al.  Convex optimization using quantum oracles , 2018, Quantum.

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

[38]  A. Kitaev.  Fault tolerant quantum computation by anyons , 1997, quant-ph/9707021.

[39]  Cynthia Dwork,et al.  A public-key cryptosystem with worst-case/average-case equivalence , 1997, STOC '97.

[40]  Ben Reichardt,et al.  The quantum adiabatic optimization algorithm and local minima , 2004, STOC '04.

[41]  László Babai,et al.  On the Complexity of Canonical Labeling of Strongly Regular Graphs , 1980, SIAM J. Comput..

[42]  S. Aaronson.  Read the fine print , 2015, Nature Physics.

[43]  Dave Bacon,et al.  Optimal measurements for the dihedral hidden subgroup problem , 2005, Chic. J. Theor. Comput. Sci..

[44]  Frédéric Wang.  The Hidden Subgroup Problem , 2010, 1008.0010.

[45]  Ashish Kapoor,et al.  Quantum deep learning , 2014, Quantum Inf. Comput..

[46]  Iordanis Kerenidis,et al.  A Quantum Interior Point Method for LPs and SDPs , 2018, ACM Transactions on Quantum Computing.

[47]  Scott Aaronson,et al.  The limits of quantum computers. , 2008 .

[48]  Almut Beige,et al.  Hidden Quantum Markov Models and Open Quantum Systems with Instantaneous Feedback , 2014, 1406.5847.

[49]  O. Regev.  A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space , 2004, quant-ph/0406151.

[50]  Gilles Brassard,et al.  Quantum Cryptanalysis of Hash and Claw-Free Functions , 1998, LATIN.

[51]  François Le Gall,et al.  Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups , 2004, Quantum Inf. Comput..

[52]  J. Ignacio Cirac,et al.  Computational speedups using small quantum devices , 2018, Physical review letters.

[53]  Ashwin Nayak,et al.  Quantum Analogs of Markov Chains , 2015 .

[54]  Trevor Hastie,et al.  The Elements of Statistical Learning , 2001 .

[55]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[56]  Daniel A. Lidar,et al.  Quantum adiabatic machine learning , 2011, Quantum Inf. Process..

[57]  Daniel A. Spielman,et al.  Faster isomorphism testing of strongly regular graphs , 1996, STOC '96.

[58]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

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

[60]  M. Altaisky.  Quantum neural network , 2001 .

[61]  Masoud Mohseni,et al.  Quantum support vector machine for big feature and big data classification , 2013, Physical review letters.

[62]  Seth Lloyd,et al.  Quantum singular-value decomposition of nonsparse low-rank matrices , 2016, 1607.05404.

[63]  Peter Høyer,et al.  Efficient quantum walk on the grid with multiple marked elements , 2017, STACS.

[64]  Anja Becker,et al.  New directions in nearest neighbor searching with applications to lattice sieving , 2016, IACR Cryptol. ePrint Arch..

[65]  M. Suzuki,et al.  General theory of fractal path integrals with applications to many‐body theories and statistical physics , 1991 .

[66]  Jennifer L. Barry,et al.  Quantum partially observable Markov decision processes , 2014 .

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

[68]  Nathan Wiebe,et al.  Hamiltonian simulation using linear combinations of unitary operations , 2012, Quantum Inf. Comput..

[69]  David Jao,et al.  Constructing elliptic curve isogenies in quantum subexponential time , 2010, J. Math. Cryptol..

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

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

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

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

[74]  I. Jex,et al.  Optimized quantum random-walk search algorithms on the hypercube , 2008, 0805.4347.

[75]  Oded Regev,et al.  New lattice based cryptographic constructions , 2003, STOC '03.

[76]  F. Petruccione,et al.  An introduction to quantum machine learning , 2014, Contemporary Physics.

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

[78]  P. Coveney,et al.  Scalable Quantum Simulation of Molecular Energies , 2015, 1512.06860.

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

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

[81]  Michele Mosca,et al.  Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3 , 2016, SAC.

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

[83]  Ben Reichardt.  Faster quantum algorithm for evaluating game trees , 2011, SODA '11.

[84]  Ethem Alpaydin,et al.  Introduction to machine learning , 2004, Adaptive computation and machine learning.

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

[86]  A. Prakash,et al.  Quantum gradient descent for linear systems and least squares , 2017, Physical Review A.

[87]  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.

[88]  S. Lloyd,et al.  Quantum Hopfield neural network , 2017, Physical Review A.

[89]  Andrew M. Childs.  On the Relationship Between Continuous- and Discrete-Time Quantum Walk , 2008, 0810.0312.

[90]  Alexander Russell,et al.  The Symmetric Group Defies Strong Fourier Sampling , 2008, SIAM J. Comput..

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

[92]  Maria Schuld,et al.  Supervised Learning with Quantum Computers , 2018 .

[93]  Ronald de Wolf,et al.  Bounds for small-error and zero-error quantum algorithms , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[94]  Robert Gardner,et al.  Quantum generalisation of feedforward neural networks , 2016, npj Quantum Information.

[95]  T. Monz,et al.  14-Qubit entanglement: creation and coherence. , 2010, Physical review letters.

[96]  François Le Gall.  Improved output-sensitive quantum algorithms for Boolean matrix multiplication , 2012, SODA.

[97]  T. Hogg.  Adiabatic Quantum Computing for Random Satisfiability Problems , 2002, quant-ph/0206059.

[98]  Carlo A. Trugenberger,et al.  Quantum Pattern Recognition , 2002, Quantum Inf. Process..

[99]  R. Tibshirani,et al.  An introduction to the bootstrap , 1993 .

[100]  S. Lloyd,et al.  Quantum principal component analysis , 2013, Nature Physics.

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

[102]  Matthew Day,et al.  Advances in quantum machine learning , 2015, 1512.02900.

[103]  A. Harrow,et al.  Quantum algorithm for linear systems of equations. , 2008, Physical review letters.

[104]  N. Gershenfeld,et al.  Bulk Spin-Resonance Quantum Computation , 1997, Science.

[105]  Andris Ambainis,et al.  Any AND-OR Formula of Size N Can Be Evaluated in Time N1/2+o(1) on a Quantum Computer , 2010, SIAM J. Comput..

[106]  Jacob biamonte,et al.  Quantum machine learning , 2016, Nature.

[107]  Hidenori Kuwakado,et al.  Quantum distinguisher between the 3-round Feistel cipher and the random permutation , 2010, 2010 IEEE International Symposium on Information Theory.

[108]  Andris Ambainis,et al.  Variable time amplitude amplification and quantum algorithms for linear algebra problems , 2012, STACS.

[109]  Stacey Jeffery,et al.  The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation , 2018, ICALP.

[110]  Ronald de Wolf,et al.  A Survey of Quantum Learning Theory , 2017, ArXiv.

[111]  Yoshifumi Inui,et al.  Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups , 2004, Quantum Inf. Comput..

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

[113]  Guoming Wang.  Quantum Algorithm for Linear Regression , 2017 .

[114]  Amnon Ta-Shma,et al.  Adiabatic quantum state generation and statistical zero knowledge , 2003, STOC '03.

[115]  M. Schuld,et al.  Circuit-centric quantum classifiers , 2018, Physical Review A.

[116]  Viv Kendon,et al.  Quantum walks on general graphs , 2003, quant-ph/0306140.

[117]  Frederick W. Strauch,et al.  Connecting the discrete- and continuous-time quantum walks , 2006 .

[118]  Andrew M. Childs,et al.  Limitations on the simulation of non-sparse Hamiltonians , 2009, Quantum Inf. Comput..

[119]  X-Q Zhou,et al.  Experimental realization of Shor's quantum factoring algorithm using qubit recycling , 2011, Nature Photonics.

[120]  Martin Rötteler,et al.  Post-Quantum Cryptography , 2015, Lecture Notes in Computer Science.

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

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

[123]  M. Freedman,et al.  Topological Quantum Computation , 2001, quant-ph/0101025.

[124]  Peter W. Shor,et al.  Progress in Quantum Algorithms , 2004, Quantum Inf. Process..

[125]  Jian-Wei Pan,et al.  Demonstration of a compiled version of Shor's quantum factoring algorithm using photonic qubits. , 2007, Physical review letters.

[126]  Salvador Elías Venegas-Andraca,et al.  Quantum walks: a comprehensive review , 2012, Quantum Information Processing.

[127]  Andrew M. Childs,et al.  Quantum Query Complexity of Minor-Closed Graph Properties , 2012, SIAM J. Comput..

[128]  Simone Severini,et al.  Quantum linear systems algorithms: a primer , 2018, ArXiv.

[129]  E. Rieffel,et al.  Quantum Computing: A Gentle Introduction , 2011 .

[130]  Christof Zalka.  GROVER'S QUANTUM SEARCHING ALGORITHM IS OPTIMAL , 1997, quant-ph/9711070.

[131]  Dmitry Gavinsky,et al.  Quantum solution to the hidden subgroup problem for poly-near-hamiltonian groups , 2004, Quantum Inf. Comput..

[132]  Joseph H. Silverman,et al.  NTRU: A Ring-Based Public Key Cryptosystem , 1998, ANTS.

[133]  François Le Gall,et al.  Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[134]  Julia Kempe,et al.  Discrete Quantum Walks Hit Exponentially Faster , 2003, RANDOM-APPROX.

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

[136]  M. Schuld,et al.  Prediction by linear regression on a quantum computer , 2016, 1601.07823.

[137]  B. Lanyon,et al.  Experimental demonstration of a compiled version of Shor's algorithm with quantum entanglement. , 2007, Physical review letters.

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

[139]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[140]  Chunhao Wang,et al.  A quantum algorithm for simulating non-sparse Hamiltonians , 2018, Quantum Inf. Comput..

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

[142]  François Le Gall,et al.  Quantum Algorithms for Matrix Products over Semirings , 2017, Chic. J. Theor. Comput. Sci..

[143]  Xiao-Shan Gao,et al.  Quantum Algorithms for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems , 2017, IACR Cryptol. ePrint Arch..

[144]  W. Cleveland,et al.  Locally Weighted Regression: An Approach to Regression Analysis by Local Fitting , 1988 .

[145]  Mark Ettinger,et al.  On Quantum Algorithms for Noncommutative Hidden Subgroups , 2000, Adv. Appl. Math..

[146]  Tony R. Martinez,et al.  Quantum associative memory , 2000, Inf. Sci..

[147]  Hiroshi Sekigawa,et al.  Quantum Fourier transform over symmetric groups - improved result , 2016, J. Symb. Comput..

[148]  Xiaodi Wu,et al.  Quantum SDP Solvers: Large Speed-Ups, Optimality, and Applications to Quantum Learning , 2017, ICALP.

[149]  P. Benioff.  The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines , 1980 .

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

[151]  Sean Hallgren,et al.  Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem , 2002, STOC '02.

[152]  Andris Ambainis,et al.  Coins make quantum walks faster , 2004, SODA '05.

[153]  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.

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

[155]  Ashley Montanaro,et al.  Quantum algorithms: an overview , 2015, npj Quantum Information.

[156]  S. Lloyd,et al.  Quantum algorithms for supervised and unsupervised machine learning , 2013, 1307.0411.

[157]  Sunil Arya,et al.  Space-time tradeoffs for approximate nearest neighbor searching , 2009, JACM.

[158]  Lov K. Grover,et al.  Creating superpositions that correspond to efficiently integrable probability distributions , 2002, quant-ph/0208112.

[159]  Andrew M. Childs,et al.  Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision , 2015, SIAM J. Comput..

[160]  Richard J. Lipton,et al.  Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract) , 1996, CRYPTO.

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

[162]  Theodore J. Yoder,et al.  Fixed-point quantum search with an optimal number of queries. , 2014, Physical review letters.

[163]  Maria Schuld,et al.  Simulating a perceptron on a quantum computer , 2014, ArXiv.

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

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

[166]  Andrew M. Childs,et al.  Black-box hamiltonian simulation and unitary implementation , 2009, Quantum Inf. Comput..

[167]  Andris Ambainis.  Quantum Search with Variable Times , 2009, Theory of Computing Systems.

[168]  Lov K. Grover,et al.  Fixed-point quantum search. , 2005, Physical review letters.

[169]  Michele Mosca,et al.  Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search , 2013, PQCrypto.

[170]  Jian-Wei Pan,et al.  Experimental realization of quantum algorithm for solving linear systems of equations , 2013, 1302.1946.

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

[172]  Peter Høyer,et al.  Controlled Quantum Amplification , 2017, ICALP.

[173]  Jeong San Kim,et al.  Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to Abelian cases , 2006 .

[174]  Seth Lloyd,et al.  Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation , 2007, SIAM J. Comput..

[175]  Andrew M. Childs,et al.  Simulating Sparse Hamiltonians with Star Decompositions , 2010, TQC.

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

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

[178]  Andrew M. Childs.  Quantum algorithms: Equation solving by simulation , 2009 .

[179]  Krysta Marie Svore,et al.  Quantum Speed-Ups for Solving Semidefinite Programs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[180]  K. Birgitta Whaley,et al.  Quantum random-walk search algorithm , 2002, quant-ph/0210064.

[181]  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).

[182]  Gene H. Golub,et al.  Matrix computations , 1983 .

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

[184]  D. DiVincenzo,et al.  Quantum computation with quantum dots , 1997, cond-mat/9701055.

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

[186]  Stephen J. Wright,et al.  Optimization for Machine Learning , 2013 .

[187]  Aram Wettroth Harrow.  Quantum Algorithms for Systems of Linear Equations , 2016, Encyclopedia of Algorithms.

[188]  Isaac L. Chuang,et al.  Quantum Inference on Bayesian Networks , 2014, ArXiv.

[189]  Oded Regev.  Quantum Computation and Lattice Problems , 2004, SIAM J. Comput..

[190]  Aleksandrs Belovs,et al.  Learning-Graph-Based Quantum Algorithm for k-Distinctness , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

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

[192]  R. Schützhold,et al.  Pattern recognition on a quantum computer , 2003 .

[193]  Raymond Laflamme,et al.  An Introduction to Quantum Computing , 2007, Quantum Inf. Comput..

[194]  Hans-J. Briegel,et al.  Machine learning \& artificial intelligence in the quantum domain , 2017, ArXiv.

[195]  Dmitri Maslov,et al.  Toward the first quantum simulation with quantum speedup , 2017, Proceedings of the National Academy of Sciences.

[196]  Michael A. Nielsen,et al.  The Solovay-Kitaev algorithm , 2006, Quantum Inf. Comput..

[197]  L. Wossnig,et al.  Quantum Linear System Algorithm for Dense Matrices. , 2017, Physical review letters.

[198]  N. Gershenfeld,et al.  Experimental Implementation of Fast Quantum Searching , 1998 .

[199]  Ryan Williams,et al.  Finding, Minimizing, and Counting Weighted Subgraphs , 2013, SIAM J. Comput..

[200]  Ryan Williams,et al.  A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..

[201]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

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

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

[204]  Nayak Ashwin,et al.  Quantum Walk on the Line , 2000 .

[205]  Hristo S. Tonchev.  Alternative Coins for Quantum Random Walk Search Optimized for a Hypercube , 2015 .

[206]  Stacey Jeffery,et al.  Nested Quantum Walks with Quantum Data Structures , 2012, SODA.

[207]  Zeph Landau,et al.  Quantum Computation and the Evaluation of Tensor Networks , 2008, SIAM J. Comput..

[208]  Philip Walther,et al.  2 a b c d State qubit : Eigenvalue qubit : Ancilla qubit : 1 , 2013 .

[209]  Yin Tat Lee,et al.  A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[210]  D. Meyer.  From quantum cellular automata to quantum lattice gases , 1996, quant-ph/9604003.

[211]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.

[212]  Urmila Mahadev,et al.  Classical Verification of Quantum Computations , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[213]  Nathan Wiebe,et al.  Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics , 2018, STOC.

[214]  Avatar Tulsi,et al.  Faster quantum-walk algorithm for the two-dimensional spatial search , 2008, 0801.0497.

[215]  Andrew M. Childs,et al.  Simulating Hamiltonian dynamics with a truncated Taylor series. , 2014, Physical review letters.

[216]  Hiroshi Sekigawa,et al.  Quantum fourier transform over symmetric groups , 2013, ISSAC '13.

[217]  Long Gui-lu,et al.  General Quantum Interference Principle and Duality Computer , 2006 .

[218]  J. Cirac,et al.  Quantum Computations with Cold Trapped Ions. , 1995, Physical review letters.

[219]  S. Lloyd,et al.  Architectures for a quantum random access memory , 2008, 0807.4994.

[220]  Edward Farhi,et al.  Finding cliques by quantum adiabatic evolution , 2002, Quantum Inf. Comput..

[221]  L. Vandersypen,et al.  Implementation of a three-quantum-bit search algorithm , 1999, quant-ph/9910075.

[222]  Mile Gu,et al.  Experimental quantum computing to solve systems of linear equations. , 2013, Physical review letters.

[223]  Johan A. K. Suykens,et al.  Least Squares Support Vector Machine Classifiers , 1999, Neural Processing Letters.

[224]  Renato Portugal,et al.  The staggered quantum walk model , 2015, Quantum Information Processing.

[225]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[226]  Andrew M. Childs,et al.  Universal computation by quantum walk. , 2008, Physical review letters.

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

[228]  Simone Severini,et al.  Quantum machine learning: a classical perspective , 2017, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[229]  Daniel A. Lidar,et al.  Adiabatic quantum computation , 2016, 1611.04471.

[230]  P. Høyer,et al.  A Quantum Observable for the Graph Isomorphism Problem , 1999, quant-ph/9901029.

[231]  John Watrous.  Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity , 2001, J. Comput. Syst. Sci..

[232]  Frédéric Magniez,et al.  On the Hitting Times of Quantum Versus Random Walks , 2008, Algorithmica.

[233]  Y. Kivshar,et al.  Wide-band negative permeability of nonlinear metamaterials , 2012, Scientific Reports.

[234]  G. Long.  The General Quantum Interference Principle and the Duality Computer , 2005, quant-ph/0512120.

[235]  Long Gui-Lu,et al.  A Parallel Quantum Algorithm for the Satisfiability Problem , 2008 .

[236]  Umesh V. Vazirani,et al.  Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem , 2004, Comb..

[237]  R. Feynman.  Quantum mechanical computers , 1986 .

[238]  Ashish Kapoor,et al.  Quantum Perceptron Models , 2016, NIPS.

[239]  Ronald de Wolf,et al.  Quantum SDP-Solvers: Better Upper and Lower Bounds , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[240]  I. Chuang,et al.  Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance , 2001, Nature.

[241]  Aleksandrs Belovs,et al.  Span programs for functions with constant-sized 1-certificates: extended abstract , 2011, STOC '12.

[242]  María Naya-Plasencia,et al.  Breaking Symmetric Cryptosystems Using Quantum Period Finding , 2016, CRYPTO.

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

[244]  A. Messiah.  Quantum Mechanics , 1961 .

[245]  Jean-Charles Faugère,et al.  On the complexity of solving quadratic Boolean systems , 2011, J. Complex..

[246]  Seth Lloyd,et al.  Quantum random access memory. , 2007, Physical review letters.

[247]  Scott Aaronson,et al.  Quantum lower bounds for the collision and the element distinctness problems , 2004, JACM.

[248]  Luis Antonio Brasil Kowada,et al.  A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM , 2008 .

[249]  Frédéric Magniez,et al.  Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing , 2015, Algorithmica.

[250]  Tanja Lange,et al.  Quantum Algorithms for the Subset-Sum Problem , 2013, PQCrypto.

[251]  Andrew M. Childs,et al.  Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[252]  Andris Ambainis,et al.  Quantum Search of Spatial Regions , 2005, Theory Comput..

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

[254]  Stacey Jeffery,et al.  Frameworks for Quantum Algorithms , 2014 .

[255]  D. Deutsch.  Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[256]  Andrei N. Soklakov,et al.  Efficient state preparation for a register of quantum bits , 2004 .

[257]  Andrew M. Childs,et al.  Robustness of adiabatic quantum computation , 2001, quant-ph/0108048.

[258]  Elham Kashefi,et al.  Fast Quantum Algorithm for Solving Multivariate Quadratic Equations , 2017, IACR Cryptol. ePrint Arch..

[259]  Jeong San Kim,et al.  Notes on the hidden subgroup problem on some semi-direct product groups , 2006 .

[260]  Peter Wittek,et al.  Quantum Machine Learning: What Quantum Computing Means to Data Mining , 2014 .

[261]  B. D. Clader,et al.  Preconditioned quantum linear system algorithm. , 2013, Physical review letters.

[262]  Maris Ozols,et al.  Quantum Walks Can Find a Marked Element on Any Graph , 2010, Algorithmica.

[263]  Daniel Dadush,et al.  Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract , 2014, STOC.

[264]  W. Cleveland.  Robust Locally Weighted Regression and Smoothing Scatterplots , 1979 .

[265]  Daniel R. Simon.  On the Power of Quantum Computation , 1997, SIAM J. Comput..

[266]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .