Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits-Reference-Cited by-同舟云学术

Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits

Published:2019-06-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Watts Adam Bene¹,Kothari Robin²,Schaeffer Luke¹,Tal Avishay³

Affiliation:

1. Massachusetts Institute of Technology, USA

2. Microsoft Research, USA

3. Stanford University, USA

Funder

NSF

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3313276.3316404

Reference40 articles.

1. Miklos Ajtai. 1983. Miklos Ajtai. 1983.

2. Σ 1 1 -formulae on finite structures. Annals of Pure and Applied Logic 24 (1983) 1–48. 0072(83)90038- 6 Σ 1 1 -formulae on finite structures. Annals of Pure and Applied Logic 24 (1983) 1–48. 0072(83)90038- 6

3. Small depth quantum circuits

4. Juan Bermejo-Vega Dominik Hangleiter Martin Schwarz Robert Raussendorf and Jens Eisert. 2018. Architectures for Quantum Simulation Showing a Quantum Speedup. Physical Review X 8 (Apr 2018) 021010. Issue 2. 1103/PhysRevX.8.021010 Juan Bermejo-Vega Dominik Hangleiter Martin Schwarz Robert Raussendorf and Jens Eisert. 2018. Architectures for Quantum Simulation Showing a Quantum Speedup. Physical Review X 8 (Apr 2018) 021010. Issue 2. 1103/PhysRevX.8.021010

5. Gilles Brassard Anne Broadbent and Alain Tapp. 2005. Recasting Mermin’s Multiplayer Game into the Framework of Pseudo-telepathy. Quantum Information & Computation 5 7 (Nov. 2005) 538–550. http://dl.acm.org/citation.cfm?id= 2011656.2011658 Gilles Brassard Anne Broadbent and Alain Tapp. 2005. Recasting Mermin’s Multiplayer Game into the Framework of Pseudo-telepathy. Quantum Information & Computation 5 7 (Nov. 2005) 538–550. http://dl.acm.org/citation.cfm?id= 2011656.2011658

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantum-classical separations in shallow-circuit-based learning with and without noises;Communications Physics;2024-08-29

2. Tight quantum depth lower bound for solving systems of linear equations;Physical Review A;2024-07-08

3. Learning Shallow Quantum Circuits;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. Quantum advantage in temporally flat measurement-based quantum computation;Quantum;2024-04-09

5. Fast simulation of planar Clifford circuits;Quantum;2024-02-12