Compare Papers

Paper 1

Noise-Resilient Heisenberg-limited Quantum Sensing via Indefinite-Causal-Order Error Correction

Hang Xu, Xiaoyang Deng, Ze Zheng, Tailong Xiao, Guihua Zeng

Year

2026

Journal

arXiv preprint

DOI

arXiv:2601.01404

arXiv

2601.01404

Quantum resources can, in principle, enable Heisenberg-limited (HL) sensing, yet no-go theorems imply that HL scaling is generically unattainable in realistic noisy devices. While quantum error correction (QEC) can suppress noise, its use in quantum sensing is constrained by stringent requirements, including prior noise characterization, restrictive signal-noise compatibility conditions, and measurement-based syndrome extraction with global control. Here we introduce an ICO-based QEC protocol, providing the first application of indefinite causal order (ICO) to QEC. By coherently placing auxiliary controls and noisy evolution in an indefinite causal order, the resulting noncommutative interference enables an auxiliary system to herald and correct errors in real time, thereby circumventing the limitations of conventional QEC and restoring HL scaling. We rigorously establish the protocol for single- and multi-noise scenarios and demonstrate its performance in single-qubit, many-body, and continuous-variable platforms. We further identify regimes in which error correction can be implemented entirely by unitary control, without measurements. Our results reveal ICO as a powerful resource for metrological QEC and provide a broadly applicable framework for noise-resilient quantum information processing.

Open paper

Paper 2

Fast surgery for quantum LDPC codes

Nouédyn Baspin, Lucas Berent, Lawrence Z. Cohen

Year

2025

Journal

arXiv preprint

DOI

arXiv:2510.04521

arXiv

2510.04521

Quantum LDPC codes promise significant reductions in physical qubit overhead compared with topological codes. However, many existing constructions for performing logical operations come with distance-dependent temporal overheads. We introduce a scheme for performing generalized surgery on quantum LDPC codes using a constant number of rounds of syndrome measurement. The merged code in our scheme is constructed by taking the total complex of the base code and a suitably chosen homomorphic chain complex. We demonstrate the applicability of our scheme on an example multi-cycle code and assess the performance under a phenomenological noise model, showing that fast surgery performs comparably to standard generalized surgery with multiple rounds. Our results pave the way towards fault-tolerant quantum computing with LDPC codes with both low spatial and temporal overheads.

Open paper