arXiv (All)
open access
A polynomial-time classical sampler for noisy quantum circuits from statistical mechanics
Developing classical simulation algorithms for noisy quantum circuits is essential to delineating the limits of quantum advantage. Existing classical sampling approaches for general circuits require circuit depths to grow logarithmically with system size, so that noise drives the global output state
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
- Sampling Noise and Optimized Measurement Distribution in Imaginary-Time Quantum Dynamics Simulations#1014712
- Metrological Benchmarking of Random Quantum Circuits#1144193
- Faster Quantum Monte Carlo Simulation by Random Compilation#997362
- Parallel classical simulation of noisy shallow circuits: no quantum advantage in 1D#1144415
Record · ID 1155483
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