Lower bounds on the classical simulation of quantum circuits for quantum supremacy
Thesis: S.B., Massachusetts Institute of Technology, Department of Physics, 2017.
Main Author: | Dalzell, Alexander M |
---|---|
Other Authors: | Aram W. Harrow. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2017
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/111859 |
Similar Items
-
Boundaries of quantum supremacy via random circuit sampling
by: Alexander Zlokapa, et al.
Published: (2023-04-01) -
How many qubits are needed for quantum computational supremacy?
by: Dalzell, Alexander M., et al.
Published: (2020) -
How many qubits are needed for quantum computational supremacy?
by: Alexander M. Dalzell, et al.
Published: (2020-05-01) -
Quantum Computational Supremacy
by: Harrow, Aram W., et al.
Published: (2020) -
Efficient Classical Simulation of Random Shallow 2D Quantum Circuits
by: John C. Napp, et al.
Published: (2022-04-01)