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

Proofs of quantum memory

Minki Hhan, Tomoyuki Morimae, Yasuaki Okinaka, Takashi Yamakawa

Year

2025

Journal

arXiv preprint

DOI

arXiv:2510.04159

arXiv

2510.04159

With the rapid advances in quantum computer architectures and the emerging prospect of large-scale quantum memory, it is becoming essential to classically verify that remote devices genuinely allocate the promised quantum memory with specified number of qubits and coherence time. In this paper, we introduce a new concept, proofs of quantum memory (PoQM). A PoQM is an interactive protocol between a classical probabilistic polynomial-time (PPT) verifier and a quantum polynomial-time (QPT) prover over a classical channel where the verifier can verify that the prover has possessed a quantum memory with a certain number of qubits during a specified period of time. PoQM generalize the notion of proofs of quantumness (PoQ) [Brakerski, Christiano, Mahadev, Vazirani, and Vidick, JACM 2021]. Our main contributions are a formal definition of PoQM and its constructions based on hardness of LWE. Specifically, we give two constructions of PoQM. The first is of a four-round and has negligible soundness error under subexponential-hardness of LWE. The second is of a polynomial-round and has inverse-polynomial soundness error under polynomial-hardness of LWE. As a lowerbound of PoQM, we also show that PoQM imply one-way puzzles. Moreover, a certain restricted version of PoQM implies quantum computation classical communication (QCCC) key exchange.

Open paper