Results 1  10
of
53,474
linearoptics quantum gate
, 2009
"... Analysis of experimental error sources in a linearoptics quantum gate This article has been downloaded from IOPscience. Please scroll down to see the full text article. 2010 New J. Phys. 12 043053 ..."
Abstract
 Add to MetaCart
Analysis of experimental error sources in a linearoptics quantum gate This article has been downloaded from IOPscience. Please scroll down to see the full text article. 2010 New J. Phys. 12 043053
Decomposition of general quantum gates
"... Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used to construct any nqubit gate. In 1995, the universality of ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used to construct any nqubit gate. In 1995, the universality
Information complexity of quantum gates
 Int. Journal of Theoretical Physics
"... This paper considers the realizability of quantum gates from the perspective of information complexity. Since the gate is a physical device that must be controlled classically, it is subject to random error. We define the complexity of gate operation in terms of the difference between the entropy of ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
This paper considers the realizability of quantum gates from the perspective of information complexity. Since the gate is a physical device that must be controlled classically, it is subject to random error. We define the complexity of gate operation in terms of the difference between the entropy
Universal quantum gates
 in Mathematics of Quantum Computation, Chapman & Hall/CRC Press, Boca
, 2002
"... Abstract. In this paper we study universality for quantum gates acting on qudits. Qudits are states in a Hilbert space of dimension d where d can be any integer ≥ 2. We determine which 2qudit gates V have the properties (i) the collection of all 1qudit gates together with V produces all nqudit ga ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
Abstract. In this paper we study universality for quantum gates acting on qudits. Qudits are states in a Hilbert space of dimension d where d can be any integer ≥ 2. We determine which 2qudit gates V have the properties (i) the collection of all 1qudit gates together with V produces all n
Different classes of quantum gates entanglers
, 901
"... We construct quantum gates entanglers for different classes of multipartite states. In particular we construct entangler operators for W and GHZ classes of multipartite states based on the construction of the concurrence classes. We also in detail discuss these two classes of the quantum gates entan ..."
Abstract
 Add to MetaCart
We construct quantum gates entanglers for different classes of multipartite states. In particular we construct entangler operators for W and GHZ classes of multipartite states based on the construction of the concurrence classes. We also in detail discuss these two classes of the quantum gates
Universal Quantum Gates For Tensors
, 2004
"... A universal quantum gate is introduced for tensors of vector spaces. By using integer powers of such a gate and by using classical reversible gates one can approximate any element of the unitary group to any accuracy needed. The proof uses a version of Kronecker’s theory and the structure of the Blo ..."
Abstract
 Add to MetaCart
A universal quantum gate is introduced for tensors of vector spaces. By using integer powers of such a gate and by using classical reversible gates one can approximate any element of the unitary group to any accuracy needed. The proof uses a version of Kronecker’s theory and the structure
Quantum Gates and Circuits
 in Proceedings of the ITP Conference on Quantum Coherence and Decoherence
, 1996
"... A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates. I highlight the quantum XOR or controlled NOT as the fundamental twobit gate for quantum computation. This gate plays a central role in networks for quantum error correct ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates. I highlight the quantum XOR or controlled NOT as the fundamental twobit gate for quantum computation. This gate plays a central role in networks for quantum error
On Initializing Quantum Registers and Quantum Gates
, 1998
"... The problem of initializing phase in a quantum computing system is considered. The initialization of phases is a problem when the system is initially present in an entangled state and also in the application of the quantum gate transformations since each gate will introduce phase uncertainty. The ac ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The problem of initializing phase in a quantum computing system is considered. The initialization of phases is a problem when the system is initially present in an entangled state and also in the application of the quantum gate transformations since each gate will introduce phase uncertainty
Quantum gates and Clifford algebras
 TMR’99 Network School on Quantum Computation and Quantum Information Theory, Torino 1999), Preprint arXiv:quantph/9907079
, 1999
"... Clifford algebras are used for definition of spinors. Because of using spin1/2 systems as an adequate model of quantum bit, a relation of the algebras with quantum information science has physical reasons. But there are simple mathematical properties of the algebras those also justifies such applic ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
such applications. First, any complex Clifford algebra with 2n generators, Cl(2n, C), has representation as algebra of all 2 n × 2 n complex matrices and so includes unitary matrix of any quantum ngate. An arbitrary element of whole algebra corresponds to general form of linear complex transformation. The last
Programmable Quantum Gate Arrays
"... We present a probabilistic quantum processor for qubits. The processor itself is represented by a fixed array of gates. The input of the processor is constituted by two registers. In the program register the set of instructions (program) is encoded. This program is applied to the data register. The ..."
Abstract
 Add to MetaCart
We present a probabilistic quantum processor for qubits. The processor itself is represented by a fixed array of gates. The input of the processor is constituted by two registers. In the program register the set of instructions (program) is encoded. This program is applied to the data register
Results 1  10
of
53,474