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

Exact Finite-Time Limits of Controlled Qubit Memories

Ying Xie

Published Nov 11, 2026• 0 citations
Publisher

Abstract

We determine the exact performance of a qubit memory subjected to a prescribed finite sequence of independent unital noise channels. The controller may use adaptive instruments, fresh ancillas, unlimited classical records, and conditional recovery, but only one qubit persists between noise steps. If s(j,1) ≥ s(j,2) ≥ s(j,3) are the Bloch singular values of step j and P = Σ(i=1 to 3) Π(j=1 to m) s(j,i), both the optimal average and worst-case pure-state fidelity equal max{2/3, 1/2 + P/6}. We also obtain the exact entanglement fidelity, diamond-distance error, and a concurrence ceiling max{0, (P − 1)/2} valid even for selective branches. Every optimum is attained by a finite protocol. The proof bounds the singular values of each noise derivative in the Klein hyperbolic metric, composes the bounds through arbitrary filters, and combines the resulting normal-form inequality with established two-qubit filtering results. It follows that selective adaptive control cannot extend the entanglement lifetime beyond unitary axis alignment. Two separate consequences concern heralded control of positivity-improving nonunital noise and qualitative entanglement-source placement. The deterministic storage theorem does not cover general nonunital noise, additional persistent qubits, or correlated noise. A visual guide records the reasoning routes, their joint proof premises, and the distinction between inherited tools and the present results.

DOI
10.5281/zenodo.24124638

Related papers

Exact Robustness Frontiers and Fidelity Limits for Qubit Memories

Ying Xie

We determine exact resource limits for a qubit memory with retained classical records. For every qubit noise channel A, the largest output generalized entanglement-breaking robustness under an input budget R_G ≤ r is a semidefinite program in two 4 × 4 positive matrices, attained with at most five classical outcomes. For amplitude damping we solve the full budget curve, including two mixed-state regimes, and attain it with one classical bit. Its contraction coefficient is one, approached with vanishing input resource, although every fixed positive resource budget contracts strictly. A different argument controls memories prepared from a perfect qubit: for prescribed independent noise channels A_1, …, A_n, arbitrary adaptive instruments and finite classical records obey R_G(Γ_n) ≤ R(Γ_n) ≤ ∏_j ν(A_j), where ν(A) = max{0, 2λ_max J_A − 1} and J_A is normalized. The proof propagates a positive 2 × 2 operator over the branches. For amplitude-damping survivals with product b, both robustness optima equal b; the optimal average and worst-case pure-state fidelities are (2+b)/3, the optimal Bell fidelity is (1+b)/2, and the minimum half-diamond error is (1−b)/2. Finite protocols attain all four operational optima simultaneously. Thus classical control can improve fidelity while leaving optimal robustness unchanged. The model permits one persistent qubit and excludes quantum bypass, environment access, and postselection. A visual guide records the reasoning routes, their joint premises, and the distinction between prior tools and the results developed here.

•Nov 12, 2026•0 citations

Unbounded Additive Gains and Uniform Lifetime Bounds for Controlled Qubit Memories

Ying Xie

We study the entanglement-breaking lifetime of a qubit subjected repeatedly to one fixed noise channel. Let m_U denote the best lifetime obtained by repeating one unitary control, N_U the lifetime under varying unitary controls, and N the lifetime under arbitrary deterministic qubit channels. We construct a nonempty open set of strictly completely positive channels with m_U = 3 and N_U = N = 4, disproving the stationary-control clause of the Lami–Giovannetti conjecture. A fixed Lindblad generator also produces weak-step channels for which N_U − m_U diverges. Nevertheless, every channel with finite m_U satisfies N_U < 50m_U and N < 128m_U. For such a non-entanglement-breaking channel, write C for its normalized Choi concurrence and δ for its minimum output eigenvalue over pure inputs. The scale T = 1 + log(1 + (1 − C)/δ)/(−log C) satisfies T/50 < m_U ≤ N_U ≤ N ≤ 14T. The proof combines a concurrence estimate for the positive-partial-transpose criterion, a stationary purity alignment, and a partition that charges purifying controls for their concurrence loss. The constants are conservative, and the separation constructions have existential small-parameter ranges. The lifetime comparisons exclude retained ancillas, persistent measurement records and postselection; N = N_U remains open. A visual guide records the reasoning routes and distinguishes inherited premises, numerical leads and proved conclusions.

•Nov 14, 2026•0 citations

The quantum switch as a commutation-syndrome filter for qubit Pauli channels: deterministic advantage over definite-order strategies and an exact geometric law

Yu Guo, Yuqi Chen, Jinming Guo +3 more

Abstract The quantum switch is known to remove noise probabilistically, but whether this constitutes an advantage over causally ordered processing has remained contentious: postselection, weak classical benchmarks, and task-dependent comparisons have all drawn criticism. Here we give an exact analysis of the question for a qubit under Pauli noise. For any two qubit Pauli channels, measuring the switch’s control qubit implements a commutation syndrome : it sorts each noise realization by whether the two Kraus errors commuted, syndrome information that an unencoded qubit does not otherwise possess, and the optimal measure-and-feed-forward protocol has a closed form. The analytical results have two levels of generality. For the exactly solvable pair, an isotropic depolarizing channel and a flip channel along an arbitrary axis, we prove a complete ceiling theorem: every definite-order protocol using each channel once, with arbitrary memoryless intermediate operations and receiver-side post-processing, deterministic or heralded, has entanglement fidelity at most ma x P c P , and the switch exceeds this ceiling deterministically , by p q / 3 over most of parameter space. For arbitrary qubit Pauli pairs, the ceiling is proven against arbitrary receiver-side post-processing, and the gain is strictly positive if and only if the two syndrome branches call for different Pauli corrections, confining the exceptions to error-dominated noise. Side systems are covered whenever they are non-signaling about the message. Beyond these theorems the evidence is numerical: strict gain in 99.8 % of 5000 random Pauli pairs, and no case, within a 200 -pair sample, in which an optimized midpoint echo overturns the gain. The state-resolved gain obeys an exact geometric law, Δ F = 2 p q / 3 | r ^ ⋅ n ^ | 2 : alignment is the condition under which the degenerate two-error syndrome becomes perfectly correctable. The separation survives control dephasing down to a threshold visibility that falls with noise strength, and at strong noise it outperforms coherent control of the two orderings even with twice the channel uses.

Physica Scripta•Sep 7, 2026•0 citations

What Must a Quantum-Memory Decoder Know About Temporally Correlated Noise?

Danesh Morales-Hashemi, Graeme Smith, Ningping Cao

What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent $X$ rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching $1/2$ relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below $1/2$, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's $X$ distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.

quant-pharXiv:2610.03545•Oct 5, 2026•0 citations

Dynamical decoupling sequences for multi-qubit dephasing suppression and long-time quantum memory

Gerardo A. Paz-Silva, Seung-Woo Lee, Todd J. Green +1 more

We consider a class of multi-qubit dephasing models that combine classical noise sources and linear coupling to a bosonic environment, and are controlled by arbitrary sequences of dynamical decoupling pulses. Building on a general transfer filter-function framework for open-loop control, we provide an exact representation of the controlled dynamics for arbitrary stationary non-Gaussian classical and quantum noise statistics, with analytical expressions emerging when all dephasing sources are Gaussian. This exact characterization is used to establish two main results. First, we construct multi-qubit sequences that ensure maximum high-order error suppression in both the time and frequency domain and that can be exponentially more efficient than existing ones in terms of total pulse number. Next, we show how long-time multi-qubit storage may be achieved by meeting appropriate conditions for the emergence of a fidelity plateau under sequence repetition, thereby generalizing recent results for single-qubit memory under Gaussian dephasing. In both scenarios, the key step is to endow multi-qubit sequences with a suitable displacement anti-symmetry property, which is of independent interest for applications ranging from environment-assisted entanglement generation to multi-qubit noise spectroscopy protocols.

arXiv:1602.06261•New Journal of Physics•Jul 11, 2016•48 citations

Sequential Capacity of Quantum Processes with Finite Memory

Yibin Wang

How complex can the responses of a quantum device become as it runs longer with a fixed internal memory? We quantify this complexity through sequential response capacity: how many adaptive testing stages, each using a fresh run, can continue to separate possible processes by a prescribed gap in response probabilities. For fixed system and memory sizes, we establish a tight law relating this capacity to run length and probability resolution. At fixed resolution, the capacity grows on the order of $K\log K$, where $K$ is the number of time steps in each run. Our construction attains this growth using time-dependent phase rotations on a single visible qubit with no additional internal memory; its tests give response probabilities exactly zero or one. Under the same tests, classical stochastic processes that measure in a fixed basis at every step have only linear capacity at fixed sizes and resolution. For phase sequences selected by a stored classical label, we then quantify how known independent Pauli noise changes this logarithmic enhancement. With ideal controls and weak residual phase noise after correction, we prove matching capacity bounds at a fixed small probability gap. These bounds identify the inverse residual phase-flip probability as the coherence timescale that limits the extra logarithmic growth.

quant-pharXiv:2610.02068•Oct 2, 2026•0 citations
We determine the exact performance of a qubit memory subjected to a prescribed finite sequence of independent unital noise channels. The controller may use adaptive instruments, fresh ancillas, unlimited classical records, and conditional recovery, but only one qubit persists between noise steps. If s(j,1) ≥ s(j,2) ≥ s(j,3) are the Bloch singular values of step j and P = Σ(i=1 to 3) Π(j=1 to m) s(j,i), both the optimal average and worst-case pure-state fidelity equal max{2/3, 1/2 + P/6}. We also obtain the exact entanglement fidelity, diamond-distance error, and a concurrence ceiling max{0, (P − 1)/2} valid even for selective branches. Every optimum is attained by a finite protocol. The proof bounds the singular values of each noise derivative in the Klein hyperbolic metric, composes the bounds through arbitrary filters, and combines the resulting normal-form inequality with established two-qubit filtering results. It follows that selective adaptive control cannot extend the entanglement lifetime beyond unitary axis alignment. Two separate consequences concern heralded control of positivity-improving nonunital noise and qualitative entanglement-source placement. The deterministic storage theorem does not cover general nonunital noise, additional persistent qubits, or correlated noise. A visual guide records the reasoning routes, their joint proof premises, and the distinction between inherited tools and the present results.
We determine exact resource limits for a qubit memory with retained classical records. For every qubit noise channel A, the largest output generalized entanglement-breaking robustness under an input budget R_G ≤ r is a semidefinite program in two 4 × 4 positive matrices, attained with at most five classical outcomes. For amplitude damping we solve the full budget curve, including two mixed-state regimes, and attain it with one classical bit. Its contraction coefficient is one, approached with vanishing input resource, although every fixed positive resource budget contracts strictly. A different argument controls memories prepared from a perfect qubit: for prescribed independent noise channels A_1, …, A_n, arbitrary adaptive instruments and finite classical records obey R_G(Γ_n) ≤ R(Γ_n) ≤ ∏_j ν(A_j), where ν(A) = max{0, 2λ_max J_A − 1} and J_A is normalized. The proof propagates a positive 2 × 2 operator over the branches. For amplitude-damping survivals with product b, both robustness optima equal b; the optimal average and worst-case pure-state fidelities are (2+b)/3, the optimal Bell fidelity is (1+b)/2, and the minimum half-diamond error is (1−b)/2. Finite protocols attain all four operational optima simultaneously. Thus classical control can improve fidelity while leaving optimal robustness unchanged. The model permits one persistent qubit and excludes quantum bypass, environment access, and postselection. A visual guide records the reasoning routes, their joint premises, and the distinction between prior tools and the results developed here.
We study the entanglement-breaking lifetime of a qubit subjected repeatedly to one fixed noise channel. Let m_U denote the best lifetime obtained by repeating one unitary control, N_U the lifetime under varying unitary controls, and N the lifetime under arbitrary deterministic qubit channels. We construct a nonempty open set of strictly completely positive channels with m_U = 3 and N_U = N = 4, disproving the stationary-control clause of the Lami–Giovannetti conjecture. A fixed Lindblad generator also produces weak-step channels for which N_U − m_U diverges. Nevertheless, every channel with finite m_U satisfies N_U < 50m_U and N < 128m_U. For such a non-entanglement-breaking channel, write C for its normalized Choi concurrence and δ for its minimum output eigenvalue over pure inputs. The scale T = 1 + log(1 + (1 − C)/δ)/(−log C) satisfies T/50 < m_U ≤ N_U ≤ N ≤ 14T. The proof combines a concurrence estimate for the positive-partial-transpose criterion, a stationary purity alignment, and a partition that charges purifying controls for their concurrence loss. The constants are conservative, and the separation constructions have existential small-parameter ranges. The lifetime comparisons exclude retained ancillas, persistent measurement records and postselection; N = N_U remains open. A visual guide records the reasoning routes and distinguishes inherited premises, numerical leads and proved conclusions.
Abstract The quantum switch is known to remove noise probabilistically, but whether this constitutes an advantage over causally ordered processing has remained contentious: postselection, weak classical benchmarks, and task-dependent comparisons have all drawn criticism. Here we give an exact analysis of the question for a qubit under Pauli noise. For any two qubit Pauli channels, measuring the switch’s control qubit implements a commutation syndrome : it sorts each noise realization by whether the two Kraus errors commuted, syndrome information that an unencoded qubit does not otherwise possess, and the optimal measure-and-feed-forward protocol has a closed form. The analytical results have two levels of generality. For the exactly solvable pair, an isotropic depolarizing channel and a flip channel along an arbitrary axis, we prove a complete ceiling theorem: every definite-order protocol using each channel once, with arbitrary memoryless intermediate operations and receiver-side post-processing, deterministic or heralded, has entanglement fidelity at most ma x P c P , and the switch exceeds this ceiling deterministically , by p q / 3 over most of parameter space. For arbitrary qubit Pauli pairs, the ceiling is proven against arbitrary receiver-side post-processing, and the gain is strictly positive if and only if the two syndrome branches call for different Pauli corrections, confining the exceptions to error-dominated noise. Side systems are covered whenever they are non-signaling about the message. Beyond these theorems the evidence is numerical: strict gain in 99.8 % of 5000 random Pauli pairs, and no case, within a 200 -pair sample, in which an optimized midpoint echo overturns the gain. The state-resolved gain obeys an exact geometric law, Δ F = 2 p q / 3 | r ^ ⋅ n ^ | 2 : alignment is the condition under which the degenerate two-error syndrome becomes perfectly correctable. The separation survives control dephasing down to a threshold visibility that falls with noise strength, and at strong noise it outperforms coherent control of the two orderings even with twice the channel uses.
What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent XXX rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching 1/21/21/2 relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below 1/21/21/2, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's XXX distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.
We consider a class of multi-qubit dephasing models that combine classical noise sources and linear coupling to a bosonic environment, and are controlled by arbitrary sequences of dynamical decoupling pulses. Building on a general transfer filter-function framework for open-loop control, we provide an exact representation of the controlled dynamics for arbitrary stationary non-Gaussian classical and quantum noise statistics, with analytical expressions emerging when all dephasing sources are Gaussian. This exact characterization is used to establish two main results. First, we construct multi-qubit sequences that ensure maximum high-order error suppression in both the time and frequency domain and that can be exponentially more efficient than existing ones in terms of total pulse number. Next, we show how long-time multi-qubit storage may be achieved by meeting appropriate conditions for the emergence of a fidelity plateau under sequence repetition, thereby generalizing recent results for single-qubit memory under Gaussian dephasing. In both scenarios, the key step is to endow multi-qubit sequences with a suitable displacement anti-symmetry property, which is of independent interest for applications ranging from environment-assisted entanglement generation to multi-qubit noise spectroscopy protocols.
How complex can the responses of a quantum device become as it runs longer with a fixed internal memory? We quantify this complexity through sequential response capacity: how many adaptive testing stages, each using a fresh run, can continue to separate possible processes by a prescribed gap in response probabilities. For fixed system and memory sizes, we establish a tight law relating this capacity to run length and probability resolution. At fixed resolution, the capacity grows on the order of Klog⁡KK\log KKlogK, where KKK is the number of time steps in each run. Our construction attains this growth using time-dependent phase rotations on a single visible qubit with no additional internal memory; its tests give response probabilities exactly zero or one. Under the same tests, classical stochastic processes that measure in a fixed basis at every step have only linear capacity at fixed sizes and resolution. For phase sequences selected by a stored classical label, we then quantify how known independent Pauli noise changes this logarithmic enhancement. With ideal controls and weak residual phase noise after correction, we prove matching capacity bounds at a fixed small probability gap. These bounds identify the inverse residual phase-flip probability as the coherence timescale that limits the extra logarithmic growth.