Related papers: The Parity Bit in Quantum Cryptography
We propose a realization of a charge parity meter based on two double quantum dots alongside a quantum point contact. Such a device is a specific example of the general class of mesoscopic quadratic quantum measurement detectors previously…
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum worlds. But when committing to a string of n bits at once, how far can we stretch the quantum limits? In this paper, we…
We investigate the information provided about a specified distributed apparatus of n units in the measurement of a quantum state. It is shown that, in contrast to such measurement of a classical state, which is bounded by log (n+1) bits,…
We analyse orthogonal bases in a composite $N\times N$ Hilbert space describing a bipartite quantum system and look for a basis with optimal single-sided mutual state distinguishability. This condition implies that in each subsystem the…
We describe a quantum cryptography protocol with up to twenty four-dimensional ($\mathcal{D} =4$) states generated by a polarization-, phase- and time-encoding transmitter. This protocol can be experimentally realized with existing…
We discuss the unambiguous measurement of quantum nonorthogonal states in connection with the quantum cryptography. We show that checking a ratio of null one to signal is essential in detecting a certain kind of eavesdropping in the case of…
A parity measurement on two qubits, each consisting of a single atom in a cavity, can be realized by measuring the phase shift of a probe beam, which interacts sequentially with the two qubits, but imperfections lead to decoherence within…
Parity measurement is a key step in many entanglement generation and quantum error correction schemes. We propose a protocol for non-destructive parity measurement of two remote qubits, i.e., macroscopically separated qubits with no direct…
We show a tight lower bound of $\Omega(N \log\log N)$ on the number of transmissions required to compute the parity of $N$ input bits with constant error in a noisy communication network of $N$ randomly placed sensors, each having one input…
We study recovering parity check relations for an unknown code from intercepted bitstream received from Binary Symmetric Channel in this paper. An iterative column elimination algorithm is introduced which attempts to eliminate parity bits…
Error filtration is a method for encoding the quantum state of a single particle into a higher dimensional Hilbert space in such a way that it becomes less sensitive to phase noise. We experimentally demonstrate this method by distributing…
We derive two complementarity relations that constrain the individual and bipartite properties that may simultaneously exist in a multi-qubit system. The first expression, valid for an arbitrary pure state of n qubits, demonstrates that the…
In this thesis we study the problem of unambiguously discriminating two mixed quantum states. We first present reduction theorems for optimal unambiguous discrimination of two generic density matrices. We show that this problem can be…
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…
We discuss properties of probabilistic coding of two qubits to one qutrit and generalize the scheme to higher dimensions. We show that the protocol preservers entanglement between qubits to be encoded and environment and can be also applied…
A quantum string seal encodes the value of a (bit) string as a quantum state in such a way that everyone can extract a non-negligible amount of available information on the string by a suitable measurement. Moreover, such measurement must…
We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest…
We investigate the utility of parity detection to achieve Heisenberg-limited phase estimation for optical interferometry. We consider the parity detection with several input states that have been shown to exhibit sub shot-noise…
The "Power of One Qubit" refers to a computational model that has access to only one pure bit of quantum information, along with n qubits in the totally mixed state. This model, though not as powerful as a pure-state quantum computer, is…
We present the NMR implementation of a recently proposed quantum algorithm to find the parity of a permutation. In the usual qubit model of quantum computation, speedup requires the presence of entanglement and thus cannot be achieved by a…