The Parity Bit in Quantum Cryptography

Abstract

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, ${\rho }_0^{(n)}$ and ${\rho }_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.

19 pages, RevTeX

References in corpus (2)

• Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
• Quantum privacy amplification and the security of quantum cryptography over noisy channels

Cited by in corpus (18)

• Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
• On the Security of Quantum Cryptography Against Collective Attacks
• Quantum Cryptography with Imperfect Apparatus
• A Proof of the Security of Quantum Key Distribution
• Cryptographic Distinguishability Measures for Quantum Mechanical States
• Attacking quantum key distribution with single-photon two-qubit quantum logic
• Minimum-cost quantum measurements for quantum information
• Unconditionally Secure Quantum Coin Tossing
• Structural approach to unambiguous discrimination of two mixed quantum states
• Composable security against collective attacks of a modified BB84 QKD protocol with information only in one basis
• The information capacity of a single photon
• Cryptographic Quantum Bound on Nonlocality
• Commutator Relations Reveal Solvable Structures in Unambiguous State Discrimination
• Sequential quantum cloning under real-life conditions
• Role of causality in ensuring unconditional security of relativistic quantum cryptography
• A simple eavesdropping strategy of BB84 protocol
• Relativistic quantum protocols: "Bit Commitment" and "Coin Tossing"
• Efficient classical simulation of the Gisin-Massar quantum cloning machine