Tootfinder

Hamiltonian truncation and quantum simulation of strong-field QED beyond tree level
Patrick Draper, Luis Hidalgo, Anton Ilderton
https://arxiv.org/abs/2509.15495 https://…

Hamiltonian truncation and quantum simulation of strong-field QED beyond tree level
Quantum electrodynamics in strong background fields provides an interesting class of problems for classical and quantum simulation. In this paper we formulate simulations of polarization (helicity) flip for a photon colliding with a high-intensity plane wave. Polarization flip is a one loop effect, which requires addressing new issues that do not arise in simulations of tree-level processes. Working in the momentum-space Fock basis, while convenient for the extraction of scattering amplitudes, …

Correcting quantum errors using a classical code and one additional qubit
Tenzan Araki, Joseph F. Goodwin, Zhenyu Cai
https://arxiv.org/abs/2510.05008 https://

Correcting quantum errors using a classical code and one additional qubit
Classical error-correcting codes are powerful but incompatible with quantum noise, which includes both bit-flips and phase-flips. We introduce Hadamard-based Virtual Error Correction (H-VEC), a protocol that empowers any classical bit-flip code to correct arbitrary Pauli noise with the addition of only a single ancilla qubit and two layers of controlled-Hadamard gates. Through classical post-processing, H-VEC virtually filters the error channel, projecting the noise into pure Y-type errors that…

Computational Monogamy of Entanglement and Non-Interactive Quantum Key Distribution
Alex B. Grilo, Giulio Malavolta, Michael Walter, Tianwei Zhang
https://arxiv.org/abs/2510.00791

Computational Monogamy of Entanglement and Non-Interactive Quantum Key Distribution
Quantum key distribution (QKD) enables Alice and Bob to exchange a secret key over a public, untrusted quantum channel. Compared to classical key exchange, QKD achieves everlasting security: after the protocol execution the key is secure against adversaries that can do unbounded computations. On the flip side, while classical key exchange can be achieved non-interactively (with two simultaneous messages between Alice and Bob), no non-interactive protocol is known that provides everlasting secur…

SPAM Tolerance for Pauli Error Estimation
Ryan O'Donnell, Samvitti Sharma
https://arxiv.org/abs/2510.00230 https://arxiv.org/pdf/2510.00230

SPAM Tolerance for Pauli Error Estimation
The Pauli channel is a fundamental model of noise in quantum systems, motivating the task of Pauli error estimation. We present an algorithm that builds on the reduction to Population Recovery introduced in [FO21]. Addressing an open question from that work, our algorithm has the key advantage of robustness against even severe state preparation and measurement (SPAM) errors. To tolerate SPAM, we must analyze Population Recovery on a combined erasure/bit-flip channel, which necessitates extendin…