Achieving quantum supremacy with sparse and noisy commuting quantum computations
The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in the presence of physically motivated constraints. First, we sh...
Main Authors: | Michael J. Bremner, Ashley Montanaro, Dan J. Shepherd |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2017-04-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/q-2017-04-25-8/pdf/ |
Similar Items
-
Quantum Computational Supremacy
by: Harrow, Aram W., et al.
Published: (2020) -
Quantum sampling problems, BosonSampling and quantum supremacy
by: A. P. Lund, et al.
Published: (2017-04-01) -
The Quantum Supremacy Tsirelson Inequality
by: William Kretschmer
Published: (2021-10-01) -
How many qubits are needed for quantum computational supremacy?
by: Alexander M. Dalzell, et al.
Published: (2020-05-01) -
How many qubits are needed for quantum computational supremacy?
by: Dalzell, Alexander M., et al.
Published: (2020)