Computational Complexity of Clifford Template Compilation: Are Quantum Computers Useful for Compiling Quantum Circuits?

arXiv:2609.35239 · quant-ph, cs.CC · Submitted 2026-09-28 · Read on arXiv

quant-ph, cs.CC

Submitted: 2026-09-28

Updated: 2026-09-28

Terminology

• BQP — 13× in this paper · explained in 2 episodes
• Clifford Template Compilation — 9× in this paper
• Quantum Circuits — 3× in this paper · explained in 2 episodes
• Benchmark — 2× in this paper · explained in 2 episodes
• Embeddings — 2× in this paper · explained in 2 episodes
• Inverse Problem — 2× in this paper · explained in 2 episodes
• Verification — 1× in this paper · explained in 2 episodes

Sources

• Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates
• Quantum Arithmetic on Galois Fields
• Fold-Transversal Clifford Gates for Quantum Codes
• Synthesizing efficient circuits for Hamiltonian simulation
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity