Robust polarization-based quantum key distribution over collective-noise channel

We present two polarization-based protocols for quantum key distribution. The protocols encode key bits in noiseless subspaces or subsystems, and so can function over a quantum channel subjected to an arbitrary degree of collective noise, as occurs, for instance, due to rotation of polarizations in an optical fiber. These protocols can be implemented using only entangled photon-pair sources, single-photon rotations, and single-photon detectors. Thus, our proposals offer practical and realistic alternatives to existing schemes for quantum key distribution over optical fibers without resorting to interferometry or two-way quantum communication, thereby circumventing, respectively, the need for high precision timing and the threat of Trojan horse attacks.Comment: Minor changes, added reference

Developing the Deutsch-Hayden approach to quantum mechanics

The formalism of Deutsch and Hayden is a useful tool for describing quantum mechanics explicitly as local and unitary, and therefore quantum information theory as concerning a "flow" of information between systems. In this paper we show that these physical descriptions of flow are unique, and develop the approach further to include the measurement interaction and mixed states. We then give an analysis of entanglement swapping in this approach, showing that it does not in fact contain non-local effects or some form of superluminal signalling.Comment: 14 pages. Added section on entanglement swappin

Three-intensity decoy state method for device independent quantum key distribution with basis dependent errors

We study the measurement device independent quantum key distribution (MDIQKD) in practice with limited resource, when there are only 3 different states in implementing the decoy-state method and when there are basis dependent coding errors. We present general formulas for the decoy-state method for two-pulse sources with 3 different states, which can be applied to the recently proposed MDIQKD with imperfect single-photon source such as the coherent states or the heralded states from the parametric down conversion. We point out that the existing result for secure QKD with source coding errors does not always hold. We find that very accurate source coding is not necessary. In particular, we loosen the precision of existing result by several magnitude orders for secure QKD.Comment: Published version with Eq.(17) corrected. We emphasize that our major result (Eq.16) for the decoy-state part can be applied to generate a key rate very close to the ideal case of using infinite different coherent states, as was numerically demonstrated in Ref.[21]. Published in PRA, 2013, Ja

The state space for two qutrits has a phase space structure in its core

We investigate the state space of bipartite qutrits. For states which are locally maximally mixed we obtain an analog of the ``magic'' tetrahedron for bipartite qubits--a magic simplex W. This is obtained via the Weyl group which is a kind of ``quantization'' of classical phase space. We analyze how this simplex W is embedded in the whole state space of two qutrits and discuss symmetries and equivalences inside the simplex W. Because we are explicitly able to construct optimal entanglement witnesses we obtain the border between separable and entangled states. With our method we find also the total area of bound entangled states of the parameter subspace under intervestigation. Our considerations can also be applied to higher dimensions.Comment: 3 figure

Repeat-Until-Success quantum computing using stationary and flying qubits

We introduce an architecture for robust and scalable quantum computation using both stationary qubits (e.g. single photon sources made out of trapped atoms, molecules, ions, quantum dots, or defect centers in solids) and flying qubits (e.g. photons). Our scheme solves some of the most pressing problems in existing non-hybrid proposals, which include the difficulty of scaling conventional stationary qubit approaches, and the lack of practical means for storing single photons in linear optics setups. We combine elements of two previous proposals for distributed quantum computing, namely the efficient photon-loss tolerant build up of cluster states by Barrett and Kok [Phys. Rev. A 71, 060310(R) (2005)] with the idea of Repeat-Until-Success (RUS) quantum computing by Lim et al. [Phys. Rev. Lett. 95, 030505 (2005)]. This idea can be used to perform eventually deterministic two-qubit logic gates on spatially separated stationary qubits via photon pair measurements. Under non-ideal conditions, where photon loss is a possibility, the resulting gates can still be used to build graph states for one-way quantum computing. In this paper, we describe the RUS method, present possible experimental realizations, and analyse the generation of graph states.Comment: 14 pages, 7 figures, minor changes, references and a discussion on the effect of photon dark counts adde

The Impossibility Of Secure Two-Party Classical Computation

We present attacks that show that unconditionally secure two-party classical computation is impossible for many classes of function. Our analysis applies to both quantum and relativistic protocols. We illustrate our results by showing the impossibility of oblivious transfer.Comment: 10 page

Passive faraday mirror attack in practical two-way quantum key distribution system

The faraday mirror (FM) plays a very important role in maintaining the stability of two way plug-and-play quantum key distribution (QKD) system. However, the practical FM is imperfect, which will not only introduce additional quantum bit error rate (QBER) but also leave a loophole for Eve to spy the secret key. In this paper, we propose a passive faraday mirror attack in two way QKD system based on the imperfection of FM. Our analysis shows that, if the FM is imperfect, the dimension of Hilbert space spanned by the four states sent by Alice is three instead of two. Thus Eve can distinguish these states with a set of POVM operators belonging to three dimension space, which will reduce the QBER induced by her attack. Furthermore, a relationship between the degree of the imperfection of FM and the transmittance of the practical QKD system is obtained. The results show that, the probability that Eve loads her attack successfully depends on the degree of the imperfection of FM rapidly, but the QBER induced by Eve's attack changes with the degree of the imperfection of FM slightly

Comment on "Resilience of gated avalanche photodiodes against bright illumination attacks in quantum cryptography"

This is a comment on the publication by Yuan et al. [Appl. Phys. Lett. 98, 231104 (2011); arXiv:1106.2675v1 [quant-ph]].Comment: 2 page

Counterfactual Quantum Cryptography

Quantum cryptography allows one to distribute a secret key between two remote parties using the fundamental principles of quantum mechanics. The well-known established paradigm for the quantum key distribution relies on the actual transmission of signal particle through a quantum channel. This paper shows that the task of a secret key distribution can be accomplished even though a particle carrying secret information is not in fact transmitted through the quantum channel. The proposed protocols can be implemented with current technologies and provide practical security advantages by eliminating the possibility that an eavesdropper can directly access the entire quantum system of each signal particle.Comment: 19 pages, 1 figure; a little ambiguity in the version 1 removed; abstract, text, references, and appendix revised; suggestions and comments are highly appreciate

Greenberger-Horne-Zeilinger paradoxes for many qudits

We construct GHZ contradictions for three or more parties sharing an entangled state, the dimension d of each subsystem being an even integer greater than 2. The simplest example that goes beyond the standard GHZ paradox (three qubits) involves five ququats (d=4). We then examine the criteria a GHZ paradox must satisfy in order to be genuinely M-partite and d-dimensional.Comment: 5 pages RevTe