Results 1  10
of
4,326
Optimal Realization of an Arbitrary TwoQubit Quantum Gate
"... By an explicit construction, we show that an arbitrary twoqubit gate can be implemented by using at most 16 elementary onequbit gates and 3 CNOT gates. We show that this construction is optimal; in the sense that these numbers of gates is the minimal possible ones. Moreover, we show that if the tw ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
By an explicit construction, we show that an arbitrary twoqubit gate can be implemented by using at most 16 elementary onequbit gates and 3 CNOT gates. We show that this construction is optimal; in the sense that these numbers of gates is the minimal possible ones. Moreover, we show
Singlequbit quantum gates using magnetooptic Kerr
"... Abstract—We propose the use of magnetooptic Kerr effect (MOKE) to realize singlequbit quantum gates. We consider longitudinal and polar MOKE in reflection geometry in which the magnetic field is parallel to both the plane of incidence and surface of the film. MOKE couples incident TE and TM polar ..."
Abstract
 Add to MetaCart
Abstract—We propose the use of magnetooptic Kerr effect (MOKE) to realize singlequbit quantum gates. We consider longitudinal and polar MOKE in reflection geometry in which the magnetic field is parallel to both the plane of incidence and surface of the film. MOKE couples incident TE and TM
Realization of a general threequbit quantum gate. eprint
"... We prove that a generic threequbit quantum logic gate can be implemented using at most 67 onequbit rotations about the y and zaxes and 43 CNOT gates, beating an earlier bound of 64 CNOT gates. 1 ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We prove that a generic threequbit quantum logic gate can be implemented using at most 67 onequbit rotations about the y and zaxes and 43 CNOT gates, beating an earlier bound of 64 CNOT gates. 1
Optimal Realization of a General TwoQubit Quantum Gate
, 2003
"... By an explicit construction, we show that an arbitrary twoqubit gate can be implemented by using at most 16 elementary onequbit gates and 3 CNOT gates. We show that this construction is optimal; in the sense that these numbers of gates is the minimal possible ones. Moreover, we show that if the tw ..."
Abstract
 Add to MetaCart
By an explicit construction, we show that an arbitrary twoqubit gate can be implemented by using at most 16 elementary onequbit gates and 3 CNOT gates. We show that this construction is optimal; in the sense that these numbers of gates is the minimal possible ones. Moreover, we show
unknown title
, 809
"... Control of entanglement and twoqubit quantum gates with atoms crossing a detuned optical cavity ..."
Abstract
 Add to MetaCart
Control of entanglement and twoqubit quantum gates with atoms crossing a detuned optical cavity
Quantum computing with trapped ion hyperfine qubits
 Quantum Inf. Proc
, 2004
"... We discuss the basic aspects of quantum information processing with trapped ions, including the principles of ion trapping, preparation and detection of hyperfine qubits, singlequbit operations and multiqubit entanglement protocols. Recent experimental advances and future research directions are ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
are outlined. KEY WORDS: Ion trapping; hyperfine qubits; quantum gates; qubit detection; qubit initialization; entanglement.
Good quantum error correcting codes exist
 REV. A
, 1996
"... A quantum errorcorrecting code is defined to be a unitary mapping (encoding) of k qubits (2state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can be used ..."
Abstract

Cited by 349 (9 self)
 Add to MetaCart
A quantum errorcorrecting code is defined to be a unitary mapping (encoding) of k qubits (2state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can
Elementary Gates for Quantum Computation
, 1995
"... We show that a set of gates that consists of all onebit quantum gates (U(2)) and the twobit exclusiveor gate (that maps Boolean values (x, y)to(x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We in ..."
Abstract

Cited by 280 (11 self)
 Add to MetaCart
We show that a set of gates that consists of all onebit quantum gates (U(2)) and the twobit exclusiveor gate (that maps Boolean values (x, y)to(x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We
NMR quantum computation with indirectly coupled gates. quantph/9910006
, 1999
"... An NMR realization of a twoqubit quantum gate which processes quantum information indirectly via couplings to a spectator qubit is presented in the context of the DeutschJozsa algorithm. This enables a successful comprehensive NMR implementation of the DeutschJozsa algorithm for functions with th ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
An NMR realization of a twoqubit quantum gate which processes quantum information indirectly via couplings to a spectator qubit is presented in the context of the DeutschJozsa algorithm. This enables a successful comprehensive NMR implementation of the DeutschJozsa algorithm for functions
DOI: 10.1051/jp4:2006135060 Quantum logic gates by adiabatic passage
"... Abstract. We present adiabatic passage techniques for the realisation of one and twoqubit quantum gates. These methods use evolution along darkstates of the system, avoiding decoherence effects such as spontaneous emission. The advantage of these methods is their robustness: they are insensitive t ..."
Abstract
 Add to MetaCart
Abstract. We present adiabatic passage techniques for the realisation of one and twoqubit quantum gates. These methods use evolution along darkstates of the system, avoiding decoherence effects such as spontaneous emission. The advantage of these methods is their robustness: they are insensitive
Results 1  10
of
4,326