Document Open Access Logo

Average-Case Quantum Advantage with Shallow Circuits

Author François Le Gall

PDF
Thumbnail PDF

File

LIPIcs.CCC.2019.21.pdf
  • Filesize: 0.61 MB
  • 20 pages

Document Identifiers

Author Details

François Le Gall
  • Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan

Acknowledgements

The author is very grateful to Keisuke Fujii, Tomoyuki Morimae, Harumichi Nishimura, Ansis Rosmanis and Yasuhiro Takahashi for helpful discussions. The author also thanks Jalex Stark and Thomas Vidick for comments about the manuscript. This work was partially supported by the JSPS KAKENHI grants No. 15H01677, No. 16H01705 and No. 16H05853.

Cite AsGet BibTex

François Le Gall. Average-Case Quantum Advantage with Shallow Circuits. In 34th Computational Complexity Conference (CCC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 137, pp. 21:1-21:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.CCC.2019.21

Abstract

Recently Bravyi, Gosset and König (Science 2018) proved an unconditional separation between the computational powers of small-depth quantum and classical circuits for a relation. In this paper we show a similar separation in the average-case setting that gives stronger evidence of the superiority of small-depth quantum computation: we construct a computational task that can be solved on all inputs by a quantum circuit of constant depth with bounded-fanin gates (a "shallow" quantum circuit) and show that any classical circuit with bounded-fanin gates solving this problem on a non-negligible fraction of the inputs must have logarithmic depth. Our results are obtained by introducing a technique to create quantum states exhibiting global quantum correlations from any graph, via a construction that we call the extended graph. Similar results have been very recently (and independently) obtained by Coudron, Stark and Vidick (arXiv:1810.04233}), and Bene Watts, Kothari, Schaeffer and Tal (STOC 2019).

Subject Classification

ACM Subject Classification
  • Theory of computation → Quantum computation theory
Keywords
  • Quantum computing
  • circuit complexity
  • constant-depth circuits

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Scott Aaronson and Alex Arkhipov. The computational complexity of linear optics. In Proceedings of the 43rd ACM Symposium on Theory of Computing, pages 333-342, 2011. URL: https://doi.org/10.1145/1993636.1993682.
  2. Scott Aaronson and Alex Arkhipov. BosonSampling is far from uniform. Quantum Information & Computation, 14(15-16):1383-1423, 2014. URL: http://www.rintonpress.com/xxqic14/qic-14-1516/1383-1423.pdf.
  3. Scott Aaronson and Lijie Chen. Complexity-Theoretic Foundations of Quantum Supremacy Experiments. In Proceedings of the 32nd Computational Complexity Conference, pages 22:1-22:67, 2017. URL: https://doi.org/10.4230/LIPIcs.CCC.2017.22.
  4. Andris Ambainis. Understanding quantum algorithms via query complexity. In Proceedings of the 2018 International Congress of Mathematicians, volume 3, pages 3249-3270, 2018. Google Scholar
  5. Jonathan Barrett, Carlton M. Caves, Bryan Eastin, Matthew B. Elliott, and Stefano Pironio. Modeling Pauli measurements on graph states with nearest-neighbor classical communication. Physical Review A, 75:012103, 2007. URL: https://doi.org/10.1103/PhysRevA.75.012103.
  6. Adam Bene Watts, Robin Kothari, Luke Schaeffer, and Avishay Tal. Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. In Proceedings of the 43rd ACM Symposium on Theory of Computing, 2019. To appear. Google Scholar
  7. Ethan Bernstein and Umesh V. Vazirani. Quantum Complexity Theory. SIAM Journal on Computing, 26(5):1411-1473, 1997. URL: https://doi.org/10.1137/S0097539796300921.
  8. Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani. "Quantum Supremacy" and the Complexity of Random Circuit Sampling. In Proceedings of the 10th Innovations in Theoretical Computer Science conference, pages 15:1-15:2, 2019. arXiv:1803.04402. URL: https://doi.org/10.4230/LIPIcs.ITCS.2019.15.
  9. Sergey Bravyi, David Gosset, and Robert König. Quantum advantage with shallow circuits. arXiv:1704.00690 (preliminary version of [Sergey Bravyi et al., 2018]), 2017. URL: http://arxiv.org/abs/1704.00690.
  10. Sergey Bravyi, David Gosset, and Robert König. Quantum advantage with shallow circuits. Science, 362(6412):308-311, 2018. URL: https://doi.org/10.1126/science.aar3106.
  11. Michael J. Bremner, Richard Jozsa, and Dan J. Shepherd. Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy. Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, 467(2126):459-472, 2010. URL: https://doi.org/10.1098/rspa.2010.0301.
  12. Michael J. Bremner, Ashley Montanaro, and Dan J. Shepherd. Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations. Physical Review Letters, 117:080501, 2016. URL: https://doi.org/10.1103/PhysRevLett.117.080501.
  13. Michael J. Bremner, Ashley Montanaro, and Dan J. Shepherd. Achieving quantum supremacy with sparse and noisy commuting quantum circuits. Quantum, 1:8, 2017. URL: https://doi.org/10.22331/q-2017-04-25-8.
  14. Matthew Coudron, Jalex Stark, and Thomas Vidick. Trading locality for time: certifiable randomness from low-depth circuits, 2018. URL: http://arxiv.org/abs/1810.04233.
  15. Edward Farhi and Aram W. Harrow. Quantum supremacy through the quantum approximate optimization algorithm, 2016. URL: http://arxiv.org/abs/1602.07674.
  16. Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, and Seiichiro Tani. Impossibility of Classically Simulating One-Clean-Qubit Model with Multiplicative Error. Physical Review Letters, 120:200502, 2018. URL: https://doi.org/10.1103/PhysRevLett.120.200502.
  17. Keisuke Fujii and Shuhei Tamate. Computational quantum-classical boundary of noisy commuting quantum circuits. Scientific Reports, 6(25598), 2016. URL: https://doi.org/10.1038/srep25598.
  18. Frederic Green, Steven Homer, Cristopher Moore, and Christopher Pollett. Counting, fanout and the complexity of quantum ACC. Quantum Information & Computation, 2(1):35-65, 2002. URL: http://portal.acm.org/citation.cfm?id=2011420.
  19. Marc Hein, Jens Eisert, and Hans J. Briegel. Multiparty entanglement in graph states. Physical Review A, 69:062311, 2004. URL: https://doi.org/10.1103/PhysRevA.69.062311.
  20. Peter Høyer and Robert Spalek. Quantum Fan-out is Powerful. Theory of Computing, 1(1):81-103, 2005. URL: https://doi.org/10.4086/toc.2005.v001a005.
  21. Attila Kondacs and John Watrous. On the Power of Quantum Finite State Automata. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 66-75, 1997. URL: https://doi.org/10.1109/SFCS.1997.646094.
  22. François Le Gall, Harumichi Nishimura, and Ansis Rosmanis. Quantum Advantage for the LOCAL Model in Distributed Computing. In Proceedings of the International Symposium on Theoretical Aspects of Computer Science, pages 49:1-49:14, 2019. URL: https://doi.org/10.4230/LIPIcs.STACS.2019.49.
  23. Tomoyuki Morimae, Keisuke Fujii, and Joseph F. Fitzsimons. Hardness of Classically Simulating the One-Clean-Qubit Model. Physical Review Letters, 112:130502, 2014. URL: https://doi.org/10.1103/PhysRevLett.112.130502.
  24. Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000. URL: https://doi.org/10.1017/CBO9780511976667.
  25. Ran Raz and Avishay Tal. Oracle Separation of BQP and PH. Proceedings of the 43rd ACM Symposium on Theory of Computing, 2019. To appear. Google Scholar
  26. Yasuhiro Takahashi and Seiichiro Tani. Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits. Computational Complexity, 25(4):849-881, 2016. URL: https://doi.org/10.1007/s00037-016-0140-0.
  27. Barbara M. Terhal and David P. DiVincenzo. Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games. Quantum Information & Computation, 4(2):134-145, 2004. URL: http://portal.acm.org/citation.cfm?id=2011582.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact