Searcharxiv⌕ Search

arXiv subjects

John A. Smolin

Publications and source records attributed to John A. Smolin.

71 records · Page 4Linked to original sources

Nonadditivity of Bipartite Distillable Entanglement follows from Conjecture on Bound Entangled Werner States

Assuming the validity of a conjecture in quant-ph/9910026 and quant-ph/9910022 we show that the distillable entanglement for two bipartite states, each of which individually has zero distillable entanglement, can be nonzero. We show that this also implies that the distillable entanglement is not a convex function. Our example consists of the tensor product of a bound entangled state based on an unextendible product basis with a Werner state which lies in the class of conjectured undistillable states.

quant-ph↗

Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement

We report new results and generalizations of our work on unextendible product bases (UPB), uncompletable product bases and bound entanglement. We present a new construction for bound entangled states based on product bases which are only completable in a locally extended Hilbert space. We introduce a very useful representation of a product basis, an orthogonality graph. Using this representation we give a complete characterization of unextendible product bases for two qutrits. We present several generalizations of UPBs to arbitrary high dimensions and multipartite systems. We present a sufficient condition for sets of orthogonal product states to be distinguishable by separable superoperators. We prove that bound entangled states cannot help increase the distillable entanglement of a state beyond its regularized entanglement of formation assisted by bound entanglement.

quant-ph↗

Evidence for Bound Entangled States with Negative Partial Transpose

We exhibit a two-parameter family of bipartite mixed states $ρ_{bc}$, in a $d\otimes d$ Hilbert space, which are negative under partial transposition (NPT), but for which we conjecture that no maximally entangled pure states in $2\otimes 2$ can be distilled by local quantum operations and classical communication (LQ+CC). Evidence for this undistillability is provided by the result that, for certain states in this family, we cannot extract entanglement from any arbitrarily large number of copies of $ρ_{bc}$ using a projection on $2\otimes 2$. These states are canonical NPT states in the sense that any bipartite mixed state in any dimension with NPT can be reduced by LQ+CC operations to an NPT state of the $ρ_{bc}$ form. We show that the main question about the distillability of mixed states can be formulated as an open mathematical question about the properties of composed positive linear maps.

quant-ph↗

Exact and Asymptotic Measures of Multipartite Pure State Entanglement

In an effort to simplify the classification of pure entangled states of multi (m) -partite quantum systems, we study exactly and asymptotically (in n) reversible transformations among n'th tensor powers of such states (ie n copies of the state shared among the same m parties) under local quantum operations and classical communication (LOCC). With regard to exact transformations, we show that two states whose 1-party entropies agree are either locally-unitarily (LU) equivalent or else LOCC-incomparable. In particular we show that two tripartite Greenberger-Horne-Zeilinger (GHZ) states are LOCC-incomparable to three bipartite Einstein-Podolsky-Rosen (EPR) states symmetrically shared among the three parties. Asymptotic transformations result in a simpler classification than exact transformations. We show that m-partite pure states having an m-way Schmidt decomposition are simply parameterizable, with the partial entropy across any nontrivial partition representing the number of standard ``Cat'' states (|0^m>+|1^m>) asymptotically interconvertible to the state in question. For general m-partite states, partial entropies across different partitions need not be equal, and since partial entropies are conserved by asymptotically reversible LOCC operations, a multicomponent entanglement measure is needed, with each scalar component representing a different kind of entanglement, not asymptotically interconvertible to the other kinds. In particular the m=4 Cat state is not isentropic to, and therefore not asymptotically interconvertible to, any combination of bipartite and tripartite states shared among the four parties. Thus, although the m=4 cat state can be prepared from bipartite EPR states, the preparation process is necessarily irreversible, and remains so even asymptotically.

quant-ph↗

A four-party unlockable bound-entangled state

I present a four-party unlockable bound-entangled state, that is, a four-party quantum state which cannot be written in a separable form and from which no pure entanglement can be distilled by local quantum operations and classical communication among the parties, and yet when any two of the parties come together in the same laboratory they can perform a measurement which enables the other two parties to create a pure maximally entangled state between them without coming together. This unlocking ability can be viewed in two ways, as either a determination of which Bell state is shared in the mixture, or as a kind of quantum teleportation with cancellation of Pauli operators.

quant-ph↗

Improved two-party and multi-party purification protocols

We present an improved protocol for entanglement purification of bipartite mixed states using several states at a time rather than two at a time as in the traditional recurrence method. We also present a generalization of the hashing method to n-partite cat states, which achieves a finite yield of pure cat states for any desired fidelity. Our results are compared to previous protocols.

quant-ph↗

Entanglement-Assisted Classical Capacity of Noisy Quantum Channels

Prior entanglement between sender and receiver, which exactly doubles the classical capacity of a noiseless quantum channel, can increase the classical capacity of some noisy quantum channels by an arbitrarily large constant factor depending on the channel, relative to the best known classical capacity achievable without entanglement. The enhancement factor is greatest for very noisy channels, with positive classical capacity but zero quantum capacity. Although such quantum channels can be simulated classically, no violation of causality is implied, because the simulation requires at least as much forward classical communication as the entanglement-assisted classical capacity of the channel being simulated. We obtain exact expressions for the entanglement-assisted capacity of depolarizing and erasure channels in d dimensions.

quant-ph↗

Physical Optimization of Quantum Error Correction Circuits

Quantum error correcting codes have been developed to protect a quantum computer from decoherence due to a noisy environment. In this paper, we present two methods for optimizing the physical implementation of such error correction schemes. First, we discuss an optimal quantum circuit implementation of the smallest error-correcting code (the three bit code). Quantum circuits are physically implemented by serial pulses, i.e. by switching on and off external parameters in the Hamiltonian one after another. In contrast to this, we introduce a new parallel switching method that allows faster gate operation by switching all external parameters simultaneously. These two methods are applied to electron spins in coupled quantum dots subject to a Heisenberg coupling H=J(t) S_1*S_2 which can generate the universal quantum gate `square-root-of-swap'. Using parallel pulses, the encoding for three-bit quantum error correction in a Heisenberg system can be accelerated by a factor of about two. We point out that parallel switching has potential applications for arbitrary quantum computer architectures.

cond-mat.mes-hall↗

Quantum Channel Capacity of Very Noisy Channels

We present a family of additive quantum error-correcting codes whose capacities exceeds that of quantum random coding (hashing) for very noisy channels. These codes provide non-zero capacity in a depolarizing channel for fidelity parameters $f$ when $f> .80944$. Random coding has non-zero capacity only for $f>.81071$; by analogy to the classical Shannon coding limit, this value had previously been conjectured to be a lower bound. We use the method introduced by Shor and Smolin of concatenating a non-random (cat) code within a random code to obtain good codes. The cat code with block size five is shown to be optimal for single concatenation. The best known multiple-concatenated code we found has a block size of 25. We derive a general relation between the capacity attainable by these concatenation schemes and the coherent information of the inner code states.

quant-ph↗

Quantum Nonlocality without Entanglement

We exhibit an orthogonal set of product states of two three-state particles that nevertheless cannot be reliably distinguished by a pair of separated observers ignorant of which of the states has been presented to them, even if the observers are allowed any sequence of local operations and classical communication between the separate observers. It is proved that there is a finite gap between the mutual information obtainable by a joint measurement on these states and a measurement in which only local actions are permitted. This result implies the existence of separable superoperators that cannot be implemented locally. A set of states are found involving three two-state particles which also appear to be nonmeasurable locally. These and other multipartite states are classified according to the entropy and entanglement costs of preparing and measuring them by local operations.

quant-ph↗

Entanglement of Assistance

The newfound importance of ``entanglement as a resource'' in quantum computation and quantum communication compels us to quantify it in as many distinct ways as possible. Here we explore a new measure of entanglement for mixed quantum states of bipartite systems, which we name the Entanglement of Assistance. We show it to be the maximum average entanglement of all pure-state ensembles consistent with the given density matrix. In this sense, the Entanglement of Assistance is a quantity directly dual to the more standard Entanglement of Formation. With the help of lower and upper bounds, we calculate the Entanglement of Assistance for a few cases and use these results to show that it possesses the surprising property of superadditivity. We believe that this may shed some light on the question of additivity for the Entanglement of Formation.

quant-ph↗

Capacities of Quantum Erasure Channels

The quantum analog of the classical erasure channel provides a simple example of a channel whose asymptotic capacity for faithful transmission of intact quantum states, with and without the assistance of a two-way classical side channel, can be computed exactly. We derive the quantum and classical capacities for the quantum erasure channel and related channels, and compare them to the depolarizing channel, for which only upper and lower bounds on the capacities are known.

quant-ph↗

Entanglement-Enhanced Classical Communication on a Noisy Quantum Channel

We consider the problem of trying to send a single classical bit through a noisy quantum channel when two transmissions through the channel are available as a resource. Classically, two transmissions add nothing to the receiver's capability of inferring the bit. In the quantum world, however, one has the possible further advantage of entangling the two transmissions. We demonstrate that, for certain noisy channels, such entangled transmissions enhance the receiver's capability of a correct inference.

quant-ph↗

Perfect quantum error correction coding in 24 laser pulses

An efficient coding circuit is given for the perfect quantum error correction of a single qubit against arbitrary 1-qubit errors within a 5 qubit code. The circuit presented employs a double `classical' code, i.e., one for bit flips and one for phase shifts. An implementation of this coding circuit on an ion-trap quantum computer is described that requires 26 laser pulses. A further circuit is presented requiring only 24 laser pulses, making it an efficient protection scheme against arbitrary 1-qubit errors. In addition, the performance of two error correction schemes, one based on the quantum Zeno effect and the other using standard methods, is compared. The quantum Zeno error correction scheme is found to fail completely for a model of noise based on phase-diffusion.

quant-ph↗

Mixed State Entanglement and Quantum Error Correction

Entanglement purification protocols (EPP) and quantum error-correcting codes (QECC) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectly entangled pure states are extracted, with some yield D, from a mixed state M shared by two parties; with a QECC, an arbi- trary quantum state $|ξ\rangle$ can be transmitted at some rate Q through a noisy channel $χ$ without degradation. We prove that an EPP involving one- way classical communication and acting on mixed state $\hat{M}(χ)$ (obtained by sharing halves of EPR pairs through a channel $χ$) yields a QECC on $χ$ with rate $Q=D$, and vice versa. We compare the amount of entanglement E(M) required to prepare a mixed state M by local actions with the amounts $D_1(M)$ and $D_2(M)$ that can be locally distilled from it by EPPs using one- and two-way classical communication respectively, and give an exact expression for $E(M)$ when $M$ is Bell-diagonal. While EPPs require classical communica- tion, QECCs do not, and we prove Q is not increased by adding one-way classical communication. However, both D and Q can be increased by adding two-way com- munication. We show that certain noisy quantum channels, for example a 50% depolarizing channel, can be used for reliable transmission of quantum states if two-way communication is available, but cannot be used if only one-way com- munication is available. We exhibit a family of codes based on universal hash- ing able toachieve an asymptotic $Q$ (or $D$) of 1-S for simple noise models, where S is the error entropy. We also obtain a specific, simple 5-bit single- error-correcting quantum block code. We prove that {\em iff} a QECC results in high fidelity for the case of no error the QECC can be recast into a form where the encoder is the matrix inverse of the decoder.

quant-ph↗

Quantum Error-Correcting Codes Need Not Completely Reveal the Error Syndrome

Quantum error-correcting codes so far proposed have not worked in the presence of noise which introduces more than one bit of entropy per qubit sent through a quantum channel, nor can any code which identifies the complete error syndrome. We describe a code which does not find the complete error syndrome and can be used for reliable transmission of quantum information through channels which add more than one bit of entropy per transmitted bit. In the case of the depolarizing channel our code can be used in a channel of fidelity .8096. The best existing code worked only down to .8107.

quant-ph↗

Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels

Two separated observers, by applying local operations to a supply of not-too-impure entangled states ({\em e.g.} singlets shared through a noisy channel), can prepare a smaller number of entangled pairs of arbitrarily high purity ({\em e.g.} near-perfect singlets). These can then be used to faithfully teleport unknown quantum states from one observer to the other, thereby achieving faithful transfrom one observer to the other, thereby achieving faithful transmission of quantum information through a noisy channel. We give upper and lower bounds on the yield $D(M)$ of pure singlets ($\ket{Ψ^-}$) distillable from mixed states $M$, showing $D(M)>0$ if $\bra{Ψ^-}M\ket{Ψ^-}>\half$.

quant-ph↗