arXiv (All)
open access
Probing the classical complexity of quantum dynamics experiments
A confluence of recent works has shown that many quantum circuits and dynamics are efficiently simulable by classical algorithms that track local information, even when conventional complexity measures such as the entanglement and magic are high. Here, we introduce a novel measure of complexity, the
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
- Exact Operator Complexity Measures from Random Matchgate Unitaries#1142901
- Algorithms and computational complexity in quantum simulation and quantum machine learning / Bernhard Jobst ; Gutachter: Frank Pollmann, Peter Rabl ; Betreuer: Frank Pollmann#1145471
- The cost of simulating classically tractable quantum circuits and dynamics#999528
- Reverse N-Wise Output-Oriented Testing for AI/ML and Quantum Computing Systems#793575
- Reverse N-Wise Output-Oriented Testing for AI/ML and Quantum Computing Systems#789571
Record · ID 1115786
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