arXiv (All)
open access
Parallel classical simulation of noisy shallow circuits: no quantum advantage in 1D
We consider quantum circuits consisting of $d$ layers of nearest-neighbor two-qubit gates acting on $n$ qubits arranged on a line, where every qubit is independently depolarized with a constant probability before each layer. We describe a randomized parallel algorithm which samples from the output d
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Polynomial-time additive-error estimation of output probabilities for shallow quantum circuits#1157494
- A polynomial-time classical sampler for noisy quantum circuits from statistical mechanics#1155483
- A Single Fixed Shallow Circuit for Classical Shadows of Arbitrary n-Qubit States#975099
- Disambiguating Pauli noise in quantum computers#972920
- Quantum MeanFlow: single-shot generative sampling on NISQ hardware#822580
Record · ID 1144415
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive