838 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
Quantum Algorithm for the Collision Problem
In this note, we give a quantum algorithm that finds collisions in arbitrary
r-to-one functions after only O((N/r)^(1/3)) expected evaluations of the
function. Assuming the function is given by a black box, this is more efficient
than the best possible classical algorithm, even allowing probabilism. We also
give a similar algorithm for finding claws in pairs of functions. Furthermore,
we exhibit a space-time tradeoff for our technique. Our approach uses Grover's
quantum searching algorithm in a novel way.Comment: 8 pages, LaTeX2
Atemporal diagrams for quantum circuits
A system of diagrams is introduced that allows the representation of various
elements of a quantum circuit, including measurements, in a form which makes no
reference to time (hence ``atemporal''). It can be used to relate quantum
dynamical properties to those of entangled states (map-state duality), and
suggests useful analogies, such as the inverse of an entangled ket. Diagrams
clarify the role of channel kets, transition operators, dynamical operators
(matrices), and Kraus rank for noisy quantum channels. Positive (semidefinite)
operators are represented by diagrams with a symmetry that aids in
understanding their connection with completely positive maps. The diagrams are
used to analyze standard teleportation and dense coding, and for a careful
study of unambiguous (conclusive) teleportation. A simple diagrammatic argument
shows that a Kraus rank of 3 is impossible for a one-qubit channel modeled
using a one-qubit environment in a mixed state.Comment: Minor changes in references. Latex 32 pages, 13 figures in text using
PSTrick
A Lower Bound for Quantum Phase Estimation
We obtain a query lower bound for quantum algorithms solving the phase
estimation problem. Our analysis generalizes existing lower bound approaches to
the case where the oracle Q is given by controlled powers Q^p of Q, as it is
for example in Shor's order finding algorithm. In this setting we will prove a
log (1/epsilon) lower bound for the number of applications of Q^p1, Q^p2, ...
This bound is tight due to a matching upper bound. We obtain the lower bound
using a new technique based on frequency analysis.Comment: 7 pages, 1 figur
Low Cost and Compact Quantum Cryptography
We present the design of a novel free-space quantum cryptography system,
complete with purpose-built software, that can operate in daylight conditions.
The transmitter and receiver modules are built using inexpensive off-the-shelf
components. Both modules are compact allowing the generation of renewed shared
secrets on demand over a short range of a few metres. An analysis of the
software is shown as well as results of error rates and therefore shared secret
yields at varying background light levels. As the system is designed to
eventually work in short-range consumer applications, we also present a use
scenario where the consumer can regularly 'top up' a store of secrets for use
in a variety of one-time-pad and authentication protocols.Comment: 18 pages, 9 figures, to be published in New Journal of Physic
Fair Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated
players, who in principle do not trust each other, wish to establish a common
random bit. If we limit ourselves to classical communication, this task
requires either assumptions on the computational power of the players or it
requires them to send messages to each other with sufficient simultaneity to
force their complete independence. Without such assumptions, all classical
protocols are so that one dishonest player has complete control over the
outcome. If we use quantum communication, on the other hand, protocols have
been introduced that limit the maximal bias that dishonest players can produce.
However, those protocols would be very difficult to implement in practice
because they are susceptible to realistic losses on the quantum channel between
the players or in their quantum memory and measurement apparatus. In this
paper, we introduce a novel quantum protocol and we prove that it is completely
impervious to loss. The protocol is fair in the sense that either player has
the same probability of success in cheating attempts at biasing the outcome of
the coin flip. We also give explicit and optimal cheating strategies for both
players.Comment: 12 pages, 1 figure; various minor typos corrected in version
Unconditionally secure quantum bit commitment is impossible
The claim of quantum cryptography has always been that it can provide
protocols that are unconditionally secure, that is, for which the security does
not depend on any restriction on the time, space or technology available to the
cheaters. We show that this claim does not hold for any quantum bit commitment
protocol. Since many cryptographic tasks use bit commitment as a basic
primitive, this result implies a severe setback for quantum cryptography. The
model used encompasses all reasonable implementations of quantum bit commitment
protocols in which the participants have not met before, including those that
make use of the theory of special relativity.Comment: 4 pages, revtex. Journal version replacing the version published in
the proceedings of PhysComp96. This is a significantly improved version which
emphasis the generality of the resul
A de Finetti representation theorem for infinite dimensional quantum systems and applications to quantum cryptography
According to the quantum de Finetti theorem, if the state of an N-partite
system is invariant under permutations of the subsystems then it can be
approximated by a state where almost all subsystems are identical copies of
each other, provided N is sufficiently large compared to the dimension of the
subsystems. The de Finetti theorem has various applications in physics and
information theory, where it is for instance used to prove the security of
quantum cryptographic schemes. Here, we extend de Finetti's theorem, showing
that the approximation also holds for infinite dimensional systems, as long as
the state satisfies certain experimentally verifiable conditions. This is
relevant for applications such as quantum key distribution (QKD), where it is
often hard - or even impossible - to bound the dimension of the information
carriers (which may be corrupted by an adversary). In particular, our result
can be applied to prove the security of QKD based on weak coherent states or
Gaussian states against general attacks.Comment: 11 pages, LaTe
Is Quantum Bit Commitment Really Possible?
We show that all proposed quantum bit commitment schemes are insecure because
the sender, Alice, can almost always cheat successfully by using an
Einstein-Podolsky-Rosen type of attack and delaying her measurement until she
opens her commitment.Comment: Major revisions to include a more extensive introduction and an
example of bit commitment. Overlap with independent work by Mayers
acknowledged. More recent works by Mayers, by Lo and Chau and by Lo are also
noted. Accepted for publication in Phys. Rev. Let
Quantum Key Distribution Using Quantum Faraday Rotators
We propose a new quantum key distribution (QKD) protocol based on the fully
quantum mechanical states of the Faraday rotators. The protocol is
unconditionally secure against collective attacks for multi-photon source up to
two photons on a noisy environment. It is also robust against impersonation
attacks. The protocol may be implemented experimentally with the current
spintronics technology on semiconductors.Comment: 7 pages, 7 EPS figure
- …