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

Optimal simulation of a perfect entangler

Nengkun Yu, Runyao Duan, Mingsheng Ying

Published Mar 29, 2010• 8 citations
arXivHTMLPDF

Abstract

A $2\ensuremath{\bigotimes}2$ unitary operation is called a perfect entangler if it can generate a maximally entangled state from some unentangled input. We study the following question: How many runs of a given two-qubit entangling unitary operation are required to simulate some perfect entangler with one-qubit unitary operations as free resources? We completely solve this problem by presenting an analytical formula for the optimal number of runs of the entangling operation. Our result reveals an entanglement strength of two-qubit unitary operations.

DOI
10.1103/physreva.81.032328

Related papers

Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations

Runyao Duan, Yuan Feng, Mingsheng Ying

We show that a unitary operation (quantum circuit) secretly chosen from a finite set of unitary operations can be determined with certainty by sequentially applying only a finite amount of runs of the unknown circuit. No entanglement or joint quantum operations are required in our scheme. We further show that our scheme is optimal in the sense that the number of the runs is minimal when discriminating only two unitary operations.

arXiv:quant-ph/0601150•Physical Review Letters•Mar 9, 2007•121 citations

Completely positive covariant two-qubit quantum processes and optimal quantum NOT operations for entangled qubit pairs

Jaroslav Novotný, G. Alber, Igor Jex

The structure is investigated of all completely positive quantum operations that transform pure two-qubit input states of a given degree of entanglement in a covariant way. Special cases thereof are quantum NOT operations which transform entangled pure two-qubit input states of a given degree of entanglement into orthogonal states in an optimal way. Based on our general analysis all covariant optimal two-qubit quantum NOT operations are determined. In particular, it is demonstrated that only in the case of maximally entangled input states can these quantum NOT operations be performed perfectly.

arXiv:quant-ph/0603184•Physical Review A•Jun 8, 2006•3 citations

Simulating Entangling Unitary Operator Using Non-maximally Entangled States

Chun-Xian Li, Wang Cheng-Zhi, Nie Liu-Ying +1 more

We use non-maximally entangled states (NMESs) to simulate an entangling unitary operator (EUO) with a certain probability. Given entanglement resources, the probability of the success we achieve is a decreasing function of the parameters of the EUO. Given an EUO, for certain entanglement resources the result is optimal, i.e., the probability obtains a maximal value, and for optimal result higher parameters of the EUO match more amount of entanglement resources. The probability of the success we achieve is higher than the known results under some condition.

Chinese Physics Letters•Feb 1, 2009•0 citations

Entanglement Capacity of Two-Qubit Unitary Operator with the Help of Auxiliary System

Baolin Hu, Yao-Min Di

The entanglement capacity of general two-qubit unitary operators is studied when auxiliary systems are allowed, and the analytical results based on linear entropy when input states are disentangled are given. From the results the condition for perfect entangler, α 1 = α 2 = π/4, is obtained. Contrary to the case without auxiliary system, the parameter α 3 may play active role to the entanglement capacity when auxiliary systems are allowed.

Communications in Theoretical Physics•Jun 1, 2007•6 citations

Entangling power of two-qubit gates on mixed states

Zhe Guan, Huan He, Yong-Jian Han +3 more

The ability to reach a maximally entangled state from a separable one through the use of a two-qubit unitary operator is analyzed for mixed states. This extension from the known case of pure states shows that there are at least two families of gates which are able to give maximum entangling power for all values of purity. It is notable that one of this gates coincides with a maximum discording one. We give analytical proof that such gate is indeed a perfect entangler at all purities and give numerical evidence for the existence of the second one. Furthermore, we find that there are other gates, many in fact, which are perfect entanglers for a restricted range of purities. This highlights the fact that many perfect entangler gates could in principle be found if a thorough analysis of the full parameter space is performed.

arXiv:1311.5809•Physical Review A•Jan 23, 2014•14 citations

Quantum circuits for incompletely specified two-qubit operators

Vivek Shende, Igor L. Markov

While the question ``how many CNOT gates are needed to simulate an arbitrary two-qubit operator'' has been conclusively answered -- three are necessary and sufficient -- previous work on this topic assumes that one wants to simulate a given unitary operator up to global phase. However, in many practical cases additional degrees of freedom are allowed. For example, if the computation is to be followed by a given projective measurement, many dissimilar operators achieve the same output distributions on all input states. Alternatively, if it is known that the input state is $\ket{0}$, the action of the given operator on all orthogonal states is immaterial. In such cases, we say that the unitary operator is incompletely specified; in this work, we take up the practical challenge of satisfying a given specification with the smallest possible circuit. In particular, we identify cases in which such operators can be implemented using fewer quantum gates than are required for generic completely specified operators.

arXiv:quant-ph/0401162•Quantum Information and Computation•Jan 1, 2005•50 citations
A 2\ensuremath⨂22\ensuremath{\bigotimes}22\ensuremath⨂2 unitary operation is called a perfect entangler if it can generate a maximally entangled state from some unentangled input. We study the following question: How many runs of a given two-qubit entangling unitary operation are required to simulate some perfect entangler with one-qubit unitary operations as free resources? We completely solve this problem by presenting an analytical formula for the optimal number of runs of the entangling operation. Our result reveals an entanglement strength of two-qubit unitary operations.
The structure is investigated of all completely positive quantum operations that transform pure two-qubit input states of a given degree of entanglement in a covariant way. Special cases thereof are quantum NOT operations which transform entangled pure two-qubit input states of a given degree of entanglement into orthogonal states in an optimal way. Based on our general analysis all covariant optimal two-qubit quantum NOT operations are determined. In particular, it is demonstrated that only in the case of maximally entangled input states can these quantum NOT operations be performed perfectly.
We use non-maximally entangled states (NMESs) to simulate an entangling unitary operator (EUO) with a certain probability. Given entanglement resources, the probability of the success we achieve is a decreasing function of the parameters of the EUO. Given an EUO, for certain entanglement resources the result is optimal, i.e., the probability obtains a maximal value, and for optimal result higher parameters of the EUO match more amount of entanglement resources. The probability of the success we achieve is higher than the known results under some condition.
The ability to reach a maximally entangled state from a separable one through the use of a two-qubit unitary operator is analyzed for mixed states. This extension from the known case of pure states shows that there are at least two families of gates which are able to give maximum entangling power for all values of purity. It is notable that one of this gates coincides with a maximum discording one. We give analytical proof that such gate is indeed a perfect entangler at all purities and give numerical evidence for the existence of the second one. Furthermore, we find that there are other gates, many in fact, which are perfect entanglers for a restricted range of purities. This highlights the fact that many perfect entangler gates could in principle be found if a thorough analysis of the full parameter space is performed.
While the question ``how many CNOT gates are needed to simulate an arbitrary two-qubit operator'' has been conclusively answered -- three are necessary and sufficient -- previous work on this topic assumes that one wants to simulate a given unitary operator up to global phase. However, in many practical cases additional degrees of freedom are allowed. For example, if the computation is to be followed by a given projective measurement, many dissimilar operators achieve the same output distributions on all input states. Alternatively, if it is known that the input state is ∣0⟩\ket{0}∣0⟩, the action of the given operator on all orthogonal states is immaterial. In such cases, we say that the unitary operator is incompletely specified; in this work, we take up the practical challenge of satisfying a given specification with the smallest possible circuit. In particular, we identify cases in which such operators can be implemented using fewer quantum gates than are required for generic completely specified operators.