Improvement of stabilizer based entanglement distillation protocols by encoding operators

This paper presents a method for enumerating all encoding operators in the Clifford group for a given stabilizer. Furthermore, we classify encoding operators into the equivalence classes such that EDPs (Entanglement Distillation Protocol) constructed from encoding operators in the same equivalence class have the same performance. By this classification, for a given parameter, the number of candidates for good EDPs is significantly reduced. As a result, we find the best EDP among EDPs constructed from [[4,2]] stabilizer codes. This EDP has a better performance than previously known EDPs over wide range of fidelity.Comment: 22 pages, 2 figures, In version 2, we enumerate all encoding operators in the Clifford group, and fix the wrong classification of encoding operators in version

Unified derivations of measurement-based schemes for quantum computation

We present unified, systematic derivations of schemes in the two known measurement-based models of quantum computation. The first model (introduced by Raussendorf and Briegel [Phys. Rev. Lett., 86, 5188 (2001)]) uses a fixed entangled state, adaptive measurements on single qubits, and feedforward of the measurement results. The second model (proposed by Nielsen [Phys. Lett. A, 308, 96 (2003)] and further simplified by Leung [Int. J. Quant. Inf., 2, 33 (2004)]) uses adaptive two-qubit measurements that can be applied to arbitrary pairs of qubits, and feedforward of the measurement results. The underlying principle of our derivations is a variant of teleportation introduced by Zhou, Leung, and Chuang [Phys. Rev. A, 62, 052316 (2000)]. Our derivations unify these two measurement-based models of quantum computation and provide significantly simpler schemes.Comment: 14 page

Encoding a qubit in an oscillator

Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of phase space to protect against errors that shift the values of the canonical variables q and p. In the setting of quantum optics, fault-tolerant universal quantum computation can be executed on the protected code subspace using linear optical operations, squeezing, homodyne detection, and photon counting; however, nonlinear mode coupling is required for the preparation of the encoded states. Finite-dimensional versions of these codes can be constructed that protect encoded quantum information against shifts in the amplitude or phase of a d-state system. Continuous-variable codes can be invoked to establish lower bounds on the quantum capacity of Gaussian quantum channels.Comment: 22 pages, 8 figures, REVTeX, title change (qudit -> qubit) requested by Phys. Rev. A, minor correction

Methodology for quantum logic gate constructions

We present a general method to construct fault-tolerant quantum logic gates with a simple primitive, which is an analog of quantum teleportation. The technique extends previous results based on traditional quantum teleportation (Gottesman and Chuang, Nature {\bf 402}, 390, 1999) and leads to straightforward and systematic construction of many fault-tolerant encoded operations, including the $\pi/8$ and Toffoli gates. The technique can also be applied to the construction of remote quantum operations that cannot be directly performed.Comment: 17 pages, mypsfig2, revtex. Revised with a different title, a new appendix for clarifying fault-tolerant preparation of quantum states, and various minor change

Quantum key distribution using a triggered quantum dot source emitting near 1.3 microns

We report the distribution of a cryptographic key, secure from photon number splitting attacks, over 35 km of optical fiber using single photons from an InAs quantum dot emitting ~1.3 microns in a pillar microcavity. Using below GaAs-bandgap optical excitation, we demonstrate suppression of multiphoton emission to 10% of the Poissonian level without detector dark count subtraction. The source is incorporated into a phase encoded interferometric scheme implementing the BB84 protocol for key distribution over standard telecommunication optical fiber. We show a transmission distance advantage over that possible with (length-optimized) uniform intensity weak coherent pulses at 1310 nm in the same system.Comment: 4 pages, 4 figure

Outline of the SECOQC Quantum-Key-Distribution Network in Vienna

A Quantum Key Distribution (QKD) network is currently implemented in Vienna by integrating seven QKD-Link devices that connect five subsidiaries of SIEMENS Austria. We give an architectural overview of the network and present the enabling QKD-technologies, as well as the novel QKD network protocols.Comment: 10 pages, 5 figure

Quantum key distribution using non-classical photon number correlations in macroscopic light pulses

We propose a new scheme for quantum key distribution using macroscopic non-classical pulses of light having of the order 10^6 photons per pulse. Sub-shot-noise quantum correlation between the two polarization modes in a pulse gives the necessary sensitivity to eavesdropping that ensures the security of the protocol. We consider pulses of two-mode squeezed light generated by a type-II seeded parametric amplification process. We analyze the security of the system in terms of the effect of an eavesdropper on the bit error rates for the legitimate parties in the key distribution system. We also consider the effects of imperfect detectors and lossy channels on the security of the scheme.Comment: Modifications:added new eavesdropping attack, added more references Submitted to Physical Review A [email protected]

Upper bounds for the secure key rate of decoy state quantum key distribution

The use of decoy states in quantum key distribution (QKD) has provided a method for substantially increasing the secret key rate and distance that can be covered by QKD protocols with practical signals. The security analysis of these schemes, however, leaves open the possibility that the development of better proof techniques, or better classical post-processing methods, might further improve their performance in realistic scenarios. In this paper, we derive upper bounds on the secure key rate for decoy state QKD. These bounds are based basically only on the classical correlations established by the legitimate users during the quantum communication phase of the protocol. The only assumption about the possible post-processing methods is that double click events are randomly assigned to single click events. Further we consider only secure key rates based on the uncalibrated device scenario which assigns imperfections such as detection inefficiency to the eavesdropper. Our analysis relies on two preconditions for secure two-way and one-way QKD: The legitimate users need to prove that there exists no separable state (in the case of two-way QKD), or that there exists no quantum state having a symmetric extension (one-way QKD), that is compatible with the available measurements results. Both criteria have been previously applied to evaluate single-photon implementations of QKD. Here we use them to investigate a realistic source of weak coherent pulses. The resulting upper bounds can be formulated as a convex optimization problem known as a semidefinite program which can be efficiently solved. For the standard four-state QKD protocol, they are quite close to known lower bounds, thus showing that there are clear limits to the further improvement of classical post-processing techniques in decoy state QKD.Comment: 10 pages, 3 figure

Classicality in discrete Wigner functions

Gibbons et al. [Phys. Rev. A 70, 062101(2004)] have recently defined a class of discrete Wigner functions W to represent quantum states in a Hilbert space with finite dimension. We show that the only pure states having non-negative W for all such functions are stabilizer states, as conjectured by one of us [Phys. Rev. A 71, 042302 (2005)]. We also show that the unitaries preserving non-negativity of W for all definitions of W form a subgroup of the Clifford group. This means pure states with non-negative W and their associated unitary dynamics are classical in the sense of admitting an efficient classical simulation scheme using the stabilizer formalism.Comment: 10 pages, 1 figur

Experimental requirements for Grover's algorithm in optical quantum computation

The field of linear optical quantum computation (LOQC) will soon need a repertoire of experimental milestones. We make progress in this direction by describing several experiments based on Grover's algorithm. These experiments range from a relatively simple implementation using only a single non-scalable CNOT gate to the most complex, requiring two concatenated scalable CNOT gates, and thus form a useful set of early milestones for LOQC. We also give a complete description of basic LOQC using polarization-encoded qubits, making use of many simplifications to the original scheme of Knill, Laflamme, and Milburn.Comment: 9 pages, 8 figure