Fundamental Physics at the Frontier of Noisy Quantum Computation

arXiv:2609.28825 · quant-ph, hep-lat, hep-ph, nucl-th · Submitted 2026-09-23 · Read on arXiv

quant-ph, hep-lat, hep-ph, nucl-th

Submitted: 2026-09-23

Updated: 2026-09-23

Comments: PhD Thesis. 413 pages, 97 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Entanglement — 174× in this paper · explained in 3 episodes
• Quantum Circuits — 38× in this paper · explained in 2 episodes
• Entanglement Entropy — 29× in this paper · explained in 2 episodes
• Hilbert Space — 21× in this paper · explained in 2 episodes
• Ancilla Qubits — 11× in this paper · explained in 1 episode
• Fidelity — 11× in this paper · explained in 2 episodes
• Accuracy — 9× in this paper · explained in 1 episode
• Matrix Product States — 9× in this paper
• Generalization — 8× in this paper · explained in 13 episodes
• Phase Transitions — 7× in this paper · explained in 2 episodes
• Adam — 6× in this paper · explained in 2 episodes
• Adiabatic Evolution — 6× in this paper · explained in 2 episodes
• Decoupling — 6× in this paper · explained in 2 episodes
• Pauli Twirling — 6× in this paper
• Stabilizer States — 6× in this paper · explained in 2 episodes
• Multipartite Entanglement — 5× in this paper · explained in 2 episodes
• Area Law — 4× in this paper · explained in 1 episode
• Calibration — 4× in this paper · explained in 7 episodes
• Combinatorial Optimization — 4× in this paper · explained in 2 episodes
• Trace — 4× in this paper · explained in 2 episodes
• Ab Initio — 3× in this paper · explained in 1 episode
• Abundance — 3× in this paper · explained in 1 episode
• Anyons — 3× in this paper · explained in 2 episodes
• BQP — 3× in this paper · explained in 2 episodes
• Benchmark — 3× in this paper · explained in 2 episodes
• Benchmarking — 3× in this paper · explained in 3 episodes
• Observable-Ranked Postselection — 3× in this paper
• Operator Decoherence Renormalization — 3× in this paper
• Robustness — 3× in this paper · explained in 5 episodes
• Robustness of Magic — 3× in this paper
• Variational Quantum Eigensolver — 3× in this paper
• All-to-All Connectivity — 2× in this paper · explained in 1 episode
• BQP-complete — 2× in this paper · explained in 2 episodes
• Core — 2× in this paper · explained in 2 episodes
• Embeddings — 2× in this paper · explained in 2 episodes
• Magnus Expansion — 2× in this paper · explained in 4 episodes
• Matrix Product States (MPS) — 2× in this paper · explained in 2 episodes
• Topological Order — 2× in this paper · explained in 2 episodes
• Verification — 2× in this paper · explained in 2 episodes
• BQP-Completeness — 1× in this paper · explained in 2 episodes
• Chaotic Dynamics — 1× in this paper · explained in 2 episodes
• Computational overhead — 1× in this paper · explained in 2 episodes
• Cooley-Tukey Fast Fourier Transform — 1× in this paper
• Distillation — 1× in this paper · explained in 2 episodes
• Domain Walls — 1× in this paper · explained in 2 episodes
• Effective Hamiltonian — 1× in this paper · explained in 2 episodes
• Hubbard Model — 1× in this paper · explained in 3 episodes
• Hybrid Approach — 1× in this paper · explained in 4 episodes
• Krylov Complexity — 1× in this paper · explained in 3 episodes
• Local Optimization — 1× in this paper · explained in 2 episodes
• Physics-Informed Constraints — 1× in this paper · explained in 2 episodes
• Redundancy — 1× in this paper · explained in 2 episodes
• Reheating — 1× in this paper · explained in 2 episodes
• Singular Value Decomposition (SVD) — 1× in this paper · explained in 2 episodes
• Spectral Gap — 1× in this paper · explained in 5 episodes
• Symmetry Breaking — 1× in this paper · explained in 3 episodes
• Total Variation Distance — 1× in this paper

Sources

• Digital quantum simulations of scattering in quantum field theories using W states
• The Quantum Complexity of String Breaking in the Schwinger Model
• Digitization of Scalar Fields for Quantum Computing
• Best Approximate Quantum Compiling Problems
• Approximating many-body quantum states with quantum circuits and measurements
• Aquila: QuEra's 256-qubit neutral-atom quantum computer
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Elucidating Reaction Mechanisms on Quantum Computers
• Quantum computational chemistry
• Quantum Simulation for High Energy Physics
• Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor
• Quantum error correction below the surface code threshold
• Logical quantum processor based on reconfigurable atom arrays
• A tweezer array with 6100 highly coherent atomic qubits
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
• Solving the sampling problem of the Sycamore quantum circuits
• Quantum Simulating Nature's Fundamental Fields
• Simulating quantum field theory with a quantum computer
• Quantum Computing in the NISQ era and beyond

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
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians