暂无分享,去创建一个
[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[2] H. Nishimori,et al. Quantum annealing in the transverse Ising model , 1998, cond-mat/9804280.
[3] A. Cavagna,et al. Spin-glass theory for pedestrians , 2005, cond-mat/0505032.
[4] Rupak Biswas,et al. From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz , 2017, Algorithms.
[5] Mikhail N. Vyalyi,et al. Classical and Quantum Computation , 2002, Graduate studies in mathematics.
[6] Gerhard J. Woeginger,et al. On the Equal-Subset-Sum Problem , 1992, Inf. Process. Lett..
[7] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[8] Joseph Dulny,et al. Quantum annealing for combinatorial clustering , 2017, Quantum Inf. Process..
[9] Roger Melko,et al. Quantum Boltzmann Machine , 2016, 1601.02036.
[10] Barbara M. Terhal,et al. Complexity of Stoquastic Frustration-Free Hamiltonians , 2008, SIAM J. Comput..
[11] E. Farhi,et al. A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.
[12] David P. DiVincenzo,et al. The complexity of stoquastic local Hamiltonian problems , 2006, Quantum Inf. Comput..
[13] Julia Kempe,et al. The Complexity of the Local Hamiltonian Problem , 2004, FSTTCS.
[14] Daniel A. Lidar,et al. Quantum annealing versus classical machine learning applied to a simplified computational biology problem , 2018, npj Quantum Information.
[15] Itay Hen,et al. Quantum Annealing for Constrained Optimization , 2015, 1508.04212.
[16] Aidan Roy,et al. Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis , 2016, Front. ICT.
[17] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[18] Davide Venturelli,et al. Reverse quantum annealing approach to portfolio optimization problems , 2018, Quantum Machine Intelligence.
[19] Mark W. Johnson,et al. Observation of topological phenomena in a programmable lattice of 1,800 qubits , 2018, Nature.
[20] Rupak Biswas,et al. Quantum Approximate Optimization with Hard and Soft Constraints , 2017 .
[21] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.
[22] E. Farhi,et al. A Quantum Approximate Optimization Algorithm , 2014, 1411.4028.
[23] Albert R. Meyer,et al. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.
[24] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[25] M. Sipser,et al. Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.
[26] Julia Kempe,et al. 3-local Hamiltonian is QMA-complete , 2003, Quantum Inf. Comput..
[27] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..
[28] Steven H. Adachi,et al. Application of Quantum Annealing to Training of Deep Neural Networks , 2015, ArXiv.
[29] Helmut G. Katzgraber,et al. Perspectives of quantum annealing: methods and implementations , 2019, Reports on progress in physics. Physical Society.
[30] D. McMahon. Adiabatic Quantum Computation , 2008 .
[31] Daniel A. Lidar,et al. Solving a Higgs optimization problem with quantum annealing for machine learning , 2017, Nature.
[32] Itay Hen,et al. Driver Hamiltonians for constrained optimization in quantum annealing , 2016, 1602.07942.
[33] S. Kirkpatrick,et al. Solvable Model of a Spin-Glass , 1975 .
[34] Ievgeniia Oshurko. Quantum Machine Learning , 2020, Quantum Computing.
[35] S. Brush. History of the Lenz-Ising Model , 1967 .
[36] Andrew Lucas,et al. Ising formulations of many NP problems , 2013, Front. Physics.
[37] E. Tosatti,et al. Optimization using quantum mechanics: quantum annealing through adiabatic evolution , 2006 .
[38] Matthias Troyer,et al. Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations , 2004, Physical review letters.
[39] Milad Marvian,et al. On the computational complexity of curing non-stoquastic Hamiltonians , 2019, Nature Communications.