A polynomial-time classical algorithm for noisy random circuit sampling

DOI10.1145/3564246.3585234WikidataQ130921280 ScholiaQ130921280MaRDI QIDQ6499276FDOQ6499276

Authors: Dorit Aharonov, Xun Gao, Zeph A. Landau, Yunchao Liu, Umesh V. Vazirani 

Publication date: 8 May 2024

zbMATH Keywords

quantum supremacyrandom circuit sampling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Quantum Complexity Theory
• The computational complexity of linear optics
• Random quantum circuits are approximate 2-designs
• Entanglement and correlation functions of the quantum Motzkin spin-chain
• Upper bounds on the noise threshold for fault-tolerant quantum computing
• Complexity-theoretic foundations of quantum supremacy experiments
• On the classical hardness of spoofing linear cross-entropy benchmarking
• Quantum Supremacy and the Complexity of Random Circuit Sampling

This page was built for publication: A polynomial-time classical algorithm for noisy random circuit sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499276)