Physics – Quantum Physics
Scientific paper
2002-07-12
Phys. Rev. Lett. 89, 247902 (2002)
Physics
Quantum Physics
3 pages, online implementation of procedure described can be found at http://www.physics.uq.edu.au/gqc/
Scientific paper
10.1103/PhysRevLett.89.247902
Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. Here we present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this important result for systems of arbitrary finite dimension has been provided by J. L. and R. Brylinski [arXiv:quant-ph/0108062, 2001]; however, their proof relies upon a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical [C. M. Dawson and A. Gilchrist, online implementation of the procedure described herein (2002), http://www.physics.uq.edu.au/gqc/].
Bremner Michael J.
Dawson Christopher M.
Dodd Jennifer L.
Gilchrist Alexei
Harrow Aram W.
No associations
LandOfFree
A practical scheme for quantum computation with any two-qubit entangling gate does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A practical scheme for quantum computation with any two-qubit entangling gate, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A practical scheme for quantum computation with any two-qubit entangling gate will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-710466