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

Physica Scripta

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, Kaixin Tan, Chengtao Zhou, Zhangkai Jason Cheng

Published Sep 7, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1088/1402-4896/aea388

Related papers

Different is more: quantum switch assisted superdense coding in typical Pauli channels

Yan‐Ling Li, Zichen Mu, Xing Mao Xiao

Abstract Superdense coding is a fundamental protocol in quantum information theory that facilitates the transmission of classical information at capacities exceeding classical limits by exploiting quantum entanglement. However, the presence of noise in communication channels, particularly in the case of Pauli channels, poses a significant challenge to the efficiency of superdense coding. In this paper, we explore an active protocol designed for scenarios involving two distinct, addressable noisy channels. We investigate how a quantum switch, by actively composing these two channels in an indefinite causal order, can construct a new composite channel with significantly enhanced capacity. Our findings indicate that, when confronted with the same type of Pauli channels which are commutative, the quantum switch offers no advantage over classical strategies constrained by definite causal order. Remarkably, when two different channels are composed, the quantum switch can exploit the non-commutativity of their underlying operators to coherently cancel their noise effects. This vividly illustrates the ‘different is more’ principle: using the quantum switch to actively compose two different non-commuting channels yields a significant capacity gain over composing two identical commutative channels. This underscores the potential of the quantum switch as a tool for active noise-aware protocol design, where the difference itself is a resource, rather than as a tool for passive noise mitigation.

Physica Scripta•Nov 20, 2025•1 citation

Entanglement certification via causal-order interferometry in a quantum switch

Haojie Wang, Shuheng Liu, Qiongyi He

Entanglement certification is often performed on states that have already undergone noisy transmission or processing. Noise can reduce the surviving entanglement and can also cause a given criterion to fail even when entanglement remains. In this context, the quantum switch, a paradigmatic realization of indefinite causal order (ICO), coherently controls the orders in which two channels act and has been shown to offer advantages across a range of quantum information-processing tasks. Here we ask whether this coherent control enlarges the noise-parameter region in which entanglement remains certifiable. We regard the two order branches as the arms of a causal-order interferometer and insert a local unitary between the channel uses to tune their interference. For stochastic Pauli noise, a postselected ICO output can exhibit greater entanglement negativity than any classical mixture of the two definite orders; in particular, we identify regimes where its negativity remains nonzero while that of every classical mixture vanishes. A suitable local Pauli unitary substantially enlarges this ICO-only region, while an input-dependent path-difference indicator qualitatively links operator noncommutativity to the postselected negativity gain. Numerical examples extend the advantage to local amplitude-damping noise and two-qutrit Weyl noise. At a representative Weyl-noise point for the $3\times 3$ positive-partial-transpose (PPT) Tiles bound-entangled state, a nondecomposable witness detects the postselected ICO output, whereas an analytic bound excludes detection of the definite-order outputs and their mixtures by the entire locally rotated witness family. These results identify causal-order interferometry as a strategy for enhancing entanglement certification across distinct noise models and dimensions.

quant-pharXiv:2608.14110•Aug 17, 2026•1 citation

Commutator Geometry and Information Preservation in the Quantum Switch

Xu Chen, Xue Ma

Two commuting channels yield the same composite channel in either fixed order, yet their quantum switch can alter information preservation. We study how this effect depends on the input state, retaining the joint output of the control and target. Exact Kraus commutator identities determine overlap and squared fidelity gaps. Fixed order preserves product inputs at least as well as the switch in fidelity. The reverse inequality holds for pure states of two qubits whose control Schmidt basis can be chosen to coincide with the order basis. A commutator matrix determines the target basis that maximizes the squared fidelity gap at fixed entanglement within this aligned family. For Pauli $X$ and $Y$ channels with equal error probabilities, the switch replaces a logical phase flip with an operator that stabilizes a joint code. At fixed noise, the switch preserves at least as much distinguishability and quantum Fisher information as fixed order for every state family in this code. For the pure encoded family studied here, exact formulas connect the phase information gain to the squared fidelity gap and quantify the reduction in information about the noise probability. Optimizing the probes yields equal maximal quantum Fisher information for noise estimation under both joint channels. These results connect commutator geometry and logical error structure to state preservation and the retention of encoded information.

quant-pharXiv:2609.21310•Sep 21, 2026•0 citations

Infinite or indefinite: the query cost of simulating the quantum switch

Dantong Li

The quantum switch applies two operations in a coherent superposition of their causal orders and is a simple example of indefinite causal order. No quantum circuit that uses each operation once in a definite order can even describe it, yet photonic experiments have demonstrated its physical realization. We ask how many calls to the black-box operations a quantum computer in the circuit model needs to reproduce the switch. If one of the black boxes is known to be unitary, three calls suffice. For general channels on a $d$-dimensional system, we prove three results. In all three, circuits may use classical feed-forward and unlimited ancillary quantum memory. First, no finite number of calls suffices for exact simulation in the worst case. Second, approximation to any fixed error below $1/2$, measured in half the diamond norm, requires $Ω(d^{1/4})$ calls, exponential in the number of qubits. Third, an ordinary circuit can require exponentially many calls to obtain a single bit that the switch extracts with a few uses. We consider a device whose actual noise is dephasing in a fixed unknown basis and test it against a theoretical depolarizing model. The two channels have the same entanglement and average gate fidelities, so these figures alone do not distinguish them. At fixed noise strength, the quantum switch tells them apart with a number of device uses independent of $d$, whereas the circuit model requires $Ω(d^{1/16})$ calls. Noise characterization is needed for quantum error correction, and this gives a provable query advantage of the switch in a task relevant to practical quantum computing. We invite future work that extends such advantages to more practical computing tasks.

arXiv:2611.16229•Nov 12, 2026•0 citations

Exact Finite-Time Limits of Controlled Qubit Memories

Ying Xie

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.

•Nov 11, 2026•0 citations

Commutator identities for the quantum switch of commuting channels: arbitrary inputs and exact fidelity gaps

Mitsutoshi Yamada

For the quantum switch of two commuting channels, we extend the commutator identities of Chen and Ma (arXiv:2609.21310). For arbitrary inputs, the difference between the switch and fixed-order outputs is a single off-diagonal operator built from Kraus commutators; it gives the overlap gap, trace distance and purity change exactly, and contains Eq. (11), Theorem 2 and Proposition 4 of that paper as special cases. For a pure control, Theorem 1 of that paper becomes quantitative, and for inputs of rank at most two the root-fidelity gap is exact. We also give bounds for mixed controls, a criterion for mixed aligned states, and a qubit counterexample. A seeded Python reproduction package is included. This is a working note and has not been peer reviewed.

•Oct 15, 2026•0 citations
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.
Abstract Superdense coding is a fundamental protocol in quantum information theory that facilitates the transmission of classical information at capacities exceeding classical limits by exploiting quantum entanglement. However, the presence of noise in communication channels, particularly in the case of Pauli channels, poses a significant challenge to the efficiency of superdense coding. In this paper, we explore an active protocol designed for scenarios involving two distinct, addressable noisy channels. We investigate how a quantum switch, by actively composing these two channels in an indefinite causal order, can construct a new composite channel with significantly enhanced capacity. Our findings indicate that, when confronted with the same type of Pauli channels which are commutative, the quantum switch offers no advantage over classical strategies constrained by definite causal order. Remarkably, when two different channels are composed, the quantum switch can exploit the non-commutativity of their underlying operators to coherently cancel their noise effects. This vividly illustrates the ‘different is more’ principle: using the quantum switch to actively compose two different non-commuting channels yields a significant capacity gain over composing two identical commutative channels. This underscores the potential of the quantum switch as a tool for active noise-aware protocol design, where the difference itself is a resource, rather than as a tool for passive noise mitigation.
Entanglement certification is often performed on states that have already undergone noisy transmission or processing. Noise can reduce the surviving entanglement and can also cause a given criterion to fail even when entanglement remains. In this context, the quantum switch, a paradigmatic realization of indefinite causal order (ICO), coherently controls the orders in which two channels act and has been shown to offer advantages across a range of quantum information-processing tasks. Here we ask whether this coherent control enlarges the noise-parameter region in which entanglement remains certifiable. We regard the two order branches as the arms of a causal-order interferometer and insert a local unitary between the channel uses to tune their interference. For stochastic Pauli noise, a postselected ICO output can exhibit greater entanglement negativity than any classical mixture of the two definite orders; in particular, we identify regimes where its negativity remains nonzero while that of every classical mixture vanishes. A suitable local Pauli unitary substantially enlarges this ICO-only region, while an input-dependent path-difference indicator qualitatively links operator noncommutativity to the postselected negativity gain. Numerical examples extend the advantage to local amplitude-damping noise and two-qutrit Weyl noise. At a representative Weyl-noise point for the 3×33\times 33×3 positive-partial-transpose (PPT) Tiles bound-entangled state, a nondecomposable witness detects the postselected ICO output, whereas an analytic bound excludes detection of the definite-order outputs and their mixtures by the entire locally rotated witness family. These results identify causal-order interferometry as a strategy for enhancing entanglement certification across distinct noise models and dimensions.
Two commuting channels yield the same composite channel in either fixed order, yet their quantum switch can alter information preservation. We study how this effect depends on the input state, retaining the joint output of the control and target. Exact Kraus commutator identities determine overlap and squared fidelity gaps. Fixed order preserves product inputs at least as well as the switch in fidelity. The reverse inequality holds for pure states of two qubits whose control Schmidt basis can be chosen to coincide with the order basis. A commutator matrix determines the target basis that maximizes the squared fidelity gap at fixed entanglement within this aligned family. For Pauli XXX and YYY channels with equal error probabilities, the switch replaces a logical phase flip with an operator that stabilizes a joint code. At fixed noise, the switch preserves at least as much distinguishability and quantum Fisher information as fixed order for every state family in this code. For the pure encoded family studied here, exact formulas connect the phase information gain to the squared fidelity gap and quantify the reduction in information about the noise probability. Optimizing the probes yields equal maximal quantum Fisher information for noise estimation under both joint channels. These results connect commutator geometry and logical error structure to state preservation and the retention of encoded information.
The quantum switch applies two operations in a coherent superposition of their causal orders and is a simple example of indefinite causal order. No quantum circuit that uses each operation once in a definite order can even describe it, yet photonic experiments have demonstrated its physical realization. We ask how many calls to the black-box operations a quantum computer in the circuit model needs to reproduce the switch. If one of the black boxes is known to be unitary, three calls suffice. For general channels on a ddd-dimensional system, we prove three results. In all three, circuits may use classical feed-forward and unlimited ancillary quantum memory. First, no finite number of calls suffices for exact simulation in the worst case. Second, approximation to any fixed error below 1/21/21/2, measured in half the diamond norm, requires Ω(d1/4)Ω(d^{1/4})Ω(d1/4) calls, exponential in the number of qubits. Third, an ordinary circuit can require exponentially many calls to obtain a single bit that the switch extracts with a few uses. We consider a device whose actual noise is dephasing in a fixed unknown basis and test it against a theoretical depolarizing model. The two channels have the same entanglement and average gate fidelities, so these figures alone do not distinguish them. At fixed noise strength, the quantum switch tells them apart with a number of device uses independent of ddd, whereas the circuit model requires Ω(d1/16)Ω(d^{1/16})Ω(d1/16) calls. Noise characterization is needed for quantum error correction, and this gives a provable query advantage of the switch in a task relevant to practical quantum computing. We invite future work that extends such advantages to more practical computing tasks.
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.
For the quantum switch of two commuting channels, we extend the commutator identities of Chen and Ma (arXiv:2609.21310). For arbitrary inputs, the difference between the switch and fixed-order outputs is a single off-diagonal operator built from Kraus commutators; it gives the overlap gap, trace distance and purity change exactly, and contains Eq. (11), Theorem 2 and Proposition 4 of that paper as special cases. For a pure control, Theorem 1 of that paper becomes quantitative, and for inputs of rank at most two the root-fidelity gap is exact. We also give bounds for mixed controls, a criterion for mixed aligned states, and a qubit counterexample. A seeded Python reproduction package is included. This is a working note and has not been peer reviewed.