5,718 research outputs found
Quantum Analogue Computing
We briefly review what a quantum computer is, what it promises to do for us,
and why it is so hard to build one. Among the first applications anticipated to
bear fruit is quantum simulation of quantum systems. While most quantum
computation is an extension of classical digital computation, quantum
simulation differs fundamentally in how the data is encoded in the quantum
computer. To perform a quantum simulation, the Hilbert space of the system to
be simulated is mapped directly onto the Hilbert space of the (logical) qubits
in the quantum computer. This type of direct correspondence is how data is
encoded in a classical analogue computer. There is no binary encoding, and
increasing precision becomes exponentially costly: an extra bit of precision
doubles the size of the computer. This has important consequences for both the
precision and error correction requirements of quantum simulation, and
significant open questions remain about its practicality. It also means that
the quantum version of analogue computers, continuous variable quantum
computers (CVQC) becomes an equally efficient architecture for quantum
simulation. Lessons from past use of classical analogue computers can help us
to build better quantum simulators in future.Comment: 10 pages, to appear in the Visions 2010 issue of Phil. Trans. Roy.
Soc.
Quantum Mechanics helps in searching for a needle in a haystack
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 probabilistic) will need
to access the database a minimum of O(N) 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. As a result, the desired
phone number can be obtained in only O(sqrt(N)) accesses to the database.Comment: Postscript, 4 pages. This is a modified version of the STOC paper
(quant-ph/9605043) and is modified to make it more comprehensible to
physicists. It appeared in Phys. Rev. Letters on July 14, 1997. (This paper
was originally put out on quant-ph on June 13, 1997, the present version has
some minor typographical changes
Quantum-state filtering applied to the discrimination of Boolean functions
Quantum state filtering is a variant of the unambiguous state discrimination
problem: the states are grouped in sets and we want to determine to which
particular set a given input state belongs.The simplest case, when the N given
states are divided into two subsets and the first set consists of one state
only while the second consists of all of the remaining states, is termed
quantum state filtering. We derived previously the optimal strategy for the
case of N non-orthogonal states, {|\psi_{1} >, ..., |\psi_{N} >}, for
distinguishing |\psi_1 > from the set {|\psi_2 >, ..., |\psi_N >} and the
corresponding optimal success and failure probabilities. In a previous paper
[PRL 90, 257901 (2003)], we sketched an appplication of the results to
probabilistic quantum algorithms. Here we fill in the gaps and give the
complete derivation of the probabilstic quantum algorithm that can optimally
distinguish between two classes of Boolean functions, that of the balanced
functions and that of the biased functions. The algorithm is probabilistic, it
fails sometimes but when it does it lets us know that it did. Our approach can
be considered as a generalization of the Deutsch-Jozsa algorithm that was
developed for the discrimination of balanced and constant Boolean functions.Comment: 8 page
An Universal Quantum Network - Quantum CPU
An universal quantum network which can implement a general quantum computing
is proposed. In this sense, it can be called the quantum central processing
unit (QCPU). For a given quantum computing, its realization of QCPU is just its
quantum network. QCPU is standard and easy-assemble because it only has two
kinds of basic elements and two auxiliary elements. QCPU and its realizations
are scalable, that is, they can be connected together, and so they can
construct the whole quantum network to implement the general quantum algorithm
and quantum simulating procedure.Comment: 8 pages, Revised versio
A Simple Quantum Computer
We propose an implementation of a quantum computer to solve Deutsch's
problem, which requires exponential time on a classical computer but only
linear time with quantum parallelism. By using a dual-rail qubit representation
as a simple form of error correction, our machine can tolerate some amount of
decoherence and still give the correct result with high probability. The design
which we employ also demonstrates a signature for quantum parallelism which
unambiguously delineates the desired quantum behavior from the merely
classical. The experimental demonstration of our proposal using quantum optical
components calls for the development of several key technologies common to
single photonics.Comment: 8 pages RevTeX + 6 figures in postscrip
Quantum CPU and Quantum Algorithm
Making use of an universal quantum network -- QCPU proposed by
me\upcite{My1}, it is obtained that the whole quantum network which can
implement some the known quantum algorithms including Deutsch algorithm,
quantum Fourier transformation, Shor's algorithm and Grover's algorithm.Comment: 8 pages, Revised Versio
Experimental application of decoherence-free subspaces in a quantum-computing algorithm
For a practical quantum computer to operate, it will be essential to properly
manage decoherence. One important technique for doing this is the use of
"decoherence-free subspaces" (DFSs), which have recently been demonstrated.
Here we present the first use of DFSs to improve the performance of a quantum
algorithm. An optical implementation of the Deutsch-Jozsa algorithm can be made
insensitive to a particular class of phase noise by encoding information in the
appropriate subspaces; we observe a reduction of the error rate from 35% to
essentially its pre-noise value of 8%.Comment: 11 pages, 4 figures, submitted to PR
Energy and Efficiency of Adiabatic Quantum Search Algorithms
We present the results of a detailed analysis of a general, unstructured
adiabatic quantum search of a data base of items. In particular we examine
the effects on the computation time of adding energy to the system. We find
that by increasing the lowest eigenvalue of the time dependent Hamiltonian {\it
temporarily} to a maximum of , it is possible to do the
calculation in constant time. This leads us to derive the general theorem which
provides the adiabatic analogue of the bound of conventional quantum
searches. The result suggests that the action associated with the oracle term
in the time dependent Hamiltonian is a direct measure of the resources required
by the adiabatic quantum search.Comment: 6 pages, Revtex, 1 figure. Theorem modified, references and comments
added, sections introduced, typos corrected. Version to appear in J. Phys.
Conditional Quantum Dynamics and Logic Gates
Quantum logic gates provide fundamental examples of conditional quantum
dynamics. They could form the building blocks of general quantum information
processing systems which have recently been shown to have many interesting
non--classical properties. We describe a simple quantum logic gate, the quantum
controlled--NOT, and analyse some of its applications. We discuss two possible
physical realisations of the gate; one based on Ramsey atomic interferometry
and the other on the selective driving of optical resonances of two subsystems
undergoing a dipole--dipole interaction.Comment: 5 pages, RevTeX, two figures in a uuencoded, compressed fil
- …