Compare Papers
Paper 1
Efficient learning of logical noise from syndrome data
Han Zheng, Chia-Tung Chu, Senrui Chen, Argyris Giannisis Manes, Su-un Lee, Sisi Zhou, Liang Jiang
- Year
- 2026
- Journal
- arXiv preprint
- DOI
- arXiv:2601.22286
- arXiv
- 2601.22286
Characterizing errors in quantum circuits is essential for device calibration, yet detecting rare error events requires a large number of samples. This challenge is particularly severe in calibrating fault-tolerant, error-corrected circuits, where logical error probabilities are suppressed to higher order relative to physical noise and are therefore difficult to calibrate through direct logical measurements. Recently, Wagner et al. [PRL 130, 200601 (2023)] showed that, for phenomenological Pauli noise models, the logical channel can instead be inferred from syndrome measurement data generated during error correction. Here, we extend this framework to realistic circuit-level noise models. From a unified code-theoretic perspective and spacetime code formalism, we derive necessary and sufficient conditions for learning the logical channel from syndrome data alone and explicitly characterize the learnable degrees of freedom of circuit-level Pauli faults. Using Fourier analysis and compressed sensing, we develop efficient estimators with provable guarantees on sample complexity and computational cost. We further present an end-to-end protocol and demonstrate its performance on several syndrome-extraction circuits, achieving orders-of-magnitude sample-complexity savings over direct logical benchmarking. Our results establish syndrome-based learning as a practical approach to characterizing the logical channel in fault-tolerant quantum devices.
Open paperPaper 2
Complex Paths Around The Sign Problem
Andrei Alexandru, Gokce Basar, Paulo F. Bedaque, Neill C. Warrington
- Year
- 2020
- Journal
- arXiv preprint
- DOI
- arXiv:2007.05436
- arXiv
- 2007.05436
The Monte Carlo evaluation of path integrals is one of a few general purpose methods to approach strongly coupled systems. It is used in all branches of Physics, from QCD/nuclear physics to the correlated electron systems. However, many systems of great importance (dense matter inside neutron stars, the repulsive Hubbard model away from half-filling, dynamical and non-equilibrium observables) are not amenable to the Monte Carlo method as it currently stands due to the so-called "sign-problem". We review a new set of ideas recently developed to tackle the sign problem based on the complexification of field space and the Picard-Lefshetz theory accompanying it. The mathematical ideas underpinning this approach, as well as the algorithms so far developed, are described together with non-trivial examples where the method has already been proved successful. Directions of future work, including the burgeoning use of machine learning techniques, are delineated.
Open paper