arXiv (OAI Expanded)
open access
Link-middle-cut lower bounds for Clifford circuit synthesis
Minimizing the number of CNOT gates required to synthesize a Clifford operator is a central problem in quantum circuit optimization. We extend the link--middle--cut (LMC) framework for linear reversible circuits to Clifford operators represented by binary symplectic tableaux. By introducing block-su
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
- Efficient Gaussian State Preparation in Quantum Circuits#139218
- LLM-Driven Algorithm Design for Quantum Circuit Synthesis based on Binary Decision Diagrams#972259
- Efficient Fourier-Based Linear Combination of Unitaries and Applications in Quantum Optimization#926038
- Near-optimal synthesis of non-Gaussian phase gates via qubit-oscillator Rabi control#986731
- Optimized Matrix-Product State Simulations of Quantum Error Correction Circuits#925440
Record · ID 1110585
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