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

Quantum Information Processing

Optimal qubit-bases for preserving two-qubit entanglement against Pauli noises

Huimin Zhang, Xin-Wen Wang, Shi-Qing Tang, Ya‐Ju Song

Published Oct 1, 2020• 7 citations
Publisher
DOI
10.1007/s11128-020-02889-x

Related papers

Two qubit entanglement preservation through the addition of qubits

M. Flores, Eric A. Galapon

Annals of Physics•Nov 25, 2014•23 citations

Port-based entanglement teleportation via noisy resource states

Ha Eum Kim, Kabgyun Jeong

Abstract Port-based teleportation (PBT) represents a variation of the standard quantum teleportation and is currently being employed and explored within the field of quantum information processing owing to its various applications. In this study, we focus on PBT protocol when the resource state is disrupted by local Pauli noises. Here, we fully characterise the channel of the noisy PBT protocol using Krauss representation. Especially, by exploiting the application of PBT for entanglement distribution necessary in realizing quantum networks, we investigate entanglement transmission through this protocol for each qubit considering noisy resource states, denoted as port-based entanglement teleportation (PBET). Finally, we derive upper and lower bounds for the teleported entanglement as a function of the initial entanglement and the noises. Our study demonstrates that quantum entanglement can be efficiently distributed by protocols utilizing large-sized resource states in the presence of noise and is expected to serve as a reliable guide for developing optimized PBET protocols. To obtain these results, we address that the order of entanglement of two qubit states is preserved through the local Pauli channel, and identify the boundaries of entanglement loss through this teleportation channel.

arXiv:2309.01550•Physica Scripta•Jan 25, 2024•4 citations

The lower bound to the concurrence for four-qubit W state under noisy channels

Pakhshan Espoukeh, Pouria Pedram

We study the dynamics of four-qubit W state under various noisy environments by solving analytically the master equation in the Lindblad form in which the Lindblad operators correspond to the Pauli matrices and describe the decoherence of states. Also, we investigate the dynamics of the entanglement using the lower bound to the concurrence. It is found that while the entanglement decreases monotonically for Pauli-Z noise, it decays suddenly for other three noises. Moreover, by studying the time evolution of entanglement of various maximally entangled four-qubit states, we indicate that the four-qubit W state is more robust under same-axis Pauli channels. Furthermore, three-qubit W state preserves more entanglement with respect to the four-qubit W state, except for the Pauli-Z noise.

arXiv:1501.01104•International Journal of Quantum Information•Feb 1, 2015•4 citations

Optimal entanglement manipulation for an arbitrary state of two qubits

Li-Xiang Cen, Fuli Li, Shi‐Yao Zhu

Physics Letters A•Oct 1, 2000•4 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

Quantum Key Distribution Without Shared Reference Frame Under Unital Noise

Junaid ur Rehman, Shehbaz Tariq, Symeon Chatzinotas

We consider a general and practical scenario of quantum key distribution (QKD) over an unknown, stationary, unital qubit channel. Furthermore, due to practical limitations, e.g., relative movement and rotation of communicating parties, a global shared reference frame cannot be established. This scenario can routinely appear in satellite QKD. We propose two methods to overcome the physical qubit noise and the lack of shared reference frame. The first proposed approach involves constructing the Pauli transfer matrix (PTM) description of the channel, which we achieve without requiring a shared reference frame, by absorbing the lack of shared reference frame in the channel definition. This is followed by the identification of singular vectors of PTM as the Bloch vectors for optimal signal states. In the optimized local bases, the resulting correlations are equivalent, up to outcome relabeling, to those of a Pauli channel, allowing us to show the optimality of the BB84 and six-state QKD protocols under these conditions. The second approach, called the sequential basis matching (SBM) involves sequentially identifying the channel-optimized local bases that enable QKD. We show that both of these approaches result in the same effective key exchange rate for QKD.

quant-pharXiv:2606.23239•Jun 23, 2026•0 citations
Abstract Port-based teleportation (PBT) represents a variation of the standard quantum teleportation and is currently being employed and explored within the field of quantum information processing owing to its various applications. In this study, we focus on PBT protocol when the resource state is disrupted by local Pauli noises. Here, we fully characterise the channel of the noisy PBT protocol using Krauss representation. Especially, by exploiting the application of PBT for entanglement distribution necessary in realizing quantum networks, we investigate entanglement transmission through this protocol for each qubit considering noisy resource states, denoted as port-based entanglement teleportation (PBET). Finally, we derive upper and lower bounds for the teleported entanglement as a function of the initial entanglement and the noises. Our study demonstrates that quantum entanglement can be efficiently distributed by protocols utilizing large-sized resource states in the presence of noise and is expected to serve as a reliable guide for developing optimized PBET protocols. To obtain these results, we address that the order of entanglement of two qubit states is preserved through the local Pauli channel, and identify the boundaries of entanglement loss through this teleportation channel.
We study the dynamics of four-qubit W state under various noisy environments by solving analytically the master equation in the Lindblad form in which the Lindblad operators correspond to the Pauli matrices and describe the decoherence of states. Also, we investigate the dynamics of the entanglement using the lower bound to the concurrence. It is found that while the entanglement decreases monotonically for Pauli-Z noise, it decays suddenly for other three noises. Moreover, by studying the time evolution of entanglement of various maximally entangled four-qubit states, we indicate that the four-qubit W state is more robust under same-axis Pauli channels. Furthermore, three-qubit W state preserves more entanglement with respect to the four-qubit W state, except for the Pauli-Z noise.
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.
We consider a general and practical scenario of quantum key distribution (QKD) over an unknown, stationary, unital qubit channel. Furthermore, due to practical limitations, e.g., relative movement and rotation of communicating parties, a global shared reference frame cannot be established. This scenario can routinely appear in satellite QKD. We propose two methods to overcome the physical qubit noise and the lack of shared reference frame. The first proposed approach involves constructing the Pauli transfer matrix (PTM) description of the channel, which we achieve without requiring a shared reference frame, by absorbing the lack of shared reference frame in the channel definition. This is followed by the identification of singular vectors of PTM as the Bloch vectors for optimal signal states. In the optimized local bases, the resulting correlations are equivalent, up to outcome relabeling, to those of a Pauli channel, allowing us to show the optimality of the BB84 and six-state QKD protocols under these conditions. The second approach, called the sequential basis matching (SBM) involves sequentially identifying the channel-optimized local bases that enable QKD. We show that both of these approaches result in the same effective key exchange rate for QKD.