#CircuitSynthesis
LightNews LightNews
informaq.bsky.social
Proves optimal quantum circuit synthesis complexity depends critically on hardware connectivity: polynomial for path/complete graphs, NP-complete for trees. Provides optimal compilers achieving 2.57× gate reduction over Qiskit.

#QuantumCompilation #CircuitSynthesis #QuantumAlgorithms
Optimal Matchgate-Clifford Synthesis: Complexity Separations and Polynomial-Time Algorithms
arxiv.org
October 31, 2026 at 11:57 AM
informaq.bsky.social
Proves optimal quantum circuit synthesis complexity depends critically on hardware connectivity: polynomial for path/complete graphs, NP-complete for trees. Provides optimal compilers achieving 2.57× gate reduction over Qiskit.

#QuantumCompilation #CircuitSynthesis #QuantumAlgorithms
Optimal Matchgate-Clifford Synthesis: Complexity Separations and Polynomial-Time Algorithms
arxiv.org
October 31, 2026 at 11:57 AM
informaq.bsky.social
Supervising LLMs with algorithmic traces verified by exact quantum checkers increases circuit synthesis accuracy 4-6x, revealing the critical gap between valid code and correct quantum state preparation.

#QuantumAI #CircuitSynthesis #QuantumComputing
Verified Algorithmic Traces for LLM-Based Clifford Circuit Synthesis
arxiv.org
October 23, 2026 at 2:50 AM
informaq.bsky.social
Generative diffusion models on the SU(2) manifold enable efficient quantum circuit synthesis respecting hardware constraints. Outperforms baselines for Hamiltonian simulation targets with tunable solution styles.

#QuantumCircuits #CircuitSynthesis #Research
Lie Group Diffusion Models for Hardware-Aware Quantum Circuit Synthesis
arxiv.org
June 30, 2026 at 7:17 AM