arXiv subjects

Peter W. Shor

Publications and source records attributed to Peter W. Shor.

68 records · Page 4Linked to original sources

arXiv2000

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↗

arXiv2000

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↗

arXiv2000

On the Number of Elements Needed in a POVM Attaining the Accessible Information

We investigate a symmetric set of three quantum states in three dimensions having interesting properties, which we call the lifted trine states. We show that for the ensemble consisting of the three lifted trine states taken with equal probabilities, the POVM measurement realizing the accessible information must contain six projectors, giving a counterexample to a conjecture of Levitin.

quant-ph↗

arXiv2000

Simple Proof of Security of the BB84 Quantum Key Distribution Protocol

We prove the security of the 1984 protocol of Bennett and Brassard (BB84) for quantum key distribution. We first give a key distribution protocol based on entanglement purification, which can be proven secure using methods from Lo and Chau's proof of security for a similar protocol. We then show that the security of this protocol implies the security of BB84. The entanglement-purification based protocol uses Calderbank-Shor-Steane (CSS) codes, and properties of these codes are used to remove the use of quantum computation from the Lo-Chau protocol.

quant-ph↗

arXiv1999

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↗

arXiv1998

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↗

arXiv1998

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↗

arXiv1997

A nonadditive quantum code

Up to now every good quantum error-correcting code discovered has had the structure of an eigenspace of an Abelian group generated by tensor products of Pauli matrices; such codes are known as stabilizer or additive codes. In this letter we present the first example of a code that is better than any code of this type. It encodes six states in five qubits and can correct the erasure of any single qubit.

quant-ph↗

arXiv1997

Fault-tolerant quantum computation

Recently, it was realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties of realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer, thus making long computations impossible. A futher difficulty is that inaccuracies in quantum state transformations throughout the computation accumulate, rendering the output of long computations unreliable. It was previously known that a quantum circuit with t gates could tolerate O(1/t) amounts of inaccuracy and decoherence per gate. We show, for any quantum computation with t gates, how to build a polynomial size quantum circuit that can tolerate O(1/(log t)^c) amounts of inaccuracy and decoherence per gate, for some constant c. We do this by showing how to compute using quantum error correcting codes. These codes were previously known to provide resistance to errors while storing and transmitting quantum data.

quant-ph↗

arXiv1996

Fault-Tolerant Error Correction with Efficient Quantum Codes

We exhibit a simple, systematic procedure for detecting and correcting errors using any of the recently reported quantum error-correcting codes. The procedure is shown explicitly for a code in which one qubit is mapped into five. The quantum networks obtained are fault tolerant, that is, they can function successfully even if errors occur during the error correction. Our construction is derived using a recently introduced group-theoretic framework for unifying all known quantum codes.

quant-ph↗

arXiv1996

Good Quantum Error-Correcting Codes Exist

A quantum error-correcting code is defined to be a unitary mapping (encoding) of k qubits (2-state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can be used to faithfully reconstruct the original quantum state of the k encoded qubits. Quantum error-correcting codes are shown to exist with asymptotic rate k/n = 1 - 2H(2t/n) where H(p) is the binary entropy function -p log p - (1-p) log (1-p). Upper bounds on this asymptotic rate are given.

quant-ph↗

arXiv1996

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↗

arXiv1996

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored.

quant-ph↗

arXiv1992

Keller's cube-tiling conjecture is false in high dimensions

O. H. Keller conjectured in 1930 that in any tiling of $\Bbb R^n$ by unit $n$-cubes there exist two of them having a complete facet in common. O. Perron proved this conjecture for $n\le 6$. We show that for all $n\ge 10$ there exists a tiling of $\Bbb R^n$ by unit $n$-cubes such that no two $n$-cubes have a complete facet in common.

math.MG↗