SearcharxivSearch

arXiv · 2608.24543

Quantum Change Interval: Exact Asymptotics for Minimum Error Localization

Abstract

We study a returning quantum change interval in which a source emits $\lvert\psi\rangle$ over one interval and $\lvert0\rangle$ elsewhere. A collective measurement on the full sequence identifies both endpoints with minimum error. We analyze the Gram matrix using Toeplitz comparison and F{\o}lner transfer, together with an exact decomposition by excitation number and interval hull. The resulting bounds establish asymptotic Bayes optimality of the square root measurement (SRM). Let $c=\lvert\langle0\vert\psi\rangle\rvert$ and $p_1(x)=4(1-x^2)K^2(x^2)/\pi^2$, where $K$ is the complete elliptic integral of the first kind. For a known interval length $i$, the SRM success probability and the Bayes optimum converge to the same Toeplitz symbol integral as the number $N$ of translations grows. For fixed $i$ and $0<c<1$, their gap is $P_{\mathrm{opt}}(G_{N,i})-P_{\mathrm{SRM}}(G_{N,i})=O_{i,c}(N^{-1/2})$. If $i$ and $N$ both diverge, their common limit is $p_1(c^2)$, with no constraint on their relative growth. For unknown length, the uniform prior over all $M_n=n(n+1)/2$ nonempty intervals gives the common limit $p_1(c)^2$ at fixed overlap. For a varying overlap $c_n$, set $\tau_n=n(1-c_n)(\log n)^2$. Uniformly for $0\leq\tau_n\leq T$, we obtain $M_nP_X=(1+2\sqrt{\tau_n}/\pi+\sqrt{2}\tau_n/\pi^2)^2+O_T(\log\log n/\log n)$, where $X\in\{\mathrm{tr},\mathrm{SRM},\mathrm{opt}\}$. More generally, if $c_n$ approaches one from below and $n p_1(c_n)\to\infty$, the same three quantities satisfy $P_X\sim p_1(c_n)^2$. These asymptotic laws also extend to joint detection and exact localization in the presence of a no change prior.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xu Chen, Xue Ma. 2026-08-25. Quantum Change Interval: Exact Asymptotics for Minimum Error Localization. https://arxiv.org/abs/2608.24543

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

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph