Results 1  10
of
6,340
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97
Algorithms for Quantum Computation: Discrete Logarithms and Factoring
, 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation time of at most a polynomial factol: It is not clear whether this is still true when quantum mechanics is taken into consider ..."
Abstract

Cited by 1111 (5 self)
 Add to MetaCart
A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation time of at most a polynomial factol: It is not clear whether this is still true when quantum mechanics is taken
The University of Florida sparse matrix collection
 NA DIGEST
, 1997
"... The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural enginee ..."
Abstract

Cited by 536 (17 self)
 Add to MetaCart
The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural
PolynomialTime Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
 SIAM J. on Computing
, 1997
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 1277 (4 self)
 Add to MetaCart
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration
Efficient Universal Quantum Circuits
"... Abstract. We define and construct efficient depthuniversal and almostsizeuniversal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central quantum circuit classes and used to capture the computational power of the simulated class. For depth we construct universal ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We define and construct efficient depthuniversal and almostsizeuniversal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central quantum circuit classes and used to capture the computational power of the simulated class. For depth we con
Universal Quantum Circuits
"... Abstract. We define and construct efficient depthuniversal and almostsizeuniversal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central classes of quantum circuits and can be used to capture the computational power of the circuit class being simulated. For depth w ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We define and construct efficient depthuniversal and almostsizeuniversal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central classes of quantum circuits and can be used to capture the computational power of the circuit class being simulated. For depth
Universal Quantum Computing with Spin and
"... Abstract. We investigate a twoelectron double quantum dot with both spin and valley degrees of freedom as they occur in graphene, carbon nanotubes, or silicon, and regard the 16dimensional space with one electron per dot as a fourqubit logic space. In the spinonly case, it is well known that the ..."
Abstract
 Add to MetaCart
that the exchange coupling between the dots combined with arbitrary singlequbit operations is sufficient for universal quantum computation. The presence of the valley degeneracy in the electronic band structure alters the form of the exchange coupling and in general leads to spinvalley entanglement. Here, we show
Is There a Universal Quantum Computer?
, 1998
"... In classical computation, any recursive function can be computed by a universal Turing machine, and the program is independent of the value of the variable. Generalizing this universality to quantum computation, one anticipates that there is a universal quantum Turing machine which can perform any d ..."
Abstract
 Add to MetaCart
In classical computation, any recursive function can be computed by a universal Turing machine, and the program is independent of the value of the variable. Generalizing this universality to quantum computation, one anticipates that there is a universal quantum Turing machine which can perform any
UNIVERSAL QUANTUM COMPUTATION WITH SHUTTER LOGIC.
, 2006
"... We show that universal quantum logic can be achieved using only linear optics and a quantum shutter device. With these elements, we design a quantum memory for any number of qubits and a CNOT gate which are the basis of a universal quantum computer. An interactionfree model for a quantum shutter is ..."
Abstract
 Add to MetaCart
We show that universal quantum logic can be achieved using only linear optics and a quantum shutter device. With these elements, we design a quantum memory for any number of qubits and a CNOT gate which are the basis of a universal quantum computer. An interactionfree model for a quantum shutter
Results 1  10
of
6,340