• Publications
  • Influence
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.Expand
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 ofExpand
Teleportation of continuous quantum variables
Summary form only given. A particularly startling discovery by Bennett et al. is the possibility for teleportation of a quantum state, whereby an unknown state of a spin-1/2 particle is transportedExpand
Squeezing as an irreducible resource
Using the Bloch-Messiah reduction we show that squeezing is an ``irreducible'' resource which remains invariant under transformations by linear optical elements. In particular, this gives aExpand
The Laplacian of a Graph as a Density Matrix: A Basic Combinatorial Approach to Separability of Mixed States
Abstract.We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterizeExpand
Side-channel-free quantum key distribution.
All real channels are replaced 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. Expand
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 explicitExpand
Efficient classical simulation of continuous variable quantum information processes.
It is obtained that any quantum process that begins with unentangled Gaussian states, performs only transformations generated by Hamiltonians that are quadratic in the canonical operators, and involves only measurements of canonical operators and suitable operations conditioned on these measurements can be simulated efficiently on a classical computer. Expand
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 entanglementExpand
On Strong Superadditivity of the Entanglement of Formation
We employ a basic formalism from convex analysis to show a simple relation between the entanglement of formation EF and the conjugate function E* of the entanglement function E(ρ)=S(TrAρ). We thenExpand