3

Quantum Compiler Design for Fault-Tolerant Quantum Computing
Scalable quantum computation is expected to rely on fault-tolerant quantum computation (FTQC), in which quantum error correction (QEC) …
PDF Cite Code DOI
Quantum Compiler Design for Fault-Tolerant Quantum Computing
Title An exchange-assisted entangling gate between 87Rb and 171Yb Rydberg atoms
Neutral-atom tweezer arrays support scalable quantum information processing. Dual-species ${}^{87}Rb–{}^{171}Yb$ arrays combine …
PDF Cite DOI
Title An exchange-assisted entangling gate between 87Rb and 171Yb Rydberg atoms
A Separation between Full-Rank PVM and Assumption-free Self-Testing
We construct a nonlocal game that self-tests a maximally entangled qubit strategy among pure full-Schmidt-rank projective strategies, …
PDF Cite DOI
A Separation between Full-Rank PVM and Assumption-free Self-Testing
Learning Quantum Matter through Attention in Complex Space
Magnetic many-electron wavefunctions require amplitude and phase to be optimized together. Whether a complex internal representation …
PDF Cite DOI
Learning Quantum Matter through Attention in Complex Space
Causal-Class Hierarchies in Coherence-Constrained Channel Transformation
Higher-order quantum transformations allow multiple channel uses to be combined through different causal architectures, from parallel …
PDF Cite Code DOI
Causal-Class Hierarchies in Coherence-Constrained Channel Transformation
Exact Virtual Channel Programming with Vanishing Excess Overhead
A finite-dimensional physical processor cannot exactly program a continuous family of distinct unitary channels. We show that this …
PDF Cite DOI
Exact Virtual Channel Programming with Vanishing Excess Overhead
Analytic Qubit Separation between POVMs and Projective Measurements
Generalized measurements can be implemented projectively after enlarging the Hilbert space, but this dilation changes the available …
PDF Cite Code DOI
Analytic Qubit Separation between POVMs and Projective Measurements
Algebraic Speedups for Exact Inversion of Hamiltonian Evolutions
Deterministic exact inversion of an arbitrary d-dimensional unitary requires $\Theta(d^2)$ coherent forward calls in the worst case. We …
PDF Cite DOI
Algebraic Speedups for Exact Inversion of Hamiltonian Evolutions
Benchmarking Agents for Proving Theorems in Quantum Algorithms and Quantum Information
Formal verification is becoming increasingly practical for quantum computing, yet the ability of AI agents to construct …
PDF Cite DOI
Benchmarking Agents for Proving Theorems in Quantum Algorithms and Quantum Information
Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256
Large language models are increasingly assisting with demanding formal theorem-proving tasks, particularly when grounded in …
PDF Cite Code DOI
Building Shor's Algorithm in Lean: An Agentic Formalization of Quantum Attacks on RSA-2048 and P-256