Quantum gate decomposition algorithms.
Quantum computing algorithms can be conveniently expressed in a format of a quantum logical circuits. Such circuits consist of sequential coupled operations, termed ''quantum gates'', or quantum analogs of bits called qubits. We review a recently proposed method [1] for constructing general ''quantum gates'' operating on an qubits, as composed of a sequence of generic elementary ''gates''.
- Research Organization:
- Sandia National Laboratories
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 889415
- Report Number(s):
- SAND2006-3440
- Country of Publication:
- United States
- Language:
- English
Similar Records
Demonstrating quantum algorithm acceleration with NMR quantum computer
Arbitrary two-qubit computation in 23 elementary gates
Optimal quantum circuits for general two-qubit gates
Journal Article
·
Sun Oct 31 23:00:00 EST 2004
· Physical Review. A
·
OSTI ID:20646195
Arbitrary two-qubit computation in 23 elementary gates
Journal Article
·
Tue Jul 01 00:00:00 EDT 2003
· Physical Review. A
·
OSTI ID:20639884
Optimal quantum circuits for general two-qubit gates
Journal Article
·
Sun Feb 29 23:00:00 EST 2004
· Physical Review. A
·
OSTI ID:20640841