Characterizing quantum supremacy in near-term devices - Nature Physics
- ️Neven, Hartmut
- ️Mon Apr 23 2018
References
Emerson, J., Weinstein, Y. S., Saraceno, M., Lloyd, S. & Cory, D. G. Pseudo-random unitary operators for quantum information processing. Science 302, 2098–2100 (2003).
Scott, A. J., Brun, T. A., Caves, C. M. & Schack, R. Hypersensitivity and chaos signatures in the quantum baker's maps. J. Phys. A 39, 13405–13433 (2006).
Oliveira, R., Dahlsten, O. & Plenio, M. Generic entanglement can be generated efficiently. Phys. Rev. Lett. 98, 130502 (2007).
Arnaud, L. & Braun, D. Efficiency of producing random unitary matrices with quantum circuits. Phys. Rev. A 78, 062329 (2008).
Trail, C. M., Madhok, V. & Deutsch, I. H. Entanglement and the generation of random states in the quantum chaotic dynamics of kicked coupled tops. Phys. Rev. E 78, 046211 (2008).
Harrow, A. W. & Low, R. A. Random quantum circuits are approximate 2-designs. Comm. Math. Phys. 291, 257–302 (2009).
Weinstein, Y. S., Brown, W. G. & Viola, L. Parameters of pseudo-random quantum circuits. Phys. Rev. A 78, 052332 (2008).
Brown, W. & Fawzi, O. Scrambling speed of random quantum circuits. Preprint at https://arxiv.org/abs/1210.6644 (2012).
Kim, H. & Huse, D. A. Ballistic spreading of entanglement in a diffusive nonintegrable system. Phys. Rev. Lett. 111, 127205 (2013).
Hosur, P., Qi, X.-L., Roberts, D. A. & Yoshida, B. Chaos in quantum channels. J. High. Energy Phys. 2016, 4 (2016).
Nahum, A., Ruhman, J., Vijay, S. & Haah, J. Quantum entanglement growth under random unitary dynamics. Phys. Rev. X 7, 031016 (2017).
Aaronson, S. Quantum computing, postselection, and probabilistic polynomial-time. Proc. R. Soc. A 461, 3473–3482 (2005).
Bremner, M. J., Jozsa, R. & Shepherd, D. J. Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy. Proc. R. Soc. A 467, 459–472 (2011).
Aaronson, S. & Arkhipov, A. The computational complexity of linear optics. In STOC '11 Proc. Forty-Third Annual ACM Symp. Theory of Computing 333–342 (ACM, New York, NY, 2011).
Fujii, K. & Morimae, T. Commuting quantum circuits and complexity of Ising partition functions. New J. Phys. 19, 033003 (2017).
Goldberg, L. A. & Guo, H. The complexity of approximating complex-valued Ising and Tutte partition functions. Comput. Complex. 26, 765–833 (2017).
Bremner, M. J., Montanaro, A. & Shepherd, D. J. Average-case complexity versus approximate simulation of commuting quantum computations. Phys. Rev. Lett. 117, 080501 (2016).
Preskill, J. Quantum computing and the entanglement frontier. Preprint at https://arxiv.org/abs/1203.5813 (2012).
Barends, R. et al. Superconducting quantum circuits at the surface code threshold for fault tolerance. Nature 508, 500–503 (2014).
Kelly, J. et al. State preservation by repetitive error detection in a superconducting quantum circuit. Nature 519, 66–69 (2015).
Peres, A. Stability of quantum motion in chaotic and regular systems. Phys. Rev. A 30, 1610 (1984).
Schack, R. & Caves, C. M. Hypersensitivity to perturbations in the quantum baker's map. Phys. Rev. Lett. 71, 525 (1993).
Gorin, T., Prosen, T., Seligman, T. H. & Žnidarič, M. Dynamics of Loschmidt echoes and fidelity decay. Phys. Rep. 435, 33–156 (2006).
Beenakker, C. W. Random-matrix theory of quantum transport. Rev. Mod. Phys. 69, 731 (1997).
Mehta, M. L. Random Matrices Vol. 142 (Academic, San Diego, CA, 2004).
Porter, C. & Thomas, R. Fluctuations of nuclear reaction widths. Phys. Rev. 104, 483 (1956).
Haake, F. Signatures of Quantum Chaos (Springer, Berlin, 1991).
Boixo, S., Smelyanskiy, V. N. & Neven, H. Fourier analysis of sampling from noisy chaotic quantum circuits. Preprint at https://arxiv.org/abs/1708.01875 (2017).
Bremner, M. J., Montanaro, A. & Shepherd, D. J. Achieving quantum supremacy with sparse and noisy commuting quantum computations. Quantum 1, 8 (2017).
Boixo, S., Isakov, S. V., Smelyanskiy, V. N. & Neven, H. Simulation of low-depth quantum circuits as complex undirected graphical models. Preprint at https://arxiv.org/abs/1712.05384 (2017).
Markov, I. L. & Shi, Y. Simulating quantum computation by contracting tensor networks. SICOMP 38, 963–981 (2008).
Aaronson, S. & Chen, L. Complexity-theoretic foundations of quantum supremacy experiments. CCC’ 17, 22 (2017).
Pednault, E. et al. Breaking the 49-qubit barrier in the simulation of quantum circuits. Preprint at https://arxiv.org/abs/1710.05867 (2017).
Bremner, M. J., Mora, C. & Winter, A. Are random pure states useful for quantum computation? Phys. Rev. Lett. 102, 190502 (2009).
Bravyi, S. & Gosset, D. Improved classical simulation of quantum circuits dominated by Clifford gates. Phys. Rev. Lett. 116, 250501 (2016).
Emerson, J., Alicki, R. & Zyczkowski, K. Scalable noise estimation with random unitary operators. J. Opt. B 7, S347–S352 (2005).
Knill, E. et al. Randomized benchmarking of quantum gates. Phys. Rev. A 77, 012307 (2008).
Magesan, E., Gambetta, J. M. & Emerson, J. Scalable and robust randomized benchmarking of quantum processes. Phys. Rev. Lett. 106, 180504 (2011).
Fowler, A. G., Mariantoni, M., Martinis, J. M. & Cleland, A. N. Surface codes: Towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012).
Barends, R. et al. Digital quantum simulation of fermionic models with a superconducting circuit. Nat. Commun. 6, 7654 (2015).
Boixo, S. & Monras, A. Operational interpretation for global multipartite entanglement. Phys. Rev. Lett. 100, 100503–100504 (2008).
Flammia, S. T. & Liu, Y.-K. Direct fidelity estimation from few Pauli measurements. Phys. Rev. Lett. 106, 230501 (2011).
Neill, C. et al. A blueprint for demonstrating quantum supremacy with superconducting qubits. Preprint at https://arxiv.org/abs/1709.06678 (2017).