Quantum approximate optimization is computationally universal
暂无分享,去创建一个
[1] S Lloyd,et al. A Potentially Realizable Quantum Computer , 1993, Science.
[2] S. Lloyd,et al. DYNAMICAL SUPPRESSION OF DECOHERENCE IN TWO-STATE QUANTUM SYSTEMS , 1998, quant-ph/9803057.
[3] E. Knill,et al. DYNAMICAL DECOUPLING OF OPEN QUANTUM SYSTEMS , 1998, quant-ph/9809071.
[4] Seth Lloyd. Programming Pulse Driven Quantum Computers , 1999 .
[5] S. C. Benjamin. Schemes for parallel quantum computation without local control of qubits , 2000 .
[6] Simon C Benjamin,et al. Quantum computing without local control of qubit-qubit interactions. , 2001, Physical review letters.
[7] R. Jozsa,et al. Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy , 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.
[8] E. Farhi,et al. A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem , 2014, 1412.6062.
[9] E. Farhi,et al. A Quantum Approximate Optimization Algorithm , 2014, 1411.4028.
[10] Hartmut Neven,et al. Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle , 2016, ArXiv.
[11] A. Harrow,et al. Quantum Supremacy through the Quantum Approximate Optimization Algorithm , 2016, 1602.07674.
[12] Eleanor G. Rieffel,et al. A QAOA-inspired circuit for Grover's unstructured search using a transverse field , 2017 .
[13] Jacob biamonte,et al. Quantum machine learning , 2016, Nature.