arXiv (All)
open access
Exact Quantum Circuit Optimization is co-NQP-hard
As quantum computing resources remain scarce and error rates high, minimizing the resource consumption of quantum circuits is essential for achieving practical quantum advantage. Here we consider the natural problem of, given a circuit $C$, computing a circuit $C'$ that behaves equivalently on a des
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
- Branch-Aware Quantum Constant Propagation for Dynamic Quantum Circuits#1123108
- Factorized Boolean representations for efficient quantum synthesis#819473
- Factorized Boolean representations for efficient quantum synthesis#809477
- Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization#1156210
- DreamQAS: Learning a Decision-Useful World Model for VQE-Efficient Quantum Architecture Search#422252
Record · ID 1076009
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