Samuel L. Braunstein

Quantum Information with Continuous Variables

Preface. About the Editors. Part I: Quantum Computing. 1. Quantum computing with qubits S.L. Braunstein, A.K. Pati. 2. Quantum computation over continuous variables S. Lloyd, S.L. Braunstein. 3. Error correction for continuous quantum variables S.L. Braunstein. 4. Deutsch-Jozsa algorithm for continuous variables A.K. Pati, S.L. Braunstein. 5. Hybrid quantum computing S. Lloyd. 6. Efficient classical simulation of continuous variable quantum information processes S.D. Bartlett, B.C. Sanders, S.L. Braunstein, K. Nemoto. Part II: Quantum Entanglement. 7. Introduction to entanglement-based protocols S.L. Braunstein, A.K. Pati. 8. Teleportation of continuous uantum variables S.L. Braunstein, H.J. Kimble. 9. Experimental realization of continuous variable teleportation A. Furusawa, H.J. Kimble. 10. Dense coding for continuous variables S.L. Braunstein, H.J. Kimble. 11. Multipartite Greenberger-Horne-Zeilinger paradoxes for continuous variables S. Massar, S. Pironio. 12. Multipartite entanglement for continuous variables P. van Loock, S.L. Braunstein. 13. Inseparability criterion for continuous variable systems Lu-Ming Duan, G. Giedke, J.I. Cirac, P. Zoller. 14. Separability criterion for Gaussian states R. Simon. 15. Distillability and entanglement purification for Gaussian states G. Giedke, Lu-Ming Duan, J.I. Cirac, P. Zoller. 16. Entanglement purification via entanglement swapping S. Parke, S. Bose, M.B. Plenio. 17. Bound entanglement for continuous variables is a rare phenomenon P. Horodecki, J.I. Cirac, M. Lewenstein. Part III: Continuous Variable Optical-Atomic Interfacing. 18. Atomic continuous variable processing and light-atoms quantum interface A. Kuzmich, E.S. Polzik. Part IV: Limits on Quantum Information and Cryptography. 19. Limitations on discrete quantum information and cryptography S.L. Braunstein, A.K. Pati. 20. Quantum cloning with continuous variables N.J. Cerf. 21. Quantum key distribution with continuous variables in optics T.C. Ralph. 22. Secure quantum key distribution using squeezed states D. Gottesman, J. Preskill. 23. Experimental demonstration of dense coding and quantum cryptography with continuous variables Kunchi Peng, Qing Pan, Jing Zhang, Changde Xie. 24. Quantum solitons in optical fibres: basic requisites for experimental quantum communication G. Leuchs, Ch. Silberhorn, E. Konig, P.K. Lam, A. Sizmann, N. Korolkova. Index.

Better late than never: information retrieval from black holes.

We show that, in order to preserve the equivalence principle until late times in unitarily evaporating black holes, the thermodynamic entropy of a black hole must be primarily entropy of entanglement across the event horizon. For such black holes, we show that the information entering a black hole becomes encoded in correlations within a tripartite quantum state, the quantum analogue of a one-time pad, and is only decoded into the outgoing radiation very late in the evaporation. This behavior generically describes the unitary evaporation of highly entangled black holes and requires no specially designed evolution. Our work suggests the existence of a matter-field sum rule for any fundamental theory.

Separability of Very Noisy Mixed States and Implications for NMR Quantum Computing

We give a constructive proof that all mixed states of N qubits in a sufficiently small neighborhood of the maximally mixed state are separable (unentangled). The construction provides an explicit representation of any such state as a mixture of product states. We give upper and lower bounds on the size of the neighborhood, which show that its extent decreases exponentially with the number of qubits. The bounds show that no entanglement appears in the physical states at any stage of present NMR experiments. Though this result raises questions about NMR quantum computation, further analysis would be necessary to assess the power of the general unitary transformations, which are indeed implemented in these experiments, in their action on separable states.

Quantum Computation over Continuous Variables

This paper provides necessary and sufficient conditions for constructing a universal qu computer over continuous variables. As an example, it is shown how a universal quantum co for the amplitudes of the electromagnetic field might be constructed using simple linear device as beam splitters and phase shifters, together with squeezers and nonlinear devices such as K fibers and atoms in optical cavities. Such a device could in principle perform “quantum flo point” computations. Problems involving noise, finite precision, and error correction are disc [S0031-9007(99)08418-5]

Generalized uncertainty relations: Theory, examples, and Lorentz invariance

The quantum-mechanical framework in which observables are associated with Hermitian operators is too narrow to discuss measurements of such important physical quantities as elapsed time or harmonic-oscillator phase. We introduce a broader framework that allows us to derive quantum-mechanical limits on the precision to which a parameter - e.g., elapsed time - may be determined via arbitrary data analysis of arbitrary measurements on N identically prepared quantum systems. The limits are expressed as generalized Mandelstam-Tamm uncertainty relations, which involve the operator that generates displacements of the parameter - e.g., the Hamiltonian operator in the case of elapsed time. This approach avoids entirely the problem of associating a Hermitian operator with the parameter. We illustrate the general formalism, first, with nonrelativistic uncertainty relations for spatial displacement and momentum, harmonic-oscillator phase and number of quanta, and time and energy and, second, with Lorentz-invariant uncertainty relations involving the displacement and Lorentz-rotation parameters of the Poincare group.

Side-channel-free quantum key distribution.

Quantum key distribution (QKD) offers the promise of absolutely secure communications. However, proofs of absolute security often assume perfect implementation from theory to experiment. Thus, existing systems may be prone to insidious side-channel attacks that rely on flaws in experimental implementation. Here we replace all real channels with virtual channels in a QKD protocol, making the relevant detectors and settings inside private spaces inaccessible while simultaneously acting as a Hilbert space filter to eliminate side-channel attacks. By using a quantum memory we find that we are able to bound the secret-key rate below by the entanglement-distillation rate computed over the distributed states.

Impossibility of deleting an unknown quantum state

A photon in an arbitrary polarization state cannot be cloned perfectly. But suppose that at our disposal we have several copies of a photon in an unknown state. Is it possible to delete the information content of one or more of these photons by a physical process? Specifically, if two photons are in the same initial polarization state, is there a mechanism that produces one photon in the same initial state and the other in some standard polarization state? If this could be done, then one would create a standard blank state onto which one could copy an unknown state approximately, by deterministic cloning or exactly, by probabilistic cloning. This could in principle be useful in quantum computation, where one could store new information in an already computed state by deleting the old information. Here we show, however, that the linearity of quantum theory does not allow us to delete a copy of an arbitrary quantum state perfectly. Though in a classical computer information can be deleted (reversibly) against a copy, the analogous task cannot be accomplished, even irreversibly, with quantum information.

Teleportation as a quantum computation

Abstract We present a simple implementation of quantum teleportation in terms of primitive operations in quantum computation.

Searching for highly entangled multi-qubit states

We present a simple numerical optimization procedure to search for highly entangled states of 2, 3, 4 and 5 qubits. We develop a computationally tractable entanglement measure based on the negative partial transpose criterion, which can be applied to quantum systems of an arbitrary number of qubits. The search algorithm attempts to optimize this entanglement cost function to find the maximal entanglement in a quantum system. We present highly entangled 4-qubit and 5-qubit states discovered by this search. We show that the 4-qubit state is not quite as entangled, according to two separate measures, as the conjectured maximally entangled Higuchi–Sudbery state. Using this measure, these states are more highly entangled than the 4-qubit and 5-qubit GHZ states. We also present a conjecture about the NPT measure, inspired by some of our numerical results, that the single-qubit reduced states of maximally entangled states are all totally mixed.

High-rate measurement-device-independent quantum cryptography

Stefano Pirandola, Carlo Ottaviani, Gaetana Spedalieri, Christian Weedbrook, Samuel L. Braunstein, Seth Lloyd, Tobias Gehring, Christian S. Jacobsen, and Ulrik L. Andersen Department of Computer Science, University of York, York YO10 5GH, United Kingdom Department of Physics, University of Toronto, Toronto M5S 3G4, Canada and QKD Corp., 112 College St., Toronto M5G 1L6, Canada MIT – Department of Mechanical Engineering and Research Laboratory of Electronics, Cambridge MA 02139, USA Department of Physics, Technical University of Denmark, Fysikvej, 2800 Kongens Lyngby, Denmark