引文
[1] Boixo, S., et. al., Characterizing quantum supremacy in near-termdevices. Nature Physics, 14(6), 595 (2018)..[2]Bremner, M. J., Jozsa, R., & Shepherd, D. J. Classical simulation ofcommuting quantum computations implies collapse of the polynomial hierarchy.Proceedings of the Royal Society A: Mathematical, Physical and EngineeringSciences, 467(2126), 459-472 (2010)..[3] Aaronson, S., & Arkhipov, A. The computational complexity of linearoptics. In Proceedings of the forty-third annual ACM symposium on Theory ofcomputing (pp. 333-342). ACM (2011, June)..[4] Bouland, A., Fefferman, B., Nirkhe, C., & Vazirani, U. On thecomplexity and verification of quantum random circuit sampling. Nature Physics,15(2), 159 (2019)..[5] Aaronson, S., & Chen, L. Complexity-theoretic foundations ofquantum supremacy experiments. arXiv preprint arXiv:1612.05903 (2016).[6] Chen, M. et. al. Quantum Teleportation-Inspired Algorithm for SamplingLarge Random Quantum Circuits, arXiv:1901.05003 (2019).[7] Wang, H. et. al. Boson sampling with 20 input photons in 60-modeinterferometers at 1014 state spaces, arXiv:1910.09930 (2019).[8] Ahmed Omran, et al, Generation and manipulation of Schrodinger catstates in Rydberg atom arrays. Science, 365(6453), 570-574 (2019).[9] Wang, X. L. et. al. 18-qubit entanglement with six photons’ threedegrees of freedom. Physical review letters, 120(26), 260502 (2018).[10]Gong, M., et. al. Genuine12-qubit entanglement on a superconducting quantum processor. Physical ReviewLetters, 122(11), 110501 (2019).[11] Yan, Z. et. al., Strongly correlated quantum walks with a 12-qubitsuperconducting processor. Science, 364(6442), 753-756 (2019).[12] Ye, Y., et. al., Propagation and localization of collectiveexcitations on a 24-qubit superconducting processor. Physical review letters,123(5), 050502 (2019).[13] Song C., et. al., Generation of multicomponent atomic Schrödinger catstates of up to 20 qubits., Science, 365(6453):574–577, (2019).