arXiv subjects
Publications and source records attributed to Samuel L. Braunstein.
Using the stabilizer formalism we construct the minimal code into a D-dimensional Hilbert space (qudit) to protect a qubit against phase damping. The effectiveness of this code is then studied by means of input-output fidelity.
We demonstrate an unconditional high-fidelity teleporter capable of preserving the broadband entanglement in an optical squeezed state. In particular, we teleport a squeezed state of light and observe $-0.8 \pm 0.2$dB of squeezing in the teleported (output) state. We show that the squeezing criterion translates directly into a sufficient criterion for entanglement of the upper and lower sidebands of the optical field. Thus, this result demonstrates the first unconditional teleportation of broadband entanglement. Our teleporter achieves sufficiently high fidelity to allow the teleportation to be cascaded, enabling, in principle, the construction of deterministic non-Gaussian operations.
By introducing the concept of $ε$-convertibility, we extend Nielsen's and Vidal's theorems to the entanglement transformation of infinite-dimensional systems. Using an infinite-dimensional version of Vidal's theorem we derive a new stochastic-LOCC (SLOCC) monotone which can be considered as an extension of the Schmidt rank. We show that states with polynomially-damped Schmidt coefficients belong to a higher rank of entanglement class in terms of SLOCC convertibility. For the case of Hilbert spaces of countable, but infinite dimensionality, we show that there are actually an uncountable number of classes of pure non-interconvertible bipartite entangled states.
We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree condition") to test separability of density matrices of graphs. The condition is directly related to the PPT-criterion. We prove that the degree condition is necessary for separability and we conjecture that it is also sufficient. We prove special cases of the conjecture involving nearest point graphs and perfect matchings. We observe that the degree condition appears to have value beyond density matrices of graphs. In fact, we point out that circulant density matrices and other matrices constructed from groups always satisfy the condition and indeed are separable with respect to any split. The paper isolates a number of problems and delineates further generalizations.
We propose a hybrid quantum computing scheme where qubit degrees of freedom for computation are combined with quantum continuous variables for communication. In particular, universal two-qubit gates can be implemented deterministically through qubit-qubit communication, mediated by a continuous-variable bus mode ("qubus"), without direct interaction between the qubits and without any measurement of the qubus. The key ingredients are controlled rotations of the qubus and unconditional qubus displacements. The controlled rotations are realizable through typical atom-light interactions in quantum optics. For such interactions, our scheme is universal and works in any regime, including the limits of weak and strong nonlinearities.
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 characterize the graphs with pure density matrices and show that the density matrix of a graph can be always written as a uniform mixture of pure density matrices of graphs. We consider the von Neumann entropy of these matrices and we characterize the graphs for which the minimum and maximum values are attained. We then discuss the problem of separability by pointing out that separability of density matrices of graphs does not always depend on the labelling of the vertices. We consider graphs with a tensor product structure and simple cases for which combinatorial properties are linked to the entanglement of the state. We calculate the concurrence of all graph on four vertices representing entangled states. It turns out that for some of these graphs the value of the concurrence is exactly fractional.
We show that when a suitable entanglement generating unitary operator depending on a parameter is applied on N qubits in parallel, and an appropriate observable is measured, a precision of order 2 raised to the power (-N) in estimating the parameter may be achieved. This exponentially improves the precision achievable in classical and in quantum non-entangling parallel strategies. We propose a quantum-optics model of laser light interacting with an N-qubit system, say a polyatomic molecule, via a generalized Jaynes-Cummings interaction which, in principle, could achieve the exponentially enhanced precision.
Partial search has been proposed recently for finding the target block containing a target element with fewer queries than the full Grover search algorithm which can locate the target precisely. Since such partial searches will likely be used as subroutines for larger algorithms their success rate is important. We propose a partial search algorithm which achieves success with unit probability.
We present a new approach to scalable quantum computing--a ``qubus computer''--which realises qubit measurement and quantum gates through interacting qubits with a quantum communication bus mode. The qubits could be ``static'' matter qubits or ``flying'' optical qubits, but the scheme we focus on here is particularly suited to matter qubits. There is no requirement for direct interaction between the qubits. Universal two-qubit quantum gates may be effected by schemes which involve measurement of the bus mode, or by schemes where the bus disentangles automatically and no measurement is needed. In effect, the approach integrates together qubit degrees of freedom for computation with quantum continuous variables for communication and interaction.
The black-hole information paradox has fueled a fascinating effort to reconcile the predictions of general relativity and those of quantum mechanics. Gravitational considerations teach us that black holes must trap everything that falls into them. Quantum mechanically the mass of a black hole leaks away as featureless (Hawking) radiation, but if the black hole vanishes, where is the information about the matter that made it? We treat the states of the in-fallen matter quantum mechanically and show that the black-hole information paradox becomes more severe. Our formulation of the paradox rules out one of the most conservative resolutions: that the state of the in-falling matter might be hidden in correlations between semi-classical Hawking radiation and the internal states of the black hole. As a consequence, either unitarity or Hawking's semi-classical predictions must break down. Any resolution of the black-hole information crisis must elucidate one of these possibilities.
Quantum cryptography promises in-principle secure communication between two parties via a quantum channel, with the ability to discover eavesdropping when it occurs. In 1999, a telecloning protocol was invented [M. Murao {\it et al}., Phys. Rev. A {\bf 59}, 156 (1999)] that provides a way for an eavesdropper to remotely monitor a quantum cryptographic channel such that even if eavesdropping is discovered, the identity and location of the eavesdropper is guaranteed uncompromised. Here we demonstrate unconditional telecloning experimentally for the first time. We symmetrically teleclone coherent states of light, achieving a fidelity for each clone of $F = 0.58 \pm 0.01$.
Hoyer has given a generalisation of the Deutsch--Jozsa algorithm which uses the Fourier transform on a group G which is (in general) non-Abelian. His algorithm distinguishes between functions which are either perfectly balanced (m-to-one) or constant, with certainty, and using a single quantum query. Here, we show that this algorithm (which we call the Deutsch--Jozsa--Hoyer algorithm) can in fact deal with a broader range of promises, which we define in terms of the irreducible representations of G.
We exploit Grover operator of database search algorithm for weight decision algorithm. In this research, weight decision problem is to find an exact weight w from given two weights as w1 and w2 where w1+w2=1 and 0 2. Hence the quantum algorithm achieves at least quadratic speedup.
We derive the relativistic transformation laws for the annihilation operators of the scalar field, the massive spin-1 vector field, the electromagnetic field and the spinor field. The technique developed here involves straightforward mathematical techniques based on fundamental quantum field theory, and is applicable to the study of entanglement in arbitrary coordinate transformations. In particular, it predicts particle creation for non-inertial motion. Furthermore, we present a unified description of relativistic transformations and multi-particle interferometry with bosons and fermions, which encompasses linear optical quantum computing.
Gisin and Popescu [PRL, 83, 432 (1999)] have shown that more information about their direction can be obtained from a pair of anti-parallel spins compared to a pair of parallel spins, where the first member of the pair (which we call the pointer member) can point equally along any direction in the Bloch sphere. They argued that this was due to the difference in dimensionality spanned by these two alphabets of states. Here we consider similar alphabets, but with the first spin restricted to a fixed small circle of the Bloch sphere. In this case, the dimensionality spanned by the anti-parallel versus parallel alphabet is now equal. However, the anti-parallel alphabet is found to still contain more information in general. We generalize this to having N parallel spins and M anti-parallel spins. When the pointer member is restricted to a small circle these alphabets again span spaces of equal dimension, yet in general, more directional information can be found for sets with smaller |N-M| for any fixed total number of spins. We find that the optimal POVMs for extracting directional information in these cases can always be expressed in terms of the Fourier basis. Our results show that dimensionality alone cannot explain the greater information content in anti-parallel combinations of spins compared to parallel combinations. In addition, we describe an LOCC protocol which extract optimal directional information when the pointer member is restricted to a small circle and a pair of parallel spins are supplied.
Quantum information is a rapidly advancing area of interdisciplinary research. It may lead to real-world applications for communication and computation unavailable without the exploitation of quantum properties such as nonorthogonality or entanglement. We review the progress in quantum information based on continuous quantum variables, with emphasis on quantum optical implementations in terms of the quadrature amplitudes of the electromagnetic field.
We explore the intimate relationship between quantum lithography, Heisenberg-limited parameter estimation and the rate of dynamical evolution of quantum states. We show how both the enhanced accuracy in measurements and the increased resolution in quantum lithography follow from the use of entanglement. Mathematically, the hyperresolution of quantum lithography appears naturally in the derivation of Heisenberg-limited parameter estimation. We also review recent experiments offering a proof of principle of quantum lithography, and we address the question of state preparation and the fabrication of suitable photoresists.
It has recently been argued that the inability to measure the absolute phase of an electromagnetic field prohibits the representation of a laser's output as a quantum optical coherent state. This argument has generally been considered technically correct but conceptually disturbing. Indeed, it would seem to place in question the very concept of the coherent state. Here we show that this argument fails to take into account a fundamental principle that not only re-admits the coherent state as legitimate, but formalizes a fundamental concept about model building in general, and in quantum mechanics in particular.