Representation-Dependent Recoverability in Quantum Compilation

arXiv:2609.29210 · quant-ph · Submitted 2026-09-24 · Read on arXiv

quant-ph

Submitted: 2026-09-24

Updated: 2026-09-24

Terminology

• Aggregation — 24× in this paper · explained in 1 episode
• Benchmark — 16× in this paper · explained in 2 episodes
• Ablation — 15× in this paper · explained in 1 episode
• Provenance — 13× in this paper · explained in 4 episodes
• Accuracy — 12× in this paper · explained in 1 episode
• Verifier — 10× in this paper · explained in 2 episodes
• Quantum Circuits — 7× in this paper · explained in 2 episodes
• Trace — 7× in this paper · explained in 2 episodes
• Robustness — 6× in this paper · explained in 5 episodes
• Decode — 4× in this paper · explained in 2 episodes
• Quantum Physics — 4× in this paper · explained in 11 episodes
• Calibration — 3× in this paper · explained in 7 episodes
• Distillation — 3× in this paper · explained in 2 episodes
• Benchmarking — 2× in this paper · explained in 4 episodes
• Degeneracy — 2× in this paper · explained in 3 episodes
• Abstraction — 1× in this paper · explained in 1 episode
• Additive Decomposition — 1× in this paper · explained in 1 episode
• Alignment — 1× in this paper · explained in 1 episode
• Allocator — 1× in this paper · explained in 1 episode
• Analyzer — 1× in this paper · explained in 1 episode
• Consistency — 1× in this paper · explained in 3 episodes
• Generative AI — 1× in this paper · explained in 2 episodes
• Modular Architecture — 1× in this paper · explained in 4 episodes
• Modularity — 1× in this paper · explained in 9 episodes
• Verification — 1× in this paper · explained in 2 episodes

Sources

• A Quantum Approximate Optimization Algorithm
• Optimal ancilla-free Clifford+T approximation of z-rotations
• Noise tailoring for scalable quantum computation via randomized compiling
• Magic State Distillation: Not as Costly as You Think
• Phase Gadget Synthesis for Shallow Circuits
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• Reducing T-count with the ZX-calculus
• ZX-calculus for the working quantum computer scientist
• Architecture aware compilation of quantum circuits via lazy synthesis
• A High Performance Compiler for Very Large Scale Surface Code Computations
• Assessing requirements to scale to practical quantum advantage
• Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor
• Quantum computing with Qiskit
• staq -- A full-stack quantum processing toolkit
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
• ProjectQ: An Open Source Software Framework for Quantum Computing
• Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
• Quantum Circuit Compiler for a Shuttling-Based Trapped-Ion Quantum Computer

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