arXiv subjects

T. Mor

Publications and source records attributed to T. Mor.

7 recordsLinked to original sources

arXiv1999

Unextendible Product Bases and Bound Entanglement

An unextendible product basis (UPB) for a multipartite quantum system is an incomplete orthogonal product basis whose complementary subspace contains no product state. We give examples of UPBs, and show that the uniform mixed state over the subspace complementary to any UPB is a bound entangled state. We exhibit a tripartite 2x2x2 UPB whose complementary mixed state has tripartite entanglement but no bipartite entanglement, i.e. all three corresponding 2x4 bipartite mixed states are unentangled. We show that members of a UPB are not perfectly distinguishable by local POVMs and classical communication.

quant-ph↗

arXiv1997

Bounds on Information and the Security of Quantum Cryptography

Strong attacks against quantum key distribution use quantum memories and quantum gates to attack directly the final key. In this paper we extend a novel security result recently obtained, to demonstrate proofs of security against a wide class of such attacks. To reach this goal we calculate information-dependent reduced density matrices, we study the geometry of quantum mixed states, and we find bounds on the information leaked to an eavesdropper. Our result suggests that quantum cryptography is ultimately secure.

quant-ph↗

arXiv1996

Reducing Quantum Errors and Improving Large Scale Quantum Cryptography

Noise causes severe difficulties in implementing quantum computing and quantum cryptography. Several schemes have been suggested to reduce this problem, mainly focusing on quantum computation. Motivated by quantum cryptography, we suggest a coding which uses $N$ quantum bits ($N=n^2$) to encode one quantum bit, and reduces the error exponentially with $n$. Our result suggests the possibility of distributing a secure key over very long distances, and maintaining quantum states for very long times. It also provides a new quantum privacy amplification against a strong adversary.

quant-ph↗

arXiv1996

TelePOVM -- New Faces of Teleportation

We show two new aspects of teleportation based on generalized measurements: I. We present an alternative approach to teleportation based on ``generating $ρ$-ensembles at spacetime separation''; This approach provides a better understanding of teleportation. II. We define the concept of {\em conclusive teleportation} and we show how to teleport a quantum state using any pure entangled state; we show how to use the conclusive teleportation as a criterion for non-locality.

quant-ph↗

arXiv1996

On the Security of Quantum Cryptography Against Collective Attacks

We present strong attacks against quantum key distribution schemes which use quantum memories and quantum gates to attack directly the final key. We analyze a specific attack of this type, for which we find the density matrices available to the eavesdropper and the optimal information which can be extracted from them. We prove security against this attack and discuss security against any attack allowed by the rules of quantum mechanics.

quant-ph↗

arXiv1996

The Parity Bit in Quantum Cryptography

An $n$-bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that $n$-bit string is described by one of two density matrices, $ρ_0^{(n)}$ and $ρ_1^{(n)}$, both in a Hilbert space of dimension $2^n$. 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.

quant-ph↗

arXiv1995

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.

quant-ph↗