Physical Review A · 2004 · 91 citations · 34 references
Natural SciencesPhysicsInformation TheoryQuantum ComputingQuantum MechanicsQuantum BitsQuantum ComputationQuantum EntanglementQuantum GatesQuantum OperatorsQuantum StatesArbitrary Unitary GatesEntangling GatesOperatorsSingle-qubit GatesTwo-qubit Gates
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.
34
<i>Quantum Computation and Quantum Information</i>
Michael A. Nielsen, Isaac L. Chuang, Lov K. Grover · American Journal of Physics · 2002 · 22.7K citations
Quantum computation and quantum information
Jim Law · ACM SIGSOFT Software Engineering Notes · 2001 · 19.2K citations
Computing, Computer Science, Physics +13
Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve et al. · Physical Review A · 1995 · 4.4K citations · Full text
Time optimal control in spin systems
Navin Khaneja, Roger W. Brockett, Steffen J. Glaser · Physical Review A · 2001 · 748 citations · Full text