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

Efficient purification protocols using iSWAP gates in solid-state qubits

Tetsufumi Tanamoto, Koji Maruyama, Yu-xi Liu, Xuedong Hu, Franco Nori

Published Dec 5, 2008• 30 citations
arXivHTMLPDF

Abstract

We show an efficient purification protocol in solid-state qubits by replacing the usual bilateral controlled-NOT gate by the bilateral $\mathrm{iSWAP}$ gate. We also show that this replacement can be applied to breeding and hashing protocols, which are useful for quantum state purification. These replacements reduce the number of fragile and cumbersome two-qubit operations, making more feasible quantum-information processing with solid-state qubits. As examples, we also present quantitative analyses for the required time to perform state purification using either superconducting or semiconducting qubits.

DOI
10.1103/physreva.78.062313

Related papers

Efficient quantum circuit for implementing discrete quantum Fourier transform in solid-state qubits

Hong‐Fu Wang, Xinxin Jiang, Shou Zhang +1 more

Based on the iSWAP gate generated from the XY interaction between solid-state qubits, we present an efficient quantum circuit for the implementation of discrete quantum Fourier transform. The relatively cumbersome and expensive controlled- R k gate and SWAP gate operations required for implementing discrete quantum Fourier transform in the naive quantum circuit are replaced only by iSWAP gate operation. The scheme can be realized using any physical system with XY interaction and it would be a useful step towards the implementation of more complex quantum computation in solid-state qubits.

Journal of Physics B Atomic Molecular and Optical Physics•May 17, 2011•11 citations

Entanglement purification with the exchange interaction

Adrian Auer, Guido Burkard

Entanglement purification allows the creation of qubit pairs of arbitrarily high fidelity with respect to a maximally entangled state, starting from a larger number of low-fidelity pairs. Purification requires quantum memory, a role for which electron spins are well suited. However, using existing recurrence protocols involving symmetric local two-qubit operations for spin qubits turns out to be rather unpractical. We present an efficient purification protocol requiring only a single pulsed Heisenberg- or XY-type exchange interaction between two qubit pairs. In contrast to known protocols, we allow for asymmetric bilateral two-qubit operations where the two communication parties operate differently on their qubits. In the optimal version of our protocol, the local two-qubit interactions in the case of Heisenberg exchange correspond to the $\sqrt{swap}$ gate and its inverse.

arXiv:1401.5670•Physical Review A•Aug 20, 2014•2 citations

Entanglement purification by counting and locating errors with entangling measurements

Ferran Riera-Sàbat, Pavel Sekatski, Alexander Pirker +1 more

We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about the number and positions of errors in the noisy ensemble in an explicit and controlled way, thereby reducing the amount of noise in the ensemble and purifying the remaining states. This allows us to design entanglement purification protocols for any number of copies that work particularly well for a small number of expected errors, i.e., high fidelity of initial states. The main tool is a counter gate with which the required nonlocal information can be transferred into the high-dimensional entangled qudit auxiliary states. We compare our schemes to standard recurrence protocols that operate on pairs of copies, and hashing and breeding protocols that operate on a (asymptotically) large number of copies. Our protocols interpolate between these two regimes, leading to higher achievable fidelity and yield. We illustrate our approach for bipartite qubit states and generalize it to purify multiparty GHZ states.

arXiv:2011.07084•Physical Review A•Jul 21, 2021•29 citations

Robustness of hashing protocols for entanglement purification

Michael J. Zwerger, Hans J. Briegel, Wolfgang Dür

We investigate entanglement purification protocols based on hashing, where a large number of noisy entangled pairs are jointly processed to obtain a reduced number of perfect, noiseless copies. While hashing and breeding protocols are the only purification protocols that asymptotically obtain a nonzero yield, they are not applicable in a realistic scenario if local gates and measurements are imperfect. We show that such problems can be overcome by a compact measurement-based implementation, yielding entanglement purification schemes with nonzero yield that are applicable also in noisy scenarios, with tolerable noise per particle of several percent. We also generalize these findings to multiparty purification protocols for arbitrary graph states.

arXiv:1405.4207•Physical Review A•Jul 10, 2014•39 citations

Entanglement purification without controlled-NOT gates by using the natural dynamics of spin chains

Koji Maruyama, Franco Nori

We present a simple protocol to purify bipartite entanglement in spin-$1∕2$ particles by utilizing only natural spin-spin interactions, i.e., those that can commonly be realized in realistic physical systems and ${S}_{z}$ measurements on single spins. Even the standard isotropic Heisenberg interaction is shown to be sufficient to purify mixed state entanglement. Our protocol does not need controlled-NOT (CNOT) gates that are very hard to implement experimentally. This approach could be useful for quantum-information processing in solid-state-based systems.

arXiv:0802.2588•Physical Review A•Aug 7, 2008•21 citations

Entanglement purification by natural spin-spin interactions and single spin measurements

Koji Maruyama, Franco Nori

We present a simple protocol to purify bipartite entanglement in spin-1/2 particles by utilizing only natural spin-spin interactions and S z -measurements on single spins. It is shown that only one switching on (and off) of a multi-spin interaction, as well as single spin operations, is sufficient for purify entanglement. This approach significantly reduces the number of controls that would induce errors compared with conventional purification protocols and it could be useful for quantum information processing in solid-state-based systems.

OSA Workshop on Entanglement and Quantum Decoherence•Jan 1, 2008•0 citations
We show an efficient purification protocol in solid-state qubits by replacing the usual bilateral controlled-NOT gate by the bilateral iSWAP\mathrm{iSWAP}iSWAP gate. We also show that this replacement can be applied to breeding and hashing protocols, which are useful for quantum state purification. These replacements reduce the number of fragile and cumbersome two-qubit operations, making more feasible quantum-information processing with solid-state qubits. As examples, we also present quantitative analyses for the required time to perform state purification using either superconducting or semiconducting qubits.
Based on the iSWAP gate generated from the XY interaction between solid-state qubits, we present an efficient quantum circuit for the implementation of discrete quantum Fourier transform. The relatively cumbersome and expensive controlled- R k gate and SWAP gate operations required for implementing discrete quantum Fourier transform in the naive quantum circuit are replaced only by iSWAP gate operation. The scheme can be realized using any physical system with XY interaction and it would be a useful step towards the implementation of more complex quantum computation in solid-state qubits.
Entanglement purification allows the creation of qubit pairs of arbitrarily high fidelity with respect to a maximally entangled state, starting from a larger number of low-fidelity pairs. Purification requires quantum memory, a role for which electron spins are well suited. However, using existing recurrence protocols involving symmetric local two-qubit operations for spin qubits turns out to be rather unpractical. We present an efficient purification protocol requiring only a single pulsed Heisenberg- or XY-type exchange interaction between two qubit pairs. In contrast to known protocols, we allow for asymmetric bilateral two-qubit operations where the two communication parties operate differently on their qubits. In the optimal version of our protocol, the local two-qubit interactions in the case of Heisenberg exchange correspond to the swap\sqrt{swap}swap​ gate and its inverse.
We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about the number and positions of errors in the noisy ensemble in an explicit and controlled way, thereby reducing the amount of noise in the ensemble and purifying the remaining states. This allows us to design entanglement purification protocols for any number of copies that work particularly well for a small number of expected errors, i.e., high fidelity of initial states. The main tool is a counter gate with which the required nonlocal information can be transferred into the high-dimensional entangled qudit auxiliary states. We compare our schemes to standard recurrence protocols that operate on pairs of copies, and hashing and breeding protocols that operate on a (asymptotically) large number of copies. Our protocols interpolate between these two regimes, leading to higher achievable fidelity and yield. We illustrate our approach for bipartite qubit states and generalize it to purify multiparty GHZ states.
We investigate entanglement purification protocols based on hashing, where a large number of noisy entangled pairs are jointly processed to obtain a reduced number of perfect, noiseless copies. While hashing and breeding protocols are the only purification protocols that asymptotically obtain a nonzero yield, they are not applicable in a realistic scenario if local gates and measurements are imperfect. We show that such problems can be overcome by a compact measurement-based implementation, yielding entanglement purification schemes with nonzero yield that are applicable also in noisy scenarios, with tolerable noise per particle of several percent. We also generalize these findings to multiparty purification protocols for arbitrary graph states.
We present a simple protocol to purify bipartite entanglement in spin-1∕21∕21∕2 particles by utilizing only natural spin-spin interactions, i.e., those that can commonly be realized in realistic physical systems and Sz{S}_{z}Sz​ measurements on single spins. Even the standard isotropic Heisenberg interaction is shown to be sufficient to purify mixed state entanglement. Our protocol does not need controlled-NOT (CNOT) gates that are very hard to implement experimentally. This approach could be useful for quantum-information processing in solid-state-based systems.
We present a simple protocol to purify bipartite entanglement in spin-1/2 particles by utilizing only natural spin-spin interactions and S z -measurements on single spins. It is shown that only one switching on (and off) of a multi-spin interaction, as well as single spin operations, is sufficient for purify entanglement. This approach significantly reduces the number of controls that would induce errors compared with conventional purification protocols and it could be useful for quantum information processing in solid-state-based systems.