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

IEEJ Transactions on Electronics Information and Systems

Purification of the Quasi-Bell State from (3, 1) Quantum Error Correcting Code

Hiroyuki Nanjo, Tsuyoshi Sasaki Usuda, Ichi Takumi

Published Jan 1, 2008• 1 citation
Publisher

Abstract

An entanglement purification of a quasi-Bell state from (3, 1) quantum error correcting code is considered. It is shown that the fidelity between a quasi-Bell state decohered by a bit-flip channel and an ideal quasi-Bell state is improved by the purification for wide range of the bit-flip probability of the channel.
DOI
10.1541/ieejeiss.128.1741

Related papers

Modified entanglement purification scheme with doubly entangled photon state

Chuan Xi Wang, Yu‐Bo Sheng, Xihan Li +3 more

Recently Xiao et al. proposed a scheme for entanglement purification based on doubly entangled photon states (Phys. Rev. A 77(2008) 042315). We modify their scheme for improving the efficiency of entanglement purification. This modified scheme contains two steps, i.e., the bit-flip error correction and the entanglement purification of phase-flip errors. All the photon pairs in the first step can be kept as all the bit-flip errors are corrected. For purifying the phase-flip errors, a wavelength conversion process is needed. This scheme has the advantage of high efficiency and it requires the original fidelity of the entangled state wanted fay lower than other schemes, which makes it more feasible in a practical application.

arXiv:0810.2011•Oct 11, 2008•0 citations

Mixed-state entanglement and quantum error correction

Charles H. Bennett, David Peter Divincenzo, John A. Smolin +1 more

Entanglement purification protocols (EPPs) and quantum error-correcting codes (QECCs) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectly entangled pure states are extracted, with some yield D, from a mixed state M shared by two parties; with a QECC, an arbitrary quantum state |\ensuremath{\xi}〉 can be transmitted at some rate Q through a noisy channel \ensuremath{\chi} without degradation. We prove that an EPP involving one-way classical communication and acting on mixed state M^(\ensuremath{\chi}) (obtained by sharing halves of Einstein-Podolsky-Rosen pairs through a channel \ensuremath{\chi}) yields a QECC on \ensuremath{\chi} with rate Q=D, and vice versa. We compare the amount of entanglement E(M) required to prepare a mixed state M by local actions with the amounts ${\mathit{D}}_{1}$(M) and ${\mathit{D}}_{2}$(M) that can be locally distilled from it by EPPs using one- and two-way classical communication, respectively, and give an exact expression for E(M) when M is Bell diagonal. While EPPs require classical communication, QECCs do not, and we prove Q is not increased by adding one-way classical communication. However, both D and Q can be increased by adding two-way communication. We show that certain noisy quantum channels, for example a 50% depolarizing channel, can be used for reliable transmission of quantum states if two-way communication is available, but cannot be used if only one-way communication is available. We exhibit a family of codes based on universal hashing able to achieve an asymptotic Q (or D) of 1-S for simple noise models, where S is the error entropy. We also obtain a specific, simple 5-bit single-error-correcting quantum block code. We prove that iff a QECC results in high fidelity for the case of no error then the QECC can be recast into a form where the encoder is the matrix inverse of the decoder. \textcopyright{} 1996 The American Physical Society.

arXiv:quant-ph/9604024•Physical Review A•Nov 1, 1996•5,272 citations

Purification of Logic-Qubit Entanglement

Lan Zhou, Yu‐Bo Sheng

Recently, the logic-qubit entanglement shows its potential application in future quantum communication and quantum network. However, the entanglement will suffer from the noise and decoherence. In this paper, we will investigate the first entanglement purification protocol for logic-qubit entanglement. We show that both the bit-flip error and phase-flip error in logic-qubit entanglement can be well purified. Moreover, the bit-flip error in physical-qubit entanglement can be completely corrected. The phase-flip in physical-qubit entanglement error equals to the bit-flip error in logic-qubit entanglement, which can also be purified. This entanglement purification protocol may provide some potential applications in future quantum communication and quantum network.

arXiv:1511.02344•Scientific Reports•Jul 5, 2016•73 citations

A Tailored Fidelity Estimation and Purification Method for Entangled Quantum Networks

Takafumi Oka, Michal Hajdušek, Shota Nagayama +1 more

We present a method to conduct both quantum state reconstruction and entanglement purification simultaneously that is advantageous in several respects over previous work in this direction, showing that the number of Bell pairs necessary to boot a quantum network can be significantly reduced compared to an existing method. The existing method requires at least $10^5$ Bell pairs for the state reconstruction phase to estimate that the state is of fidelity $0.99$ within the error range of $10^{-2}$, whereas our approach only requires around $2,841$ to be certain with $99.7\%$ of confidence that the estimated fidelity lies within $[0.99-0.01, 0.99+0.01]$. In addition, in our approach we can start with a lower fidelity Bell pair and purify it multiple times, estimating at the same time the resultant fidelity with guarantee of $99.7\%$ that the fidelity estimate lies within a certain range. Moreover, the existing method cannot correct both bit-flip and phase-flip errors at the same time and can only correct one of these, whereas our approach can correct both bit-flip and phase-flip errors simultaneously. This research produces numerical estimates for the number of Bell pairs actually needed to guarantee a certain threshold fidelity $F$. The research can support the functioning real-world quantum networking by providing the information of the time needed for the bootstrapping of a quantum network to finish.

quant-pharXiv:2602.18011•Feb 23, 2026•0 citations

Quantum error correction via purification using a single auxiliary

Chandrima B. Pushpan, Tanoy Kanti Konar, Aditi Sen De +1 more

We propose a single auxiliary-assisted purification-based framework for quantum error correction, capable of correcting errors that drive a system from its ground-state subspace into excited-state sectors. The protocol consists of a joint time evolution of the system-auxiliary duo under a specially engineered interaction Hamiltonian, followed by a single measurement of the auxiliary in its energy eigenbasis and a subsequent post-selection of one of the measurement outcomes. We show that the resulting purified state always achieves unit fidelity, while the probability of obtaining any energy of the auxiliary other than its ground state energy yields the success rate of the protocol. We demonstrate the power of this proposed method for several low-distance quantum codes, including the three-, four-, and five-qubit codes, and for the one-dimensional isotropic Heisenberg model, subjected to bit-flip, phase-flip, and amplitude-damping noises acting on all qubits. Notably, the protocol expands the class of correctable errors for a given code, particularly in the presence of amplitude-damping noise. We further analyze the impact of replacing the auxiliary qudit with a single auxiliary qubit, and the changes in the performance of the protocol under the realistic scenario where noise remains active during the correction cycle.

quant-pharXiv:2512.09745•Dec 11, 2025•0 citations

Quantum Error Correcting Codes and Correlated Noise Errors

Carlo Cafaro, Stefano Mancini

We study the performance of simple quantum error correcting codes with respect to correlated noise errors characterized by a finite correlation strength. Specifically, we consider bit flip (phase flip) noisy quantum memory channels and use repetition and noiseless quantum codes. We characterize the performance of the codes by means of the entanglement fidelity as function of the error probability and degree of memory. Finally, comparing the entanglement fidelities of repetition and noiseless quantum codes, we find a threshold for the correlation strength that allows to select the code with better performance.

•Jun 20, 2009•1 citation
Recently Xiao et al. proposed a scheme for entanglement purification based on doubly entangled photon states (Phys. Rev. A 77(2008) 042315). We modify their scheme for improving the efficiency of entanglement purification. This modified scheme contains two steps, i.e., the bit-flip error correction and the entanglement purification of phase-flip errors. All the photon pairs in the first step can be kept as all the bit-flip errors are corrected. For purifying the phase-flip errors, a wavelength conversion process is needed. This scheme has the advantage of high efficiency and it requires the original fidelity of the entangled state wanted fay lower than other schemes, which makes it more feasible in a practical application.
Entanglement purification protocols (EPPs) and quantum error-correcting codes (QECCs) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectly entangled pure states are extracted, with some yield D, from a mixed state M shared by two parties; with a QECC, an arbitrary quantum state |\ensuremath{\xi}〉 can be transmitted at some rate Q through a noisy channel \ensuremath{\chi} without degradation. We prove that an EPP involving one-way classical communication and acting on mixed state M^(\ensuremath{\chi}) (obtained by sharing halves of Einstein-Podolsky-Rosen pairs through a channel \ensuremath{\chi}) yields a QECC on \ensuremath{\chi} with rate Q=D, and vice versa. We compare the amount of entanglement E(M) required to prepare a mixed state M by local actions with the amounts D1{\mathit{D}}_{1}D1​(M) and D2{\mathit{D}}_{2}D2​(M) that can be locally distilled from it by EPPs using one- and two-way classical communication, respectively, and give an exact expression for E(M) when M is Bell diagonal. While EPPs require classical communication, QECCs do not, and we prove Q is not increased by adding one-way classical communication. However, both D and Q can be increased by adding two-way communication. We show that certain noisy quantum channels, for example a 50% depolarizing channel, can be used for reliable transmission of quantum states if two-way communication is available, but cannot be used if only one-way communication is available. We exhibit a family of codes based on universal hashing able to achieve an asymptotic Q (or D) of 1-S for simple noise models, where S is the error entropy. We also obtain a specific, simple 5-bit single-error-correcting quantum block code. We prove that iff a QECC results in high fidelity for the case of no error then the QECC can be recast into a form where the encoder is the matrix inverse of the decoder. \textcopyright{} 1996 The American Physical Society.
Recently, the logic-qubit entanglement shows its potential application in future quantum communication and quantum network. However, the entanglement will suffer from the noise and decoherence. In this paper, we will investigate the first entanglement purification protocol for logic-qubit entanglement. We show that both the bit-flip error and phase-flip error in logic-qubit entanglement can be well purified. Moreover, the bit-flip error in physical-qubit entanglement can be completely corrected. The phase-flip in physical-qubit entanglement error equals to the bit-flip error in logic-qubit entanglement, which can also be purified. This entanglement purification protocol may provide some potential applications in future quantum communication and quantum network.
We present a method to conduct both quantum state reconstruction and entanglement purification simultaneously that is advantageous in several respects over previous work in this direction, showing that the number of Bell pairs necessary to boot a quantum network can be significantly reduced compared to an existing method. The existing method requires at least 10510^5105 Bell pairs for the state reconstruction phase to estimate that the state is of fidelity 0.990.990.99 within the error range of 10−210^{-2}10−2, whereas our approach only requires around 2,8412,8412,841 to be certain with 99.7%99.7\%99.7% of confidence that the estimated fidelity lies within [0.99−0.01,0.99+0.01][0.99-0.01, 0.99+0.01][0.99−0.01,0.99+0.01]. In addition, in our approach we can start with a lower fidelity Bell pair and purify it multiple times, estimating at the same time the resultant fidelity with guarantee of 99.7%99.7\%99.7% that the fidelity estimate lies within a certain range. Moreover, the existing method cannot correct both bit-flip and phase-flip errors at the same time and can only correct one of these, whereas our approach can correct both bit-flip and phase-flip errors simultaneously. This research produces numerical estimates for the number of Bell pairs actually needed to guarantee a certain threshold fidelity FFF. The research can support the functioning real-world quantum networking by providing the information of the time needed for the bootstrapping of a quantum network to finish.
We propose a single auxiliary-assisted purification-based framework for quantum error correction, capable of correcting errors that drive a system from its ground-state subspace into excited-state sectors. The protocol consists of a joint time evolution of the system-auxiliary duo under a specially engineered interaction Hamiltonian, followed by a single measurement of the auxiliary in its energy eigenbasis and a subsequent post-selection of one of the measurement outcomes. We show that the resulting purified state always achieves unit fidelity, while the probability of obtaining any energy of the auxiliary other than its ground state energy yields the success rate of the protocol. We demonstrate the power of this proposed method for several low-distance quantum codes, including the three-, four-, and five-qubit codes, and for the one-dimensional isotropic Heisenberg model, subjected to bit-flip, phase-flip, and amplitude-damping noises acting on all qubits. Notably, the protocol expands the class of correctable errors for a given code, particularly in the presence of amplitude-damping noise. We further analyze the impact of replacing the auxiliary qudit with a single auxiliary qubit, and the changes in the performance of the protocol under the realistic scenario where noise remains active during the correction cycle.
We study the performance of simple quantum error correcting codes with respect to correlated noise errors characterized by a finite correlation strength. Specifically, we consider bit flip (phase flip) noisy quantum memory channels and use repetition and noiseless quantum codes. We characterize the performance of the codes by means of the entanglement fidelity as function of the error probability and degree of memory. Finally, comparing the entanglement fidelities of repetition and noiseless quantum codes, we find a threshold for the correlation strength that allows to select the code with better performance.