arXiv:2610.01521
Continuous-Process Randomized Compilation for Quantum Process Tensors
He Wang
Abstract
Traditional discrete randomized compiling (RC) tailors errors with random control frames at logical-gate boundaries, but fails to capture intra-instrument control evolution or persistent system-environment coupling. In memory-bearing environments, errors correlate across times, not just single gates. We build continuous-process randomized compilation (CPRC) in the continuous process tensor (cPT) framework, unifying random unitary control trajectories, pointwise-covariant finite-duration instruments, and environmental dynamics on one time axis. We study four protocols: fixed Pauli refresh, bounded Cayley paths, unitary Brownian motion, Ornstein-Uhlenbeck driving. We obtain three key results: (1) Pointwise covariance ensures each trajectory exactly reproduces the target logic without system-environment coupling; a closed-frame counterexample proves endpoint-only compensation causes first-order instrument errors. (2) Independent Pauli conjugations over full intervals diagonalize error histories at boundaries, but classical labels retain environment-induced correlations, confirmed by an exact static-bath solution. (3) We derive a total-variation error bound for full adaptive output records under bounded centered coupling and mixing conditions. We prove the Fock norm convergence of the entire trajectory-averaged cPT for finite non-Gaussian environments and Gaussian baths with time-integrable covariance, including the uncut Drude spectrum. We numerically validate the theory in a qubit model via output probabilities, operator conditional mutual information, and all two-particle coefficients for both qubit and thermal Drude baths. This work extends RC from discrete circuits to continuous-time memory-bearing quantum processes, offering a unified framework, quantitative tools, implementable schemes, and benchmarks for non-Markovian error tailoring.
AI Summary
The paper asks how randomized compiling can preserve finite-duration logical operations while tailoring noise from an environment with temporal memory. It formulates continuous-process randomized compilation using continuous process tensors (cPTs), treating random control frames, instruments, and environmental evolution on one time axis. The protocols are independent Pauli refresh, finite-duration Cayley paths, unitary Brownian motion, and Ornstein–Uhlenbeck (OU) driving. Pointwise conjugation of instrument interactions preserves the target experiment trajectory by trajectory when system–environment coupling is absent. A closed-frame example shows that endpoint compensation alone can produce first-order logical errors. Independent Pauli conjugations of whole intervals yield mixtures of Pauli error histories, but an exact static-bath example shows that their classical labels remain correlated. For bounded, centered coupling with norm envelope $g(t)$ and autonomous Markov control, a conditional-state Duhamel argument bounds complete adaptive-record error by $\epsilon\leq\min\{1,4\int_0^Tdt\int_0^t ds\,g(t)g(s)b(s,t)\}$, where $b$ measures control mixing. Fixed Pauli refresh gives $\epsilon\leq(3/2)g_*^2T\Delta_r$. Separately, Dyson and Dyson–Wick expansions plus uniform particle-sector tails establish Fock-norm convergence of the averaged, trace-closed cPT for finite environments and specified Gaussian baths, including uncut Drude spectra. Numerical checks cover logical probabilities, operator conditional mutual information, and 225 two-insertion coefficients at one time pair. The operational bound excludes unbounded bath couplings; Gaussian convergence uses distinct covariance and cutoff assumptions. OU bounds require joint frame–velocity mixing. Faster Cayley refinement requires greater control speed, and finite-width pulses add accumulated error. Fock convergence supplies neither general entropy continuity nor an unrestricted instrument-uniform operational bound.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.