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:2407.02726 · Physical Review A

General communication enhancement via the quantum switch

Zhen Wu, James Fullwood, Zhihao Ma, Si-Qi Zhou, Qi Zhao, Giulio Chiribella

Published Jan 3, 2025• 13 citations
arXivHTMLPDF

Abstract

Recent studies have shown that quantum information may be effectively transmitted by a finite collection of completely depolarizing channels in a coherent superposition of different orders, via an operation known as the quantum $\mathtt{SWITCH}$. Such results are quite remarkable, as completely depolarizing channels taken in isolation and in a definite order can only output white noise. For general channels, however, little is known about the potential communication enhancement provided by the quantum $\mathtt{SWITCH}$. In this work, we define an easily computable quantity ${\mathcal{P}}_{n}$ associated with the quantum $\mathtt{SWITCH}$ of $n$ copies of a fixed channel, and we conjecture that ${\mathcal{P}}_{n}>0$ is both a necessary and sufficient condition for communication enhancement via the quantum $\mathtt{SWITCH}$. In support of our conjecture, we derive a simple analytic expression for the classical capacity of the quantum $\mathtt{SWITCH}$ of $n$ copies of an arbitrary Pauli channel in terms of the quantity ${\mathcal{P}}_{n}$, which we then use to show that our conjecture indeed holds in the space of all Pauli channels. Utilizing such results, we then formulate a communication protocol involving the quantum $\mathtt{SWITCH}$ which enhances the private capacity of the BB84 channel.

DOI
10.1103/physreva.111.012605

Related papers

Communication Enhancement through Quantum Coherent Control of N Channels in an Indefinite Causal-Order Scenario

Lorenzo M. Procopio, Francisco Delgado, Marco Enríquez +2 more

In quantum Shannon theory, transmission of information is enhanced by quantum features. Up to very recently, the trajectories of transmission remained fully classical. Recently, a new paradigm was proposed by playing quantum tricks on two completely depolarizing quantum channels i.e., using coherent control in space or time of the two quantum channels. We extend here this control to the transmission of information through a network of an arbitrary number N of channels with arbitrary individual capacity i.e., information preservation characteristics in the case of indefinite causal order. We propose a formalism to assess information transmission in the most general case of N channels in an indefinite causal order scenario yielding the output of such transmission. Then, we explicitly derive the quantum switch output and the associated Holevo limit of the information transmission for N = 2 , N = 3 as a function of all involved parameters. We find in the case N = 3 that the transmission of information for three channels is twice that of transmission of the two-channel case when a full superposition of all possible causal orders is used.

arXiv:1902.01807•Entropy•Oct 18, 2019•81 citations

Enhanced quantum capacity thresholds from symmetry

Avantika Agarwal, Amolak Ratan Kalra, Sungjai Lee +4 more

The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum capacity of most channels is unknown, with wide gaps between the best upper and lower bounds. Even deciding whether a channel has nonzero capacity -- finding its capacity threshold -- is difficult. In this paper we report significant increases in the capacity thresholds of two prototypical noise models: the depolarizing channel and Pauli channels. In the case of the depolarizing channel, this is the first improvement in 18 years, giving a bigger increase beyond the hashing bound than all previous improvements combined. Our starting point is the representation theoretic framework recently proposed by Bhalerao and Leditzky (2025) to compute coherent information for special permutation invariant states. We generalize their framework to the full symmetric subspace, which allow us to optimize coherent information over rank two states in that space. A representation theoretic calculation shows that exponentially many Kraus operators of the channel annihilate the symmetric space, corresponding to a massive decrease in environment entropy for states on the symmetric space compared to the maximally mixed state. This explains the enhanced coherent information as a manifestation of degeneracy for the resulting codes.

quant-pharXiv:2605.09138•May 12, 2026•5 citations

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

Classical communication with indefinite causal order for N completely depolarizing channels

Sk Sazim, Michal Sedlák, Kratveer Singh +1 more

If two identical copies of a completely depolarizing channel are put into a superposition of their possible causal orders, they can transmit nonzero classical information. Here we study how well we can transmit classical information with $N$ depolarizing channels put in superposition of $M$ causal orders via a quantum switch. We calculate the Holevo quantity if the superposition uses only cyclic permutations of channels and find that it increases with $M$ and it is independent of $N$. For a qubit it never reaches 1 if we are increasing $M$. On the other hand, the classical capacity decreases with the dimension $d$ of the message system. Further, for $N=3$ and 4 we studied the superposition of all causal orders and uniformly superposed causal orders belonging to different cosets created by a cyclic permutation subgroup.

arXiv:2004.14339•Physical Review A•Jun 16, 2021•37 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

A Diagrammatic Approach to Information Transmission in Generalised Switches

Matt Wilson, Giulio Chiribella

The quantum switch is a higher-order operation that takes as an input two quantum processes and combines them in a coherent superposition of two alternative orders. Here we provide an approach to the quantum switch based on the methods of categorical quantum mechanics. Specifically, we represent the quantum switch as a sum of diagrams in the category of finite dimensional Hilbert spaces, or, equivalently, as a sum of diagrams built from Selinger's CPM construction. The sum-of-diagrams picture provides intuition for the activation of classical capacity of completely depolarising channels (CDPCs) and allows for generalisation to N-channel switches. We demonstrate the use of these partially diagrammatic methods by deriving a permutation condition for computing the output of any N-channel switch of CDPCs, we then use that condition to prove that amongst all possible terms, the interference terms associated to cyclic permutations of the N channels are the information-transmitting terms with maximum normalisation

arXiv:2003.08224•Electronic Proceedings in Theoretical Computer Science•Sep 6, 2021•15 citations
Recent studies have shown that quantum information may be effectively transmitted by a finite collection of completely depolarizing channels in a coherent superposition of different orders, via an operation known as the quantum SWITCH\mathtt{SWITCH}SWITCH. Such results are quite remarkable, as completely depolarizing channels taken in isolation and in a definite order can only output white noise. For general channels, however, little is known about the potential communication enhancement provided by the quantum SWITCH\mathtt{SWITCH}SWITCH. In this work, we define an easily computable quantity Pn{\mathcal{P}}_{n}Pn​ associated with the quantum SWITCH\mathtt{SWITCH}SWITCH of nnn copies of a fixed channel, and we conjecture that Pn>0{\mathcal{P}}_{n}>0Pn​>0 is both a necessary and sufficient condition for communication enhancement via the quantum SWITCH\mathtt{SWITCH}SWITCH. In support of our conjecture, we derive a simple analytic expression for the classical capacity of the quantum SWITCH\mathtt{SWITCH}SWITCH of nnn copies of an arbitrary Pauli channel in terms of the quantity Pn{\mathcal{P}}_{n}Pn​, which we then use to show that our conjecture indeed holds in the space of all Pauli channels. Utilizing such results, we then formulate a communication protocol involving the quantum SWITCH\mathtt{SWITCH}SWITCH which enhances the private capacity of the BB84 channel.
In quantum Shannon theory, transmission of information is enhanced by quantum features. Up to very recently, the trajectories of transmission remained fully classical. Recently, a new paradigm was proposed by playing quantum tricks on two completely depolarizing quantum channels i.e., using coherent control in space or time of the two quantum channels. We extend here this control to the transmission of information through a network of an arbitrary number N of channels with arbitrary individual capacity i.e., information preservation characteristics in the case of indefinite causal order. We propose a formalism to assess information transmission in the most general case of N channels in an indefinite causal order scenario yielding the output of such transmission. Then, we explicitly derive the quantum switch output and the associated Holevo limit of the information transmission for N = 2 , N = 3 as a function of all involved parameters. We find in the case N = 3 that the transmission of information for three channels is twice that of transmission of the two-channel case when a full superposition of all possible causal orders is used.
The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum capacity of most channels is unknown, with wide gaps between the best upper and lower bounds. Even deciding whether a channel has nonzero capacity -- finding its capacity threshold -- is difficult. In this paper we report significant increases in the capacity thresholds of two prototypical noise models: the depolarizing channel and Pauli channels. In the case of the depolarizing channel, this is the first improvement in 18 years, giving a bigger increase beyond the hashing bound than all previous improvements combined. Our starting point is the representation theoretic framework recently proposed by Bhalerao and Leditzky (2025) to compute coherent information for special permutation invariant states. We generalize their framework to the full symmetric subspace, which allow us to optimize coherent information over rank two states in that space. A representation theoretic calculation shows that exponentially many Kraus operators of the channel annihilate the symmetric space, corresponding to a massive decrease in environment entropy for states on the symmetric space compared to the maximally mixed state. This explains the enhanced coherent information as a manifestation of degeneracy for the resulting codes.
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.
If two identical copies of a completely depolarizing channel are put into a superposition of their possible causal orders, they can transmit nonzero classical information. Here we study how well we can transmit classical information with NNN depolarizing channels put in superposition of MMM causal orders via a quantum switch. We calculate the Holevo quantity if the superposition uses only cyclic permutations of channels and find that it increases with MMM and it is independent of NNN. For a qubit it never reaches 1 if we are increasing MMM. On the other hand, the classical capacity decreases with the dimension ddd of the message system. Further, for N=3N=3N=3 and 4 we studied the superposition of all causal orders and uniformly superposed causal orders belonging to different cosets created by a cyclic permutation subgroup.
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.
The quantum switch is a higher-order operation that takes as an input two quantum processes and combines them in a coherent superposition of two alternative orders. Here we provide an approach to the quantum switch based on the methods of categorical quantum mechanics. Specifically, we represent the quantum switch as a sum of diagrams in the category of finite dimensional Hilbert spaces, or, equivalently, as a sum of diagrams built from Selinger's CPM construction. The sum-of-diagrams picture provides intuition for the activation of classical capacity of completely depolarising channels (CDPCs) and allows for generalisation to N-channel switches. We demonstrate the use of these partially diagrammatic methods by deriving a permutation condition for computing the output of any N-channel switch of CDPCs, we then use that condition to prove that amongst all possible terms, the interference terms associated to cyclic permutations of the N channels are the information-transmitting terms with maximum normalisation