arXiv (OAI Expanded)
open access
Structure-Fair Quantum Circuit Complexity: An Auditable Information-Theoretic Lower Bound
Quantum circuit complexity is often used to characterize the physical cost of state preparation, but its physical meaning depends on the reference and counting rules; the entropy-removal costs of operations such as reset may be left out of resource accounting. We propose the principle of structural
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
- When Information Is Not Enough: Accuracy-Constrained Thermodynamic Costs of Binary Classification#1154914
- Trade-off between complexity and energy in quantum phase estimation#986171
- Completed Quantum Processes and Direct Schwarzschild State Counting#1068657
- Information in the Universe: A Synthesis of Quantum Measurement, Entropy Production, Computation, and Gravitational Information Bounds#174166
- Information as a Physical Resource: Quantum Maxwell Demon Arrays and the Thermodynamics of Measurement#108786
Record · ID 1122950
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