Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.01521

Continuous-Process Randomized Compilation for Quantum Process Tensors

He Wang

quant-phSubmitted Oct 1, 2026• Announced Oct 2, 2026• 2 citations• Revised Oct 3, 2026 (v2)
v1 · Oct 1, 2026v2 · Oct 3, 2026
arXivHTMLPDF

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.

Some signs of AI-generated textStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Temporal-Access Resource Theory for Continuous Process Tensors

He Wang

The uncontrolled endpoint channel can conceal how well a quantum process can protect a logical task under time-resolved control. We formulate a fixed-task resource theory of continuous process tensors with physical access interfaces, entrance-erasing free objects, and budgeted free conversions. Complete-record total-variation error measures performance; the calibrated capability is monotone under conversions that preserve a common free baseline. For unknown-state transmission the baseline is exactly $1-d^{-2}$. Two qubit processes with the same endpoint channel have optimal errors $0$ and $p=\sin^2(2gh)$ at the same finite pulse budget in an ideal-transparent system-only window architecture, forcing any endpoint-only predictor to err by at least $p/2$ on one of them. An exactly solvable family shows how the allocation of a fixed interaction phase around a control window sets the attainable error, and a nontrivial perfect echo requires and attains total control action $π$ in that architecture. The separation extends directly to every qubit unitary target at a budget that includes its boundary gate, while unitary tasks in any dimension have baseline $1-d^{-2}$ whenever a budget-feasible free realization gives the depolarizing output. Complete-record implementation bounds quantify coherent and dissipative control imperfections. Continuous-process randomized compilation supplies physical instrument pullbacks; compatible completion conditions extend their action, and certified dynamical bounds yield achievable task-error and capability guarantees. The resulting theory identifies temporal structure and control investment that endpoint characterization alone cannot resolve.

quant-pharXiv:2610.13110•Oct 12, 2026•1 citation

Noise Correlations as a Resource in Pauli-Twirled Circuits

Antoine Brillant, Rohan N Rajmohan, Peter Groszkowski +3 more

Randomized compiling (RC) is an established tool to tailor arbitrary quantum noise channels into Pauli errors. The effect of both spatial and temporal noise correlations in randomly compiled circuits, however, is not fully understood. Here, we show that for a broad class of correlated Gaussian noise, RC reduces both the strength and temporal range of correlations. For Clifford circuits, we derive a simple analytical expression for the circuit fidelity of randomly compiled circuits. Surprisingly, we show that this fidelity is always increased by the presence of correlations, suggesting that correlations are a resource in randomly compiled circuits. To leading order in system-bath coupling, we also show that RC suppresses the quantum component of bath correlations, implying that one can safely treat weak noise as being classical. Finally, through extensive numerical simulations, we show that our results remain valid for many relevant non-Clifford circuits. These results clarify how RC mitigates memory effects and enhances circuit robustness.

quant-pharXiv:2603.12054•Mar 13, 2026•2 citations

Access Resources and Stability of Error-Correction Capabilities in Continuous Strategic Codes

He Wang

Continuous quantum error correction depends on which parts of a measurement record remain available to the controller at recovery. We study this temporal access using continuous strategic codes, formulated as open continuous process tensors contracted with causal instruments and conditional recovery. For monitored stabilizer codes, a common-optimal-correction criterion identifies when records can be merged without loss and yields a factorization for separated CSS inference. Terminal decision labels and causal persistent memory carry different costs: five persistent classical states reach the complete-record optimum in a finite-strength counting model, whereas its two-window diffusive counterpart has nine terminal decision labels and requires unbounded memory for exact causal recovery. Uniform lower and constructive upper bounds establish an optimal fidelity deficit of order $m^{-2}$ for $m$ persistent states in the diffusive model. Counting and diffusive stability bounds translate open-process approximation into guarantees for deployed-controller performance and retained access advantages, quantified by explicit quantizers and model-mismatch curves. The same process--instrument framework connects storage with persistent environments and irreversible noise to spacetime interrogation and record-selected paths for a logical $T$ gate. These results specify which record distinctions recovery needs, the memory cost of approximating them, and the logical protection retained under model error.

quant-pharXiv:2611.01592•Nov 3, 2026•0 citations

Recovering Coherent Errors from Randomized-Compiling Labels

Kushagra Vyas

Randomized compiling converts a coherent gate error into a stochastic one by dressing each gate with a randomly chosen Pauli operator, and the standard view is that the coherent information is lost once outcomes are averaged over these random choices. This is incorrect: an exact Fisher-information identity shows that the averaged data and the correlation between the outcome and the random choice, the twirl label, together conserve the full information, and only the label is normally discarded. Retaining it turns an unmodified randomized-compiling run into an unbiased estimator for the coherent error, at no added circuit cost, valid under realistic decoherence and at any circuit depth. The same construction extends to coupling between qubits through two further mechanisms: a neighboring qubit prepared in a known, randomized state probes static coupling, and randomizing the pulse count used to prepare that state isolates a second, physically distinct leakage effect found unexpectedly on real hardware during this work. All three results are derived exactly, checked against closed-form oracles, and tested on a 127-qubit IBM processor. The single-qubit case is confirmed cleanly: an injected phase is recovered to 0.006~rad while the same data without labels shows no signal. The two-qubit extensions are validated at the level of the recovery circuit, with clean positive controls on hardware, though the coupling strengths themselves remain below the resolution of the shot budgets used here.

quant-pharXiv:2607.26756•Jul 30, 2026•1 citation

Spatiotemporal Pauli processes: Quantum combs for modeling correlated noise in quantum error correction

John F Kam, Angus Southwell, Spiro Gicev +2 more

Correlated noise is a critical failure mode in quantum error correction (QEC), yet a gap remains between the stochastic Pauli models used for scalable QEC analyses and the microscopic, non-Markovian descriptions of noise in physical devices. We bridge this gap by introducing Spatiotemporal Pauli Processes (SPPs): the natural multi-time generalization of Pauli channels, joint probability distributions over Pauli faults across space and time, obtained exactly from any noise process, however non-Markovian, under standard Pauli-frame randomization. SPPs thereby provide a single language in which correlated noise can be recast, compared, and extended, compatible with both microscopic open systems modeling and the stabilizer workflow of QEC design and analysis. Our central result is constructive: the multi-time Pauli twirl acts by local contractions on a process tensor network, yielding an explicit classical tensor network whose virtual bonds encode memory, bounded by the environment's Liouville-space dimension. Transfer operator diagnostics link memory spectra to correlation decay, and hidden Markov representations enable efficient sampling of correlated Pauli fault trajectories, mapping microscopically derived noise directly into circuit-level QEC simulation. We demonstrate this with surface code memory and stability benchmarks up to distance $19$. A temporal "storm" model with tunable correlation time shows that memory alone, at strictly fixed marginal error rates, systematically erodes the exponential error suppression expected from code distance. A genuinely spatiotemporal quantum cellular automaton bath maps exactly, under system twirling, to a nonlinear probabilistic cellular automaton; tuning its coherent interactions drives the noise into a pseudo-critical regime with critical slowing down and macroscopic error avalanches that reverse surface code distance scaling.

quant-pharXiv:2603.05474•Mar 6, 2026•6 citations

A memory-information window in finite-duration quantum control

Doyeol, Ahn

Environmental noise is a major source of decoherence and errors in quantum systems. In a non-Markovian environment, the noise has a finite correlation time, and the system can retain information about its previous interactions with the environment. Here, we investigate how such environmental memory can be observed through a finite-duration coherent quantum operation. Coherent control dynamically reshapes the stochastic coupling operator and thereby changes how two-time noise correlations affect the quantum process. For Ornstein-Uhlenbeck noise, we show analytically that two different limits reduce the information on the correlation time. In the short-memory limit, the leading dynamics depend on the integrated-noise combination σ/τc, where σ is the noise variance and τc is the correlation time, making these parameters locally degenerate. In the long-memory limit, the stochastic field becomes quasi-static during the operation, and sensitivity to the correlation time is suppressed. Exact stochastic simulations for a driven single-qubit Xπ rotation and a two-qubit exchange gate show that independent correlation-time information becomes largest between these limits, when the environmental and control timescales are comparable. Noncommuting controls enhance this information, whereas commuting controls do not. Simulations at different gate durations tg further show that the information window approximately follows the dimensionless correlation ratio τc/tg. These results provide a timescale-matching principle for probing finite-correlation non-Markovian noise with coherent quantum control.

quant-pharXiv:2609.21380•Sep 21, 2026•0 citations
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.
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)g(t)g(t) and autonomous Markov control, a conditional-state Duhamel argument bounds complete adaptive-record error by ϵ≤min⁡{1,4∫0Tdt∫0tds g(t)g(s)b(s,t)}\epsilon\leq\min\{1,4\int_0^Tdt\int_0^t ds\,g(t)g(s)b(s,t)\}ϵ≤min{1,4∫0T​dt∫0t​dsg(t)g(s)b(s,t)}, where bbb measures control mixing. Fixed Pauli refresh gives ϵ≤(3/2)g∗2TΔr\epsilon\leq(3/2)g_*^2T\Delta_rϵ≤(3/2)g∗2​TΔ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.
The uncontrolled endpoint channel can conceal how well a quantum process can protect a logical task under time-resolved control. We formulate a fixed-task resource theory of continuous process tensors with physical access interfaces, entrance-erasing free objects, and budgeted free conversions. Complete-record total-variation error measures performance; the calibrated capability is monotone under conversions that preserve a common free baseline. For unknown-state transmission the baseline is exactly 1−d−21-d^{-2}1−d−2. Two qubit processes with the same endpoint channel have optimal errors 000 and p=sin⁡2(2gh)p=\sin^2(2gh)p=sin2(2gh) at the same finite pulse budget in an ideal-transparent system-only window architecture, forcing any endpoint-only predictor to err by at least p/2p/2p/2 on one of them. An exactly solvable family shows how the allocation of a fixed interaction phase around a control window sets the attainable error, and a nontrivial perfect echo requires and attains total control action πππ in that architecture. The separation extends directly to every qubit unitary target at a budget that includes its boundary gate, while unitary tasks in any dimension have baseline 1−d−21-d^{-2}1−d−2 whenever a budget-feasible free realization gives the depolarizing output. Complete-record implementation bounds quantify coherent and dissipative control imperfections. Continuous-process randomized compilation supplies physical instrument pullbacks; compatible completion conditions extend their action, and certified dynamical bounds yield achievable task-error and capability guarantees. The resulting theory identifies temporal structure and control investment that endpoint characterization alone cannot resolve.
Randomized compiling (RC) is an established tool to tailor arbitrary quantum noise channels into Pauli errors. The effect of both spatial and temporal noise correlations in randomly compiled circuits, however, is not fully understood. Here, we show that for a broad class of correlated Gaussian noise, RC reduces both the strength and temporal range of correlations. For Clifford circuits, we derive a simple analytical expression for the circuit fidelity of randomly compiled circuits. Surprisingly, we show that this fidelity is always increased by the presence of correlations, suggesting that correlations are a resource in randomly compiled circuits. To leading order in system-bath coupling, we also show that RC suppresses the quantum component of bath correlations, implying that one can safely treat weak noise as being classical. Finally, through extensive numerical simulations, we show that our results remain valid for many relevant non-Clifford circuits. These results clarify how RC mitigates memory effects and enhances circuit robustness.
Continuous quantum error correction depends on which parts of a measurement record remain available to the controller at recovery. We study this temporal access using continuous strategic codes, formulated as open continuous process tensors contracted with causal instruments and conditional recovery. For monitored stabilizer codes, a common-optimal-correction criterion identifies when records can be merged without loss and yields a factorization for separated CSS inference. Terminal decision labels and causal persistent memory carry different costs: five persistent classical states reach the complete-record optimum in a finite-strength counting model, whereas its two-window diffusive counterpart has nine terminal decision labels and requires unbounded memory for exact causal recovery. Uniform lower and constructive upper bounds establish an optimal fidelity deficit of order m−2m^{-2}m−2 for mmm persistent states in the diffusive model. Counting and diffusive stability bounds translate open-process approximation into guarantees for deployed-controller performance and retained access advantages, quantified by explicit quantizers and model-mismatch curves. The same process--instrument framework connects storage with persistent environments and irreversible noise to spacetime interrogation and record-selected paths for a logical TTT gate. These results specify which record distinctions recovery needs, the memory cost of approximating them, and the logical protection retained under model error.
Randomized compiling converts a coherent gate error into a stochastic one by dressing each gate with a randomly chosen Pauli operator, and the standard view is that the coherent information is lost once outcomes are averaged over these random choices. This is incorrect: an exact Fisher-information identity shows that the averaged data and the correlation between the outcome and the random choice, the twirl label, together conserve the full information, and only the label is normally discarded. Retaining it turns an unmodified randomized-compiling run into an unbiased estimator for the coherent error, at no added circuit cost, valid under realistic decoherence and at any circuit depth. The same construction extends to coupling between qubits through two further mechanisms: a neighboring qubit prepared in a known, randomized state probes static coupling, and randomizing the pulse count used to prepare that state isolates a second, physically distinct leakage effect found unexpectedly on real hardware during this work. All three results are derived exactly, checked against closed-form oracles, and tested on a 127-qubit IBM processor. The single-qubit case is confirmed cleanly: an injected phase is recovered to 0.006~rad while the same data without labels shows no signal. The two-qubit extensions are validated at the level of the recovery circuit, with clean positive controls on hardware, though the coupling strengths themselves remain below the resolution of the shot budgets used here.
Correlated noise is a critical failure mode in quantum error correction (QEC), yet a gap remains between the stochastic Pauli models used for scalable QEC analyses and the microscopic, non-Markovian descriptions of noise in physical devices. We bridge this gap by introducing Spatiotemporal Pauli Processes (SPPs): the natural multi-time generalization of Pauli channels, joint probability distributions over Pauli faults across space and time, obtained exactly from any noise process, however non-Markovian, under standard Pauli-frame randomization. SPPs thereby provide a single language in which correlated noise can be recast, compared, and extended, compatible with both microscopic open systems modeling and the stabilizer workflow of QEC design and analysis. Our central result is constructive: the multi-time Pauli twirl acts by local contractions on a process tensor network, yielding an explicit classical tensor network whose virtual bonds encode memory, bounded by the environment's Liouville-space dimension. Transfer operator diagnostics link memory spectra to correlation decay, and hidden Markov representations enable efficient sampling of correlated Pauli fault trajectories, mapping microscopically derived noise directly into circuit-level QEC simulation. We demonstrate this with surface code memory and stability benchmarks up to distance 191919. A temporal "storm" model with tunable correlation time shows that memory alone, at strictly fixed marginal error rates, systematically erodes the exponential error suppression expected from code distance. A genuinely spatiotemporal quantum cellular automaton bath maps exactly, under system twirling, to a nonlinear probabilistic cellular automaton; tuning its coherent interactions drives the noise into a pseudo-critical regime with critical slowing down and macroscopic error avalanches that reverse surface code distance scaling.
Environmental noise is a major source of decoherence and errors in quantum systems. In a non-Markovian environment, the noise has a finite correlation time, and the system can retain information about its previous interactions with the environment. Here, we investigate how such environmental memory can be observed through a finite-duration coherent quantum operation. Coherent control dynamically reshapes the stochastic coupling operator and thereby changes how two-time noise correlations affect the quantum process. For Ornstein-Uhlenbeck noise, we show analytically that two different limits reduce the information on the correlation time. In the short-memory limit, the leading dynamics depend on the integrated-noise combination σ/τc, where σ is the noise variance and τc is the correlation time, making these parameters locally degenerate. In the long-memory limit, the stochastic field becomes quasi-static during the operation, and sensitivity to the correlation time is suppressed. Exact stochastic simulations for a driven single-qubit Xπ rotation and a two-qubit exchange gate show that independent correlation-time information becomes largest between these limits, when the environmental and control timescales are comparable. Noncommuting controls enhance this information, whereas commuting controls do not. Simulations at different gate durations tg further show that the information window approximately follows the dimensionless correlation ratio τc/tg. These results provide a timescale-matching principle for probing finite-correlation non-Markovian noise with coherent quantum control.