36,879 research outputs found
A Universal Two--Bit Gate for Quantum Computation
We prove the existence of a class of two--input, two--output gates any one of
which is universal for quantum computation. This is done by explicitly
constructing the three--bit gate introduced by Deutsch [Proc.~R.~Soc.~London.~A
{\bf 425}, 73 (1989)] as a network consisting of replicas of a single two--bit
gate.Comment: 3 pages, RevTeX, two figures in a uuencoded fil
A Measure of Stregth of an Unextendible Product Basis
A notion of strength of an unextendible product basis is introduced and a
quantitative measure for it is suggested with a view to providing an indirect
measure for the bound entanglement of formation of the bound entangled mixed
state associated with an unextendible product basis.Comment: 4 pages, Latex, 1 figure, remarks, criticisms welcom
Quantum Cryptography with Coherent States
The safety of a quantum key distribution system relies on the fact that any
eavesdropping attempt on the quantum channel creates errors in the
transmission. For a given error rate, the amount of information that may have
leaked to the eavesdropper depends on both the particular system and the
eavesdropping strategy. In this work, we discuss quantum cryptographic
protocols based on the transmission of weak coherent states and present a new
system, based on a symbiosis of two existing ones, and for which the
information available to the eavesdropper is significantly reduced. This system
is therefore safer than the two previous ones. We also suggest a possible
experimental implementation.Comment: 20 pp. Revtex, Figures available from the authors upon request, To be
published in PRA (March 95
Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
We prove the security of the 1984 protocol of Bennett and Brassard (BB84) for
quantum key distribution. We first give a key distribution protocol based on
entanglement purification, which can be proven secure using methods from Lo and
Chau's proof of security for a similar protocol. We then show that the security
of this protocol implies the security of BB84. The entanglement-purification
based protocol uses Calderbank-Shor-Steane (CSS) codes, and properties of these
codes are used to remove the use of quantum computation from the Lo-Chau
protocol.Comment: 5 pages, Latex, minor changes to improve clarity and fix typo
Classical communication and non-classical fidelity of quantum teleportation
In quantum teleportation, the role of entanglement has been much discussed.
It is known that entanglement is necessary for achieving non-classical
teleportation fidelity. Here we focus on the amount of classical communication
that is necessary to obtain non-classical fidelity in teleportation. We
quantify the amount of classical communication that is sufficient for achieving
non-classical fidelity for two independent 1-bit and single 2-bits noisy
classical channels. It is shown that on average 0.208 bits of classical
communication is sufficient to get non-classical fidelity. We also find the
necessary amount of classical communication in case of isotropic
transformation. Finally we study how the amount of sufficient classical
communication increases with weakening of entanglement used in the
teleportation process.Comment: Accepted in Quantum Info. Proces
Quantum cobwebs: Universal entangling of quantum states
Entangling an unknown qubit with one type of reference state is generally
impossible. However, entangling an unknown qubit with two types of reference
states is possible. To achieve this, we introduce a new class of states called
zero sum amplitude (ZSA) multipartite, pure entangled states for qubits and
study their salient features. Using shared-ZSA state, local operation and
classical communication we give a protocol for creating multipartite entangled
states of an unknown quantum state with two types of reference states at remote
places. This provides a way of encoding an unknown pure qubit state into a
multiqubit entangled state. We quantify the amount of classical and quantum
resources required to create universal entangled states. This is possibly a
strongest form of quantum bit hiding with multiparties.Comment: Invited talk in II Winter Institute on FQTQO: Quantum Information
Processing, held at S. N. Bose Center for Basic Science, Kolkata, during Jan
2-11, 2002. (To appear in Pramana-J. of Physics, 2002.
Quantum privacy amplification and the security of quantum cryptography over noisy channels
Existing quantum cryptographic schemes are not, as they stand, operable in
the presence of noise on the quantum communication channel. Although they
become operable if they are supplemented by classical privacy-amplification
techniques, the resulting schemes are difficult to analyse and have not been
proved secure. We introduce the concept of quantum privacy amplification and a
cryptographic scheme incorporating it which is provably secure over a noisy
channel. The scheme uses an `entanglement purification' procedure which,
because it requires only a few quantum Controlled-Not and single-qubit
operations, could be implemented using technology that is currently being
developed. The scheme allows an arbitrarily small bound to be placed on the
information that any eavesdropper may extract from the encrypted message.Comment: 13 pages, Latex including 2 postcript files included using psfig
macro
The Parity Bit in Quantum Cryptography
An -bit string is encoded as a sequence of non-orthogonal quantum states.
The parity bit of that -bit string is described by one of two density
matrices, and , both in a Hilbert space of
dimension . In order to derive the parity bit the receiver must
distinguish between the two density matrices, e.g., in terms of optimal mutual
information. In this paper we find the measurement which provides the optimal
mutual information about the parity bit and calculate that information. We
prove that this information decreases exponentially with the length of the
string in the case where the single bit states are almost fully overlapping. We
believe this result will be useful in proving the ultimate security of quantum
crytography in the presence of noise.Comment: 19 pages, RevTe
- âŠ