Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.02331

Temporal nonlocality of a qudit resides in the input state, not the channel, and certifies temporal teleportation up to a fundamental limit

Karol Bartkiewicz·Patrycja Tulewicz
View original source ↗Read source document ↗Export metadata ↓

Abstract

Correlations between two moments in time can be too strong for any classical explanation -- and, remarkably, this can happen for a single quantum system measured twice, with no second particle involved. We show that when one qudit is sent through a noisy channel, the strength of this "nonlocality in time" -- the temporal nonlocality robustness $\mathrm{TNR}$ -- is carried entirely by the starting state: it vanishes precisely when the input is maximally mixed (completely random), $\mathrm{TNR}(\rho_A,\mathcal{E})=0\Leftrightarrow\rho_A=\mathbb{1}/d$, for the standard noise families. The resource is not any coherence in the channel but the back-action of the input's mixedness, and it survives even complete decoherence. This is at once a power and a trap. As a power, $\mathrm{TNR}$ device-independently lower-bounds the fidelity of temporal teleportation -- sending an unknown state forward in time -- reaching $7/9$ at $d=3$, without trusting the measuring devices. As a trap, because the certified quantity is decoupled from the channel's actual coherence transmission, it can certify more than the channel delivers: an injective (reversible) unitary attains the maximal temporal-Bell signal yet teleports below the classical baseline. We resolve this over-certification completely -- a universal cap $\mathrm{TNR}\le(d-1)/d$ with an exact channel-resolved value, honest certification for the depolarizing channel and for any sufficiently mixed probe, and a proof that no choice of probes makes it channel-universal. Underpinning the results is a unified semidefinite-programming hierarchy of the temporal entanglement, steering and nonlocality robustnesses ($\mathrm{TER}$, $\mathrm{TSR}$, $\mathrm{TNR}$), with a strict lower hierarchy and an upper one conditional on no-signaling in time ($\mathrm{NSIT}$). All structure is verified numerically for $d=2$ through $5$.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

Karol Bartkiewicz, Patrycja Tulewicz. 2026-07-02. Temporal nonlocality of a qudit resides in the input state, not the channel, and certifies temporal teleportation up to a fundamental limit. https://arxiv.org/abs/2607.02331

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗