Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
17,415
Maximum speed of quantum gate operation
, 2003
"... We consider a quantum gate, driven by a general time-dependent Hamiltonian, that complements the state of a qubit and then adds to it an arbitrary phase shift. It is shown that the minimum operation time of the), where h is Planck’s constant, E is the average over time of the quantum-mechanical aver ..."
Abstract
- Add to MetaCart
We consider a quantum gate, driven by a general time-dependent Hamiltonian, that complements the state of a qubit and then adds to it an arbitrary phase shift. It is shown that the minimum operation time of the), where h is Planck’s constant, E is the average over time of the quantum
Entanglement and Quantum Gate Operations with Spin-Qubits in Quantum Dots ∗
, 2008
"... We give an elementary introduction to the notion of quantum entanglement between distinguishable parties and review a recent proposal about solid state quantum computation with spin-qubits in quantum dots. The indistinguishable character of the electrons whose spins realize the qubits gives rise to ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We give an elementary introduction to the notion of quantum entanglement between distinguishable parties and review a recent proposal about solid state quantum computation with spin-qubits in quantum dots. The indistinguishable character of the electrons whose spins realize the qubits gives rise
FAST TRACK COMMUNICATION Electron dynamics in quantum gate operation
, 2007
"... We model the evolving time-dependent electronic structure of a solid-state quantum gate as it performs basic quantum operations. Our time-dependent configuration-interaction method follows the evolution of two donor electron spin qubits interacting with a third, optically excited, control spin in an ..."
Abstract
- Add to MetaCart
We model the evolving time-dependent electronic structure of a solid-state quantum gate as it performs basic quantum operations. Our time-dependent configuration-interaction method follows the evolution of two donor electron spin qubits interacting with a third, optically excited, control spin
A Fast Quantum Mechanical Algorithm for Database Search
- ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract
-
Cited by 1135 (10 self)
- Add to MetaCart
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a
Axiomatic quantum field theory in curved spacetime
, 2008
"... The usual formulations of quantum field theory in Minkowski spacetime make crucial use of features—such as Poincare invariance and the existence of a preferred vacuum state—that are very special to Minkowski spacetime. In order to generalize the formulation of quantum field theory to arbitrary globa ..."
Abstract
-
Cited by 689 (18 self)
- Add to MetaCart
globally hyperbolic curved spacetimes, it is essential that the theory be formulated in an entirely local and covariant manner, without assuming the presence of a preferred state. We propose a new framework for quantum field theory, in which the existence of an Operator Product Expansion (OPE) is elevated
Elementary Gates for Quantum Computation
, 1995
"... We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or 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 one-bit quantum gates (U(2)) and the two-bit exclusive-or 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
Quantum mechanics helps in searching for a needle in a haystack
, 1997
"... Quantum mechanics can speed up a range of search applications over unsorted data. For example imagine a phone directory containing N names arranged in completely random order. To find someone's phone number with a probability of 50 % , any classical algorithm (whether deterministic or probabili ..."
Abstract
-
Cited by 434 (10 self)
- Add to MetaCart
or probabilistic) will need to access the database a minimum of 0.5N times. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly
Decohering environment and coupled quantum states and internal resonance in coupled spin systems and the conflict between quantum gate operation and decoupling a Cormorant-Barnacle model, Adv
- in Phys. Theories and Applications 6
, 2012
"... Quantum decoherence in all its locus of essence, and expression is the loss of coherence or ordering of the phase angles between the components of a system in a quantum superposition. Detrimental ramifications, and pernicious implications of this dephasing leads to classical or probabilistically add ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Quantum decoherence in all its locus of essence, and expression is the loss of coherence or ordering of the phase angles between the components of a system in a quantum superposition. Detrimental ramifications, and pernicious implications of this dephasing leads to classical or probabilistically
Two-Bit Gates Are Universal for Quantum Computation
, 1995
"... A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the universality of three-bit gates, by analogy to the universality of ..."
Abstract
-
Cited by 182 (9 self)
- Add to MetaCart
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the universality of three-bit gates, by analogy to the universality
Results 1 - 10
of
17,415
