arXiv (All)
open access
Correlations decide a shallow-circuit advantage
Quantum computers are claimed to produce samples ordinary classical computers cannot reproduce. The sharpest such claim known pits constant-depth quantum circuits, given one entangled state per run, against shallow classical circuits of few-input gates and limited randomness. No efficient test was k
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
- A polynomial-time classical sampler for noisy quantum circuits from statistical mechanics#1155483
- Disambiguating Pauli noise in quantum computers#972920
- On Relationship Between Circuit Depth and Trainability of VQAs#1064032
- Distilling Datasets into Shallow Circuits for Quantum Machine Learning#1064773
- Unconditional quantum advantage with noisy planar architectures#1145217
Record · ID 1200317
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