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:quant-ph/0405046 · Physical Review A

Characterization of two-qubit perfect entanglers

A. T. Rezakhani

Published Nov 11, 2004• 91 citations
arXivHTMLPDF

Abstract

Here we consider perfect entanglers from another perspective. It is shown that there are some special perfect entanglers which can maximally entangle a full product basis. We explicitly construct a one-parameter family of such entanglers together with the proper product basis that they maximally entangle. This special family of perfect entanglers contains some well-known operators such as controlled-NOT (CNOT) and double-CNOT, but not $\sqrt{\mathrm{SWAP}}$. In addition, it is shown that all perfect entanglers with entangling power equal to the maximal value $\frac{2}{9}$ are also special perfect entanglers. It is proved that the one-parameter family is the only possible set of special perfect entanglers. Also we provide an analytic way to implement any arbitrary two-qubit gate, given a proper special perfect entangler supplemented with single-qubit gates. Such gates are shown to provide a minimum universal gate construction in that just two of them are necessary and sufficient in implementation of a generic two-qubit gate.

DOI
10.1103/physreva.70.052313

Related papers

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

Construction of two-qubit gates using B Gate

M. Karthick Selvan, S. Balakrishnan

Abstract In the circuit model of quantum computation, an entangling two-qubit gate and a set of single-qubit gates are used as universal gate set or basis gates for doing quantum computation. CNOT and iSWAP gates, the perfect entanglers that can create maximally entangled two-qubit states in one application, are broadly used entangling two-qubit basis gates in quantum computers. In this paper, we analyze the potentiality of B gate, an unexplored non-perfect entangler of the form, exp i π ( σ ˆ x ⨂ σ ˆ x ) 8 + i π ( σ ˆ y ⨂ σ ˆ y ) 16 , as an entangling two-qubit basis gate in quantum computers by studying its ability to generate other two-qubit gates. We derive a necessary condition for a two-qubit gate to be generated by n applications of B gate. Using this condition, we show that the gates that can be generated by two and three applications of B gate are contained in the 50% and 92.97% of the volume of Weyl chamber of two-qubit gates, respectively. We prove that two applications of B gate can generate both SWAP and SWAP

Physica Scripta•Feb 20, 2024•2 citations

Optimizing for an arbitrary perfect entangler. I. Functionals

Paul Watts, Jiří Vala, Matthias M. Müller +5 more

Optimal control theory is a powerful tool for improving figures of merit in quantum information tasks. Finding the solution to any optimal control problem via numerical optimization depends crucially on the choice of the optimization functional. Here, we derive a functional that targets the full set of two-qubit perfect entanglers, gates capable of creating a maximally entangled state out of some initial product state. The functional depends on easily computable local invariants and unequivocally determines whether a gate is a perfect entangler. Optimization with our functional is most useful if the two-qubit dynamics allows for the implementation of more than one perfect entangler. We discuss the reachable set of perfect entanglers for a generic Hamiltonian that corresponds to several quantum information platforms of current interest.

arXiv:1412.7347•Physical Review A•Jun 8, 2015•60 citations

Conditions for optimal construction of two-qubit nonlocal gates

Yong-Sheng Zhang, Ming-Yong Ye, Guang‐Can Guo

Optimal implementation of quantum gates is crucial for designing a quantum computer. The necessary condition for optimal construction of a two-qubit unitary operation is obtained. It can be proved that the $B$ gate is the unique gate that can construct a two-qubit universal circuit with only two applications, i.e., this condition is also sufficient in the case of two applications of the elementary two-qubit gate. It is also shown that many perfect entanglers cannot simulate an arbitrary two-qubit gate with only three applications. We show how a two-qubit gate's construction power is related to the construction power of its mirror gate, and introduce a specific kind of two-qubit entangling gate, i.e., a super controlled gate, which can construct an arbitrary two-qubit gate by three applications.

arXiv:quant-ph/0411058•Physical Review A•Jun 24, 2005•42 citations

Optimal quantum circuits for general two-qubit gates

Farrokh Vatan, Colin P. Williams

In order to demonstrate nontrivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 controlled-NOT (CNOT) gates and 15 elementary one-qubit gates. Moreover, if the desired two-qubit gate corresponds to a purely real unitary transformation, we provide a construction that requries at most 2 CNOT and 12 one-qubit gates. We then prove that these constructions are optimal with respect to the family of CNOT, $y$-rotation, $z$-rotation, and phase gates.

arXiv:quant-ph/0308006•Physical Review A•Mar 22, 2004•442 citations

Exact Two-Qubit Universal Quantum Circuit

Jun Zhang, Jiří Vala, Shankar Sastry +1 more

We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly simulates arbitrary two-qubit operations in SU(4). Each block in this circuit is given in a closed form solution. We also provide a uniform upper bound of the applications of the given entangling gates, and find that exactly half of all the controlled-unitary gates satisfy the same upper bound as the CNOT gate. These results allow for the efficient implementation of operations in SU(4) required for both quantum computation and quantum simulation.

arXiv:quant-ph/0212109•Physical Review Letters•Jul 11, 2003•68 citations
Here we consider perfect entanglers from another perspective. It is shown that there are some special perfect entanglers which can maximally entangle a full product basis. We explicitly construct a one-parameter family of such entanglers together with the proper product basis that they maximally entangle. This special family of perfect entanglers contains some well-known operators such as controlled-NOT (CNOT) and double-CNOT, but not SWAP\sqrt{\mathrm{SWAP}}SWAP​. In addition, it is shown that all perfect entanglers with entangling power equal to the maximal value 29\frac{2}{9}92​ are also special perfect entanglers. It is proved that the one-parameter family is the only possible set of special perfect entanglers. Also we provide an analytic way to implement any arbitrary two-qubit gate, given a proper special perfect entangler supplemented with single-qubit gates. Such gates are shown to provide a minimum universal gate construction in that just two of them are necessary and sufficient in implementation of a generic two-qubit gate.
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.
Abstract In the circuit model of quantum computation, an entangling two-qubit gate and a set of single-qubit gates are used as universal gate set or basis gates for doing quantum computation. CNOT and iSWAP gates, the perfect entanglers that can create maximally entangled two-qubit states in one application, are broadly used entangling two-qubit basis gates in quantum computers. In this paper, we analyze the potentiality of B gate, an unexplored non-perfect entangler of the form, exp i π ( σ ˆ x ⨂ σ ˆ x ) 8 + i π ( σ ˆ y ⨂ σ ˆ y ) 16 , as an entangling two-qubit basis gate in quantum computers by studying its ability to generate other two-qubit gates. We derive a necessary condition for a two-qubit gate to be generated by n applications of B gate. Using this condition, we show that the gates that can be generated by two and three applications of B gate are contained in the 50% and 92.97% of the volume of Weyl chamber of two-qubit gates, respectively. We prove that two applications of B gate can generate both SWAP and SWAP
Optimal control theory is a powerful tool for improving figures of merit in quantum information tasks. Finding the solution to any optimal control problem via numerical optimization depends crucially on the choice of the optimization functional. Here, we derive a functional that targets the full set of two-qubit perfect entanglers, gates capable of creating a maximally entangled state out of some initial product state. The functional depends on easily computable local invariants and unequivocally determines whether a gate is a perfect entangler. Optimization with our functional is most useful if the two-qubit dynamics allows for the implementation of more than one perfect entangler. We discuss the reachable set of perfect entanglers for a generic Hamiltonian that corresponds to several quantum information platforms of current interest.
Optimal implementation of quantum gates is crucial for designing a quantum computer. The necessary condition for optimal construction of a two-qubit unitary operation is obtained. It can be proved that the BBB gate is the unique gate that can construct a two-qubit universal circuit with only two applications, i.e., this condition is also sufficient in the case of two applications of the elementary two-qubit gate. It is also shown that many perfect entanglers cannot simulate an arbitrary two-qubit gate with only three applications. We show how a two-qubit gate's construction power is related to the construction power of its mirror gate, and introduce a specific kind of two-qubit entangling gate, i.e., a super controlled gate, which can construct an arbitrary two-qubit gate by three applications.
In order to demonstrate nontrivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 controlled-NOT (CNOT) gates and 15 elementary one-qubit gates. Moreover, if the desired two-qubit gate corresponds to a purely real unitary transformation, we provide a construction that requries at most 2 CNOT and 12 one-qubit gates. We then prove that these constructions are optimal with respect to the family of CNOT, yyy-rotation, zzz-rotation, and phase gates.
We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly simulates arbitrary two-qubit operations in SU(4). Each block in this circuit is given in a closed form solution. We also provide a uniform upper bound of the applications of the given entangling gates, and find that exactly half of all the controlled-unitary gates satisfy the same upper bound as the CNOT gate. These results allow for the efficient implementation of operations in SU(4) required for both quantum computation and quantum simulation.