SearcharxivSearch

arXiv · 2509.23083

An Interacting System and Environment with Prior Correlations Plus Local Operations Can Mimic Uncorrelated Evolution

Abstract

Initial system-environment correlations can induce reduced dynamics that depart from the standard completely positive (CP) description. We study when such dynamics can be reproduced by the same global unitary acting on an initial system-environment product state. We show that local preprocessing on the system, applied prior to the joint evolution, can lead to dynamics which are completely positive. We focus on two-qubit system-environment states, with a three-qubit extension when a single ancilla is used to implement Kraus channel preprocessing. We analyze three classes of local operations$-$measurements, unitaries, and Kraus channels$-$and characterize their ability to satisfy dynamics matching while minimally perturbing the initial system state. Local measurements can always enforce dynamics matching but necessarily reduce state fidelity. We numerically investigated local unitary preprocessing. Local unitaries enforce dynamics matching in all tested instances and typically preserve the system state: in 402 numerical cases the average fidelity is 99.8%, more than 92% of cases exceed 99% fidelity, and the minimum fidelity is 94.2%. We show that a two-term Kraus channel, realizable with a single ancillary qubit coupled to the system, achieves dynamics matching with unit fidelity in all tested cases. As a second contribution, we demonstrate that local preprocessing can prevent the emergence of non--completely positive (NCP) reduced dynamics in a time-dependent setting. For a correlated two-qubit experiment with a time-dependent global unitary U(t), the induced compatibility domain is fixed by the initial correlations. For every t in a nontrivial continuous interval, the reduced dynamics are NCP when defined over this domain. We then show that a single, time-independent local unitary applied prior to the joint evolution renders the reduced dynamics CP over the entire interval.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel Dilley, Alvin Gonzales, Jeffrey Larson, Mark Byrd. 2025-09-27. An Interacting System and Environment with Prior Correlations Plus Local Operations Can Mimic Uncorrelated Evolution. https://arxiv.org/abs/2509.23083

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