Searcharxiv⌕ Search

arXiv · 2609.36541

Exponential Advantage of Quantum over Classical References in Leakage Detection

Abstract

Leakage from a known encoding subspace can be detected by projection. However, the corresponding projector is unavailable when the encoding subspace is not classically specified. Here we show how independent quantum references prepared by the same encoder enable leakage detection without a classical description of the encoding. A coherent measurement on the references and a single message leaves every state within the two-dimensional encoding subspace, including its entanglement with a remote system, exactly unchanged. We derive the exact detection law for $M$ ideal references and prove optimality among tests with zero false alarm for every encoding. For orthogonal leakage, the miss probability is asymptotic to $4/M$, independent of the ambient dimension $d$. Measuring all references first, even collectively, gives zero detection at every finite budget under the same zero-false-alarm requirement. For a fixed detection target between zero and one, the optimal measurement-first cost is $Θ(d/ε)$ at sufficiently small tolerance $ε$ on normal false alarm and conditional disturbance; a dimension-independent coherent budget suffices. For one logical qubit encoded in three physical qubits, seven coherent references achieve at least $50\%$ orthogonal-leakage detection, whereas any measurement-first receiver needs at least $588$ under the same $1\%$ normal tolerances. Quantum references thus support leakage checks without classical reconstruction, with a sample advantage exponential in the number of physical qubits.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zheng An. 2026-09-29. Exponential Advantage of Quantum over Classical References in Leakage Detection. https://arxiv.org/abs/2609.36541

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Preparation of Hamming-Weight-Preserving Quantum States with Log-Depth Quantum Circuits

Hamming-Weight-Preserving (HWP) states, $\vertψ_{\mathrm{H}}\rangle=\sum_{\mathrm{HW}(x)=k}α_x\vert x\rangle$, represent a fundamental class of quantum states on $n$ qubits with fixed excitation number $k$, playing a pivotal role in quantum simulation, machine learning, and optimization, with prominent examples including the Bethe eigenstates of integrable models and Configuration Interaction states. However, existing preparation methodologies typically rely on sequential architectures whose depth scales linearly with the subspace dimension, whereas practical deployment on realistic quantum hardware demands shallow circuits to mitigate decoherence. In this work, we present quantum circuits that achieve the information theoretic limit of depth logarithmic in the number of populated computational basis states while maintaining asymptotically optimal size. Specifically, for general HWP states, we provide a construction that matches the lower bounds of $Θ(\log \binom{n}{k})$ depth and $Θ(\binom{n}{k})$ size. Furthermore, we propose a resource efficient scheme utilizing only $O(\log k)$ ancillary qubits. For the $k=2$ case, where HWP states naturally admit a graph representation, we show that states whose support graphs are trees or grids admit ancilla free preparation with $Θ(\log n)$ depth and $Θ(m)$ size. Overall, our work provides logarithmic depth state preparation algorithms across various regimes while establishing a connection between quantum state synthesis and Krawtchouk polynomials.

quant-ph↗

Matrix-product-state-assisted variational Gibbs-state preparation

Evaluating the von Neumann entropy is a central challenge in variational Gibbs-state preparation. We introduce and benchmark matrix-product-state (MPS) assistance for classically evaluating and optimizing the purification circuits without full-statevector storage, examining how circuit architecture affects both thermal-state accuracy and the computational resources required. Comparisons on four- and six-spin transverse-field Ising and XXZ chains reveal complementary strengths: a thermofield-double ansatz performs better at high temperature, whereas a contiguous hardware-efficient ansatz (HEA) performs better on cooling. We identify a layer-dependent entropy ceiling in the contiguous HEA and compare it with an interleaved architecture whose entropy capacity is set solely by the ancilla qubit count. MPS-based benchmarks on 10 x 1, 20 x 1, 3 x 3, and 4 x 4 transverse-field Ising systems show that the tested interleaved circuits generally lower the free-energy errors and improve thermal observables. However, greater entropy capacity and lower free energy do not guarantee improvement in every observable. The architectures also differ in classical cost: contiguous registers permit entropy evaluation at a single MPS bond, whereas the interleaved arrangement requires a dense entropy calculation that scales exponentially with the number of ancillas. These benchmarks connect the accuracy of MPS-assisted Gibbs-state preparation to circuit capacity, optimization, and the tractability of energy and entropy evaluation.

quant-ph↗

A Unified Error Correction Code for Universal Quantum Computing with Identical Particles

We present a universal fault-tolerant quantum computing architecture based on identical particle qubits (IPQs), where we find that the first-order IPQ - bath interaction fundamentally differs from the conventional first-order qubit-bath interaction. This key distinction necessitates a redesign of existing strategies to fight decoherence. We propose that the simplest quantum error correction code can be realized directly within the physical qubit, provided that conventional correction and restoration are generalized beyond unitary operations to employ physically implementable reversal operations -- naturally placing logical and physical qubits on equal footing. We further demonstrate that dynamical decoupling (DD) remains effective within this unified framework, and that a decoherence-free subspace (DFS) -- like structure emerges. Unlike previous approximate treatments, our analytically solvable IPQ-Bath model enables rigorous testing of these strategies, with numerical simulations validating their effectiveness.

quant-ph↗