1,007 research outputs found
Multi-Party Pseudo-Telepathy
Quantum entanglement, perhaps the most non-classical manifestation of quantum
information theory, cannot be used to transmit information between remote
parties. Yet, it can be used to reduce the amount of communication required to
process a variety of distributed computational tasks. We speak of
pseudo-telepathy when quantum entanglement serves to eliminate the classical
need to communicate. In earlier examples of pseudo-telepathy, classical
protocols could succeed with high probability unless the inputs were very
large. Here we present a simple multi-party distributed problem for which the
inputs and outputs consist of a single bit per player, and we present a perfect
quantum protocol for it. We prove that no classical protocol can succeed with a
probability that differs from 1/2 by more than a fraction that is exponentially
small in the number of players. This could be used to circumvent the detection
loophole in experimental tests of nonlocality.Comment: 11 pages. To be appear in WADS 2003 proceeding
Berry phase for a spin 1/2 in a classical fluctuating field
The effect of fluctuations in the classical control parameters on the Berry
phase of a spin 1/2 interacting with a adiabatically cyclically varying
magnetic field is analyzed. It is explicitly shown that in the adiabatic limit
dephasing is due to fluctuations of the dynamical phase.Comment: 4 pages, 1 figure, published versio
Grover's search algorithm: An optical approach
The essential operations of a quantum computer can be accomplished using
solely optical elements, with different polarization or spatial modes
representing the individual qubits. We present a simple all-optical
implementation of Grover's algorithm for efficient searching, in which a
database of four elements is searched with a single query. By `compiling' the
actual setup, we have reduced the required number of optical elements from 24
to only 12. We discuss the extension to larger databases, and the limitations
of these techniques.Comment: 6 pages, 5 figures. To appear in a special issue of the Journal of
Modern Optics -- "The Physics of Quantum Information
Universal quantum computation by discontinuous quantum walk
Quantum walks are the quantum-mechanical analog of random walks, in which a
quantum `walker' evolves between initial and final states by traversing the
edges of a graph, either in discrete steps from node to node or via continuous
evolution under the Hamiltonian furnished by the adjacency matrix of the graph.
We present a hybrid scheme for universal quantum computation in which a quantum
walker takes discrete steps of continuous evolution. This `discontinuous'
quantum walk employs perfect quantum state transfer between two nodes of
specific subgraphs chosen to implement a universal gate set, thereby ensuring
unitary evolution without requiring the introduction of an ancillary coin
space. The run time is linear in the number of simulated qubits and gates. The
scheme allows multiple runs of the algorithm to be executed almost
simultaneously by starting walkers one timestep apart.Comment: 7 pages, revte
The quantum speed up as advanced knowledge of the solution
With reference to a search in a database of size N, Grover states: "What is
the reason that one would expect that a quantum mechanical scheme could
accomplish the search in O(square root of N) steps? It would be insightful to
have a simple two line argument for this without having to describe the details
of the search algorithm". The answer provided in this work is: "because any
quantum algorithm takes the time taken by a classical algorithm that knows in
advance 50% of the information that specifies the solution of the problem".
This empirical fact, unnoticed so far, holds for both quadratic and exponential
speed ups and is theoretically justified in three steps: (i) once the physical
representation is extended to the production of the problem on the part of the
oracle and to the final measurement of the computer register, quantum
computation is reduction on the solution of the problem under a relation
representing problem-solution interdependence, (ii) the speed up is explained
by a simple consideration of time symmetry, it is the gain of information about
the solution due to backdating, to before running the algorithm, a
time-symmetric part of the reduction on the solution; this advanced knowledge
of the solution reduces the size of the solution space to be explored by the
algorithm, (iii) if I is the information acquired by measuring the content of
the computer register at the end of the algorithm, the quantum algorithm takes
the time taken by a classical algorithm that knows in advance 50% of I, which
brings us to the initial statement.Comment: 23 pages, to be published in IJT
Generalized Quantum Telecloning
We present a generalized telecloning (GTC) protocol where the quantum channel
is non-optimally entangled and we study how the fidelity of the telecloned
states depends on the entanglement of the channel. We show that one can
increase the fidelity of the telecloned states, achieving the optimal value in
some situations, by properly choosing the measurement basis at Alice's, albeit
turning the protocol to a probabilistic one. We also show how one can convert
the GTC protocol to the teleportation protocol via proper unitary operations.Comment: 6 pages, 1 figure, RevTex4; v2: published version, 8 pages, 4
figures, RevTex4, to appear at Eur. Phys. J.
Four Photon Entanglement from Down Conversion
Double-pair emission from type-II parametric down conversion results in a
highly entangled 4-photon state. Due to interference, which is similar to
bunching from thermal emission, this state is not simply a product of two
pairs. The observation of this state can be achieved by splitting the two
emission modes at beam splitters and subsequent detection of a photon in each
output. Here we describe the features of this state and give a Bell theorem for
a 4-photon test of local realistic hidden variable theories.Comment: 5 pages, 1 figure, submitted to PR
- …