Searcharxiv⌕ Search

arXiv subjects

Samuel L. Braunstein

Publications and source records attributed to Samuel L. Braunstein.

At least 127 records · Page 7Linked to original sources
arXiv2000

Quantum no-deleting principle and some of its implications

Unmeasureability of a quantum state has important consequences in practical implementation of quantum computers. Like copying, deleting of an unknown state from among several copies is prohibited. This is called no-deletion prinicple. Here, we present a no deleting principle for qudits. We obtain a bound on $N$-to-$M$ deleting and show that the quality of deletion drops exponentially with the number of copies to be deleted. In addition, we investigate conditional, state-dependent and approximate quantum deleting of unknown states. We prove that unitarity does not allow us to delete copies from an alphabet of two non-orthogonal states exactly. Further, we show that no-deleting principle is consistent with no-signalling.

quant-ph↗
arXiv2000

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 an unknown photon. 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 can 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 might be useful in quantum computation, where one could store some new information in an already computed state by deleting the old information. Here we show 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 against a copy, the same task cannot be accomplished with quantum information.

quant-ph↗
arXiv2000

Unconditional teleportation of continuous-variable entanglement

We give a protocol and criteria for demonstrating unconditional teleportation of continuous-variable entanglement (i.e., entanglement swapping). The initial entangled states are produced with squeezed light and linear optics. We show that any nonzero entanglement (any nonzero squeezing) in both of two entanglement sources is sufficient for entanglement swapping to occur. In fact, realization of continuous-variable entanglement swapping is possible using only {\it two} single-mode squeezed states.

quant-ph↗
arXiv2000

Multipartite entanglement for continuous variables: A quantum teleportation network

We show that {\it one} single-mode squeezed state distributed among $N$ parties using linear optics suffices to produce a truly $N$-partite entangled state for any nonzero squeezing and arbitrarily many parties. From this $N$-partite entangled state, via quadrature measurements of $N-2$ modes, bipartite entanglement between any two of the $N$ parties can be `distilled', which enables quantum teleportation with an experimentally determinable fidelity better than could be achieved in any classical scheme.

quant-ph↗
arXiv2000

Broadband teleportation

Quantum teleportation of an unknown broadband electromagnetic field is investigated. The continuous-variable teleportation protocol by Braunstein and Kimble [Phys. Rev. Lett. {\bf 80}, 869 (1998)] for teleporting the quantum state of a single mode of the electromagnetic field is generalized for the case of a multimode field with finite bandwith. We discuss criteria for continuous-variable teleportation with various sets of input states and apply them to the teleportation of broadband fields. We first consider as a set of input fields (from which an independent state preparer draws the inputs to be teleported) arbitrary pure Gaussian states with unknown coherent amplitude (squeezed or coherent states). This set of input states, further restricted to an alphabet of coherent states, was used in the experiment by Furusawa {\it et al.} [Science {\bf 282}, 706 (1998)]. It requires unit-gain teleportation for optimizing the teleportation fidelity. In our broadband scheme, the excess noise added through unit-gain teleportation due to the finite degree of the squeezed-state entanglement is just twice the (entanglement) source's squeezing spectrum for its ``quiet quadrature.'' The teleportation of one half of an entangled state (two-mode squeezed vacuum state), i.e., ``entanglement swapping,'' and its verification are optimized under a certain nonunit gain condition. We will also give a broadband description of this continuous-variable entanglement swapping based on the single-mode scheme by van Loock and Braunstein [Phys. Rev. A {\bf 61}, 10302 (2000)]

quant-ph↗
arXiv2000

Quantum searching with continuous variables

A fast quantum search algorithm for continuous variables is presented. The result is the quantum continuous variable analog of Grover's algorithm originally proposed for qubits. A continuous variable analog of the Hadamard (i.e., Fourier transform) operation is used in conjunction with inversion about the average of quantum states to allow the approximate identification of an unknown quantum state in a way that gives a square-root speed-up over search algorithms using classical continuous variables. Also, we show that this quantum search algorithm is robust for a generalised Fourier transformation on continuous variables.

quant-ph↗
arXiv2000

Greenberger-Horne-Zeilinger nonlocality in phase space

We show that the continuous-variable analogues to the multipartite entangled Greenberger-Horne-Zeilinger states of qubits violate Bell-type inequalities imposed by local realistic theories. Our results suggest that the degree of nonlocality of these nonmaximally entangled continuous-variable states, represented by the maximum violation, grows with increasing number of parties. This growth does not appear to be exponentially large as for the maximally entangled qubit states, but rather decreases for larger numbers of parties.

quant-ph↗
arXiv2000

Quantum Interferometric Optical Lithography: Exploiting Entanglement to Beat The Diffraction Limit

Classical, interferometric, optical lithography is diffraction limited to writing features of a size lambda/2 or greater, where lambda is the optical wavelength. Using nonclassical photon number states, entangled N at a time, we show that it is possible to write features of minimum size lambda/(2N) in an N-photon absorbing substrate. This result surpasses the usual classical diffraction limit by a factor of N. Since the number of features that can be etched on a two-dimensional surface scales inversely as the square of the feature size, this allows one to write a factor of N^2 more elements on a semiconductor chip. A factor of N = 2 can be achieved easily with entangled photon pairs generated from optical parametric downconversion. It is shown how to write arbitrary 2D patterns by using this method.

quant-ph↗
arXiv2000

Postselected versus nonpostselected quantum teleportation using parametric down-conversion

We study the experimental realisation of quantum teleportation as performed by Bouwmeester {\em et al}. [Nature {\bf 390}, 575 (1997)] and the adjustments to it suggested by Braunstein and Kimble [Nature {\bf 394}, 841 (1998)]. These suggestions include the employment of a detector cascade and a relative slow-down of one of the two down-converters. We show that coincidences between photon-pairs from parametric down-conversion automatically probe the non-Poissonian structure of these sources. Furthermore, we find that detector cascading is of limited use, and that modifying the relative strengths of the down-conversion efficiencies will increase the time of the experiment to the order of weeks. Our analysis therefore points to the benefits of single-photon detectors in non-post-selected type experiments, a technology currently requiring roughly $6^{\circ}$K operating conditions.

quant-ph↗
arXiv1999

Criteria for Continuous-Variable Quantum Teleportation

We derive an experimentally testable criterion for the teleportation of quantum states of continuous variables. This criterion is especially relevant to the recent experiment of Furusawa et al. [Science 282, 706-709 (1998)] where an input-output fidelity of $0.58 \pm 0.02$ was achieved for optical coherent states. Our derivation demonstrates that fidelities greater than 1/2 could not have been achieved through the use of a classical channel alone; quantum entanglement was a crucial ingredient in the experiment.

quant-ph↗
arXiv1999

Dense Coding for Continuous Variables

A scheme to achieve dense quantum coding for the quadrature amplitudes of the electromagnetic field is presented. The protocol utilizes shared entanglement provided by nondegenerate parametric down conversion in the limit of large gain to attain high efficiency. For a constraint in the mean number of photons n associated with modulation in the signal channel, the channel capacity for dense coding is found to be ln(1+n+n^2), which always beats coherent-state communication and surpasses squeezed-state communication for n>1. For n>>1, the dense coding capacity approaches twice that of either scheme.

quant-ph↗
arXiv1999

Universal teleportation with a twist

We give a transfer theorem for teleportation based on twisting the entanglement measurement. This allows one to say what local unitary operation must be performed to complete the teleportation in any situation, generalizing the scheme to include overcomplete measurements, non-abelian groups of local unitary operations (e.g., angular momentum teleportation), and the effect of non-maximally entangled resources.

quant-ph↗
arXiv1999

Squeezing as an irreducible resource

We show that squeezing is an irreducible resource which remains invariant under transformations by linear optical elements. In particular, we give a decomposition of any optical circuit with linear input-output relations into a linear multiport interferometer followed by a unique set of single mode squeezers and then another multiport interferometer. Using this decomposition we derive a no-go theorem for superpositions of macroscopically distinct states from single-photon detection. Further, we demonstrate the equivalence between several schemes for randomly creating polarization-entangled states. Finally, we derive minimal quantum optical circuits for ideal quantum non-demolition coupling of quadrature-phase amplitudes.

quant-ph↗
arXiv1999

A quantum analog of Huffman coding

We analyze a generalization of Huffman coding to the quantum case. In particular, we notice various difficulties in using instantaneous codes for quantum communication. Nevertheless, for the storage of quantum information, we have succeeded in constructing a Huffman-coding inspired quantum scheme. The number of computational steps in the encoding and decoding processes of N quantum signals can be made to be of polylogarithmic depth by a massively parallel implementation of a quantum gate array. This is to be compared with the O (N^3) computational steps required in the sequential implementation by Cleve and DiVincenzo of the well-known quantum noiseless block coding scheme of Schumacher. We also show that O(N^2(log N)^a) computational steps are needed for the communication of quantum information using another Huffman-coding inspired scheme where the sender must disentangle her encoding device before the receiver can perform any measurements on his signals.

quant-ph↗
arXiv1998

Quantum computation over continuous variables

This paper provides necessary and sufficient conditions for constructing a universal quantum computer over continuous variables. As an example, it is shown how a universal quantum computer for the amplitudes of the electromagnetic field might be constructed using simple linear devices such as beam-splitters and phase shifters, together with squeezers and nonlinear devices such as Kerr-effect fibers and atoms in optical cavities. Such a device could in principle perform `quantum floating point' computations. Problems of noise, finite precision, and error correction are discussed.

quant-ph↗
arXiv1998

A posteriori teleportation

The article by Bouwmeester et al. on experimental quantum teleportation constitutes an important advance in the burgeoning field of quantum information. The experiment was motivated by the proposal of Bennett et al. in which an unknown quantum state is `teleported' by Alice to Bob. As illustrated in Fig. 1, in the implementation of this procedure, by Bouwmeester et al., an input quantum state is `disembodied' into quantum and classical components, as in the original protocol. However, in contrast to the original scheme, Bouwmeester et al.'s procedure necessarily destroys the state at Bob's receiving terminal, so a `teleported' state can never emerge as a freely propagating state for subsequent examination or exploitation. In fact, teleportation is achieved only as a postdiction.

quant-ph↗
arXiv1997

Direct and indirect strategies for phase measurement

Recently, Torgerson and Mandel [Phys. Rev. Lett. 76, 3939 (1996)] have reported a disagreement between two schemes for measuring the phase difference of a pair of optical fields. We analyze these schemes and derive their associated phase-difference probability distributions, including both their strong and weak field limits. Our calculation confirms the main point of Torgerson and Mandel of the non-uniqueness of an operational definition of the phase distribution. We further discuss the role of postselection of data and argue that it cannot meaningfully improve the sensitivity.

quant-ph↗