arXiv (All)
open access
Factorized Boolean representations for efficient quantum synthesis
Quantum algorithms promise advantages beyond classical reach, but running them on error-corrected hardware requires translating Boolean specifications into reversible circuits, and the resources that translation demands determine what is executable. Established methods minimize a Boolean expression
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
- Factorized Boolean representations for efficient quantum synthesis#809477
- Oracle Synthesis Based on X-Map Decision Diagrams#1034831
- Demonstration of efficient predictive surrogates for large-scale quantum processors.#239670
- Irene: Equivalence Checking of Hybrid Quantum Programs via Structure-Preserving Symbolic Reduction#1130907
- Irene: Equivalence Checking of Hybrid Quantum Programs via Structure-Preserving Symbolic Reduction#1122387
Record · ID 819473
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