Additive-error fine-grained quantum supremacy
It is known that several sub-universal quantum computing models, such as the IQP model, the Boson sampling model, the one-clean qubit model, and the random circuit model, cannot be classically simulated in polynomial time under certain conjectures in classical complexity theory. Recently, these resu...
Main Authors: | Tomoyuki Morimae, Suguru Tamaki |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2020-09-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2020-09-24-329/pdf/ |
Similar Items
-
Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy
by: Tomoyuki Morimae, et al.
Published: (2018-11-01) -
Quantum Computational Supremacy
by: Harrow, Aram W., et al.
Published: (2020) -
The Quantum Supremacy Tsirelson Inequality
by: William Kretschmer
Published: (2021-10-01) -
Quantum sampling problems, BosonSampling and quantum supremacy
by: A. P. Lund, et al.
Published: (2017-04-01) -
Achieving quantum supremacy with sparse and noisy commuting quantum computations
by: Michael J. Bremner, et al.
Published: (2017-04-01)