Related papers: The Parity Bit in Quantum Cryptography
A method of representing probabilistic aspects of quantum systems is introduced by means of a density function on the space of pure quantum states. In particular, a maximum entropy argument allows us to obtain a natural density function…
Given an unknown quantum state distributed over two systems, we determine how much quantum communication is needed to transfer the full state to one system. This communication measures the "partial information" one system needs conditioned…
This document focuses on translating various information-theoretic measures of distinguishability for probability distributions into measures of distin- guishability for quantum states. These measures should have important appli- cations in…
We present a necessary and sufficient condition to determine the entanglement status of an arbitrary N-qubit quantum state (may be pure or mixed) represented by the density matrix, (Rho)N. We develop a new approach and a new criterion for…
Parity measurements on qubits can generate the entanglement resource necessary for scalable quantum computation. Here we describe a method for fast optical parity measurements on electron spin qubits within coupled quantum dots. The…
The discrimination of two nonorthogonal states is a fundamental element for secure and efficient communication. Quantum measurements of nonorthogonal coherent states can enhance information transfer beyond the limits of conventional…
The phenomenon of data hiding, i.e. the existence of pairs of states of a bipartite system that are perfectly distinguishable via general entangled measurements yet almost indistinguishable under LOCC, is a distinctive signature of…
We consider the one-bit quantizer that minimizes the mean squared error for a source living in a real Hilbert space. The optimal quantizer is a projection followed by a thresholding operation, and we provide methods for identifying the…
Every quantum state can be represented as a probability distribution over the outcomes of an informationally complete measurement. But not all probability distributions correspond to quantum states. Quantum state space may thus be thought…
Secret sharing allows three or more parties to share secret information which can only be decrypted through collaboration. It complements quantum key distribution as a valuable resource for securely distributing information. Here we take…
We provide an efficient method for computing the maximum likelihood mixed quantum state (with density matrix $\rho$) given a set of measurement outcome in a complete orthonormal operator basis subject to Gaussian noise. Our method works by…
The binary string matching problem consists in finding all the occurrences of a pattern in a text where both strings are built on a binary alphabet. This is an interesting problem in computer science, since binary data are omnipresent in…
There are two main factors limiting the performance of quantum key distribution --- channel transmission loss and noise. Previously, a linear bound was believed to put an upper limit on the rate-transmittance performance. Remarkably, the…
Using unstable particles which decay by emitting neutrinos, we propose a quantum bit commitment protocol that is humanly impossible to break. Neutrinos carry away quantum information, but their interaction with matter is so weak that it…
We propose a scheme for entanglement distribution among different single atoms trapped in separated cavities. In our scheme, by reflecting an input coherent optical pulse from a cavity with a single trapped atom, a controlled phase-shift…
Parity (XOR) classification requires detecting discrete, high-order feature interactions that smooth classical kernels cannot efficiently capture. We study how quantum kernel advantage depends on parity complexity, the number of features…
Many quantum key distribution analyses examine the link security in a subset of the full Hilbert space that is available to describe the system. In reality, information about the photon state can be embedded in correlations between the…
Common random string model is a popular model in classical cryptography with many constructions proposed in this model. We study a quantum analogue of this model called the common Haar state model, which was also studied in an independent…
Encoding in a high-dimensional Hilbert space improves noise resilience in quantum information processing. This approach, however, may result in cross-mode coupling and detection complexities, thereby reducing quantum cryptography…
String matching is a fundamental problem in computer science, with critical applications in text retrieval, bioinformatics, and data analysis. Among the numerous solutions that have emerged for this problem in recent decades,…