On the Theory of Modern Quantum Algorithms

This dissertation unites variational computation with results and techniques appearing in the theory of ground state computation. It should be readable by graduate students. The topics covered include: Ising model reductions, stochastic versus quantum processes on graphs, quantum gates and circuits as tensor networks, variational quantum algorithms and Hamiltonian gadgets.

[1]  Boris A. Trakhtenbrot,et al.  A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms , 1984, Annals of the History of Computing.

[2]  Peter J. Love,et al.  Contextuality Test of the Nonclassicality of Variational Quantum Eigensolvers. , 2019, Physical review letters.

[3]  Yoshihisa Yamamoto,et al.  Mapping of Ising models onto injection-locked laser systems. , 2011, Optics express.

[4]  Ken-ichi Kawarabayashi,et al.  A coherent Ising machine for 2000-node optimization problems , 2016, Science.

[5]  Jesús Gómez-Gardeñes,et al.  Quantum Navigation and Ranking in Complex Networks , 2012, Scientific Reports.

[6]  M. Ying,et al.  Five two-qubit gates are necessary for implementing the Toffoli gate , 2013, 1301.3372.

[7]  Julia Kempe,et al.  The Complexity of the Local Hamiltonian Problem , 2004, FSTTCS.

[8]  U. Schollwoeck.  The density-matrix renormalization group in the age of matrix product states , 2010, 1008.3477.

[9]  A. Ganti,et al.  Family of [[6k,2k,2]] codes for practical and scalable adiabatic quantum computation , 2013, 1309.1674.

[10]  Jacob Biamonte,et al.  Topological classification of time-asymmetry in unitary quantum processes , 2017, Journal of Physics A: Mathematical and Theoretical.

[11]  James M. Crawford,et al.  Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..

[12]  P. Love,et al.  Quantum-Merlin-Arthur-complete problems for stoquastic Hamiltonians and Markov matrices , 2009, 0905.4755.

[13]  Frank Vewinger,et al.  Variable potentials for thermalized light and coupled condensates , 2017, Nature Photonics.

[14]  J. Gambetta,et al.  Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets , 2017, Nature.

[15]  F. Verstraete,et al.  Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems , 2008, 0907.2796.

[16]  M. B. Hastings,et al.  Classical and quantum bounded depth approximation algorithms , 2019, Quantum Inf. Comput..

[17]  Silvano Garnerone,et al.  Thermodynamic formalism for dissipative quantum walks , 2012, 1205.5744.

[18]  Peter D. Johnson,et al.  QVECTOR: an algorithm for device-tailored quantum error correction , 2017, 1711.02249.

[19]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[20]  H. Neven,et al.  Digitized adiabatic quantum computing with a superconducting circuit. , 2015, Nature.

[21]  Manlio De Domenico,et al.  Spectral entropies as information-theoretic tools for complex network comparison , 2016, 1609.01214.

[22]  Ville Bergholm,et al.  Community Detection in Quantum Complex Networks , 2013, 1310.6638.

[23]  A. Harrow,et al.  Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates , 2018, Communications in Mathematical Physics.

[24]  Barbara M. Terhal,et al.  Complexity of Stoquastic Frustration-Free Hamiltonians , 2008, SIAM J. Comput..

[25]  Alán Aspuru-Guzik,et al.  Resource efficient gadgets for compiling adiabatic quantum optimization problems , 2013, 1307.8041.

[26]  E. Farhi,et al.  A Quantum Approximate Optimization Algorithm , 2014, 1411.4028.

[27]  D. Gottesman.  The Heisenberg Representation of Quantum Computers , 1998, quant-ph/9807006.

[28]  Mark Howard,et al.  Simulation of quantum circuits by low-rank stabilizer decompositions , 2018, Quantum.

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

[30]  Bob Coecke,et al.  Interacting quantum observables: categorical algebra and diagrammatics , 2009, ArXiv.

[31]  C. Conti,et al.  Large-Scale Photonic Ising Machine by Spatial Light Modulation. , 2019, Physical review letters.

[32]  J. Biamonte.  Universal variational quantum computation , 2019, Physical Review A.

[33]  Dmitri Maslov,et al.  Complete 3-Qubit Grover search on a programmable quantum computer , 2017, Nature Communications.

[34]  G. Evenbly,et al.  Tensor Network States and Geometry , 2011, 1106.1082.

[35]  Subir Sachdev.  Viewpoint: Tensor networks—a new tool for old problems , 2009 .

[36]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

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

[38]  Román Orús,et al.  Advances on tensor network theory: symmetries, fermions, entanglement, and holography , 2014, 1407.6552.

[39]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[40]  H. Philathong,et al.  Computational Phase Transition Signature in Gibbs Sampling , 2019, ArXiv.

[41]  Andrzej Cichocki,et al.  Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions , 2016, Found. Trends Mach. Learn..

[42]  Vladimir E. Korepin,et al.  Depth optimization of quantum search algorithms beyond Grover's algorithm , 2020 .

[43]  Barbara M. Terhal,et al.  The complexity of quantum spin systems on a two-dimensional square lattice , 2008, Quantum Inf. Comput..

[44]  J. Biamonte,et al.  Hamiltonian gadgets with reduced resource requirements , 2013, 1311.2555.

[45]  Yves Lafont,et al.  Towards an algebraic theory of Boolean circuits , 2003 .

[46]  R. Byer,et al.  Network of time-multiplexed optical parametric oscillators as a coherent Ising machine , 2014, Nature Photonics.

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

[48]  Julia Kempe,et al.  3-local Hamiltonian is QMA-complete , 2003, Quantum Inf. Comput..

[49]  J. Whitfield,et al.  Simulation of electronic structure Hamiltonians using quantum computers , 2010, 1001.3855.

[50]  Bob Coecke,et al.  Interacting Quantum Observables , 2008, ICALP.

[51]  Antonio J. Martinez,et al.  Tunable three-body coupler for superconducting flux qubits , 2019 .

[52]  M. W. Johnson,et al.  Sign- and magnitude-tunable coupler for superconducting flux qubits , 2006, cond-mat/0608253.

[53]  C. Gogolin,et al.  Evaluating analytic gradients on quantum hardware , 2018, Physical Review A.

[54]  D. DiVincenzo,et al.  Schrieffer-Wolff transformation for quantum many-body systems , 2011, 1105.0675.

[55]  Andrew Lucas,et al.  Ising formulations of many NP problems , 2013, Front. Physics.

[56]  Simon Benjamin,et al.  Error-Mitigated Digital Quantum Simulation. , 2018, Physical review letters.

[57]  Andrew J. Landahl,et al.  Universal quantum walks and adiabatic algorithms by 1D Hamiltonians , 2008, 0802.1207.

[58]  M. Troyer,et al.  Nonstoquastic Hamiltonians and quantum annealing of an Ising spin glass , 2016, 1609.06558.

[59]  H. Nishimori,et al.  Quantum annealing in the transverse Ising model , 1998, cond-mat/9804280.

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

[61]  Cheng Peng,et al.  Tensor Network Contractions: Methods and Applications to Quantum Many-Body Systems , 2020 .

[62]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[63]  M. Schöndorf,et al.  Nonpairwise Interactions Induced by Virtual Transitions in Four Coupled Artificial Atoms , 2019 .

[64]  Christopher T. Chubb,et al.  Hand-waving and interpretive dance: an introductory course on tensor networks , 2016, 1603.03039.

[65]  Simon C. Benjamin,et al.  Variational Circuit Compiler for Quantum Error Correction , 2019, Physical Review Applied.

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

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

[68]  Angeline Arenda Barrocluff.  The Family , 2019, What is the Family of Law?.

[69]  Terry Rudolph,et al.  A 2 rebit gate universal for quantum computing , 2002 .

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

[71]  David Gosset,et al.  Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates. , 2016, Physical review letters.

[72]  M. W. Johnson,et al.  Experimental demonstration of a robust and scalable flux qubit , 2009, 0909.4321.

[73]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[74]  F. Verstraete,et al.  Renormalization and tensor product states in spin chains and lattices , 2009, 0910.1130.

[75]  Alán Aspuru-Guzik,et al.  The theory of variational hybrid quantum-classical algorithms , 2015, 1509.04279.

[76]  Ying Li,et al.  Efficient Variational Quantum Simulator Incorporating Active Error Minimization , 2016, 1611.09301.

[77]  Yaoyun Shi.  Both Toffoli and controlled-NOT need little help to do universal quantum computing , 2003, Quantum Inf. Comput..

[78]  New construction for a QMA complete three-local Hamiltonian , 2007, quant-ph/0612113.

[79]  David P. DiVincenzo,et al.  The complexity of stoquastic local Hamiltonian problems , 2006, Quantum Inf. Comput..

[80]  Fabián A. Chudak,et al.  Experimental determination of Ramsey numbers. , 2012, Physical Review Letters.

[81]  Alán Aspuru-Guzik,et al.  A variational eigenvalue solver on a photonic quantum processor , 2013, Nature Communications.

[82]  Jacob Biamonte,et al.  Lectures on Quantum Tensor Networks , 2019, 1912.10049.

[83]  J. Biamonte,et al.  Realizable Hamiltonians for Universal Adiabatic Quantum Computers , 2007, 0704.1287.

[84]  Stefan Zohren,et al.  Circuit design for multi-body interactions in superconducting quantum annealing systems with applications to a scalable architecture , 2016, 1603.09521.

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

[86]  James D. Whitfield,et al.  Quantum Transport Enhancement by Time-Reversal Symmetry Breaking , 2012, Scientific Reports.

[87]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[88]  G. Vidal,et al.  Universal quantum circuit for two-qubit transformations with three controlled-NOT gates , 2003, quant-ph/0307177.

[89]  Ashley Montanaro,et al.  Complexity Classification of Local Hamiltonian Problems , 2016, SIAM J. Comput..

[90]  Jacob Biamonte,et al.  Pushing Tensor Networks to the Limit , 2019, Physics.

[91]  Simon C Benjamin,et al.  Quantum computing with an always-on Heisenberg interaction. , 2002, Physical review letters.

[92]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[93]  V. Akshay,et al.  Reachability Deficits in Quantum Approximate Optimization , 2019, Physical review letters.

[94]  W. Wootters,et al.  A single quantum cannot be cloned , 1982, Nature.

[95]  Mark W. Johnson,et al.  Observation of topological phenomena in a programmable lattice of 1,800 qubits , 2018, Nature.

[96]  Bart Selman,et al.  Critical Behavior in the Computational Cost of Satisfiability Testing , 1996, Artif. Intell..

[97]  J. D. Biamonte,et al.  Algebraically contractible topological tensor network states , 2011, 1108.0888.

[98]  D. DiVincenzo,et al.  Quantum simulation of many-body Hamiltonians using perturbation theory with bounded-strength interactions. , 2008, Physical review letters.

[99]  Guifre Vidal,et al.  Entanglement Renormalization: An Introduction , 2009, 0912.1651.

[100]  Ashley Montanaro,et al.  Complexity Classification of Local Hamiltonian Problems , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[101]  Gabriel Samach,et al.  A many-body coupler for coherent 4-local interaction of superconducting flux qubits , 2019 .

[102]  Alexey Uvarov,et al.  Variational Quantum Eigensolver for Frustrated Quantum Systems , 2020, ArXiv.

[103]  Patrick J. Coles,et al.  Learning the quantum algorithm for state overlap , 2018, New Journal of Physics.

[104]  Nir Davidson,et al.  Observing geometric frustration with thousands of coupled lasers. , 2013, Physical review letters.

[105]  M. W. Johnson,et al.  Phase transitions in a programmable quantum spin glass simulator , 2018, Science.

[106]  Daniel A. Lidar,et al.  Experimental signature of programmable quantum annealing , 2012, Nature Communications.

[107]  Pavlos G. Lagoudakis,et al.  Realizing the classical XY Hamiltonian in polariton simulators. , 2016, Nature materials.

[108]  A. A. Zhukov,et al.  Algorithmic simulation of far-from-equilibrium dynamics using quantum computer , 2018, Quantum Information Processing.

[109]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[110]  J. Biamonte,et al.  Tensor Networks in a Nutshell , 2017, 1708.00006.

[111]  Natalia G. Berloff,et al.  Global optimization of spin Hamiltonians with gain-dissipative systems , 2018, Scientific Reports.

[112]  Akira Sone,et al.  Cost-Function-Dependent Barren Plateaus in Shallow Quantum Neural Networks , 2020, ArXiv.

[113]  E. Friedgut,et al.  Sharp thresholds of graph properties, and the -sat problem , 1999 .

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

[115]  Jason Morton,et al.  Tensor Network Contractions for #SAT , 2014, Journal of Statistical Physics.

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

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

[118]  Michael Broughton,et al.  A quantum algorithm to train neural networks using low-depth circuits , 2017, 1712.05304.

[119]  H. Nishimori,et al.  Mathematical foundation of quantum annealing , 2008, 0806.1859.

[120]  John Preskill,et al.  Quantum Computing in the NISQ era and beyond , 2018, Quantum.

[121]  Daniel A. Lidar,et al.  Adiabatic quantum algorithm for search engine ranking. , 2011, Physical review letters.

[122]  Sabre Kais,et al.  Degree distribution in quantum walks on complex networks , 2013, 1305.6078.

[123]  Ryan Babbush,et al.  Barren plateaus in quantum neural network training landscapes , 2018, Nature Communications.

[124]  E. Farhi,et al.  The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size. , 2019, 1910.08187.

[125]  Masashi Sugiyama,et al.  Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives , 2017, Found. Trends Mach. Learn..

[126]  Ryan Babbush,et al.  Decoding quantum errors with subspace expansions , 2019, Nature Communications.

[127]  武居 弘樹,et al.  実機の制約を考慮したCoherent Ising Machineの性能解析 , 2018 .

[128]  R. Feynman.  There's plenty of room at the bottom , 1999 .

[129]  Manlio De Domenico,et al.  Complex networks from classical to quantum , 2017, Communications Physics.

[130]  Jacob Biamonte,et al.  Variational learning of Grover's quantum search algorithm , 2018, Physical Review A.

[131]  Keisuke Fujii,et al.  Quantum circuit learning , 2018, Physical Review A.

[132]  Ville Bergholm,et al.  Categorical quantum circuits , 2010, 1010.4840.

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

[134]  J. Biamonte,et al.  Quantum Techniques in Stochastic Mechanics , 2012, 1209.3632.

[135]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[136]  Marco Lanzagorta,et al.  Tensor network methods for invariant theory , 2012, 1209.0631.

[137]  Jacob Biamonte,et al.  On the universality of the quantum approximate optimization algorithm , 2019, Quantum Information Processing.

[138]  Jacob Biamonte,et al.  Charged string tensor networks , 2017, Proceedings of the National Academy of Sciences.

[139]  F. Verstraete,et al.  Computational complexity of interacting electrons and fundamental limitations of density functional theory , 2007, 0712.0483.

[140]  Roman Orus,et al.  A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States , 2013, 1306.2164.

[141]  Andrew J. Kerman,et al.  Automated discovery of superconducting circuits and its application to 4-local coupler design , 2019 .

[142]  B. Lanyon,et al.  Towards quantum chemistry on a quantum computer. , 2009, Nature chemistry.

[143]  S. Lloyd.  Quantum approximate optimization is computationally universal , 2018, 1812.11075.