Corpus ID: 231924481

Interactive quantum advantage with noisy, shallow Clifford circuits

@article{Grier2021InteractiveQA,
  title={Interactive quantum advantage with noisy, shallow Clifford circuits},
  author={Daniel Grier and Nathan Ju and L. Schaeffer},
  journal={ArXiv},
  year={2021},
  volume={abs/2102.06833}
}
Recent work by Bravyi et al. constructs a relation problem that a noisy constant-depth quantum circuit (QNC) can solve with near certainty (probability 1 − o(1)), but that any bounded fan-in constant-depth classical circuit (NC) fails with some constant probability. We show that this robustness to noise can be achieved in the other low-depth quantum/classical circuit separations in this area. In particular, we show a general strategy for adding noise tolerance to the interactive protocols of… Expand

Figures from this paper

References

SHOWING 1-10 OF 21 REFERENCES
Average-case quantum advantage with shallow circuits
  • F. Gall
  • Mathematics, Computer Science
  • Computational Complexity Conference
  • 2019
Quantum Advantage with Noisy Shallow Circuits in 3D
Trading Locality for Time: Certifiable Randomness from Low-Depth Circuits
Quantum advantage with shallow circuits
Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
A theorem on probabilistic constant depth Computations
Characterizing quantum supremacy in near-term devices
...
1
2
3
...