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: | , |
---|---|
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/ |