Searcharxiv⌕ Search

arXiv subjects

Peter W. Shor

Publications and source records attributed to Peter W. Shor.

At least 37 records · Page 2Linked to original sources

A New Relativistic Orthogonal States Quantum Key Distribution Protocol

We introduce a new relativistic orthogonal states quantum key distribution protocol which leverages the properties of both quantum mechanics and special relativity to securely encode multiple bits onto the spatio-temporal modes of a single photon. If the protocol is implemented using a single photon source, it can have a key generation rate faster than the repetition rate of the source, enabling faster secure communication than is possible with existing protocols. Further, we provide a proof that the protocol is secure and give a method of implementing the protocol using line-of-sight and fiber optic channels.

quant-ph↗

Quantum Reverse Shannon Theorem

Dual to the usual noisy channel coding problem, where a noisy (classical or quantum) channel is used to simulate a noiseless one, reverse Shannon theorems concern the use of noiseless channels to simulate noisy ones, and more generally the use of one noisy channel to simulate another. For channels of nonzero capacity, this simulation is always possible, but for it to be efficient, auxiliary resources of the proper kind and amount are generally required. In the classical case, shared randomness between sender and receiver is a sufficient auxiliary resource, regardless of the nature of the source, but in the quantum case the requisite auxiliary resources for efficient simulation depend on both the channel being simulated, and the source from which the channel inputs are coming. For tensor power sources (the quantum generalization of classical IID sources), entanglement in the form of standard ebits (maximally entangled pairs of qubits) is sufficient, but for general sources, which may be arbitrarily correlated or entangled across channel inputs, additional resources, such as entanglement-embezzling states or backward communication, are generally needed. Combining existing and new results, we establish the amounts of communication and auxiliary resources needed in both the classical and quantum cases, the tradeoffs among them, and the loss of simulation efficiency when auxiliary resources are absent or insufficient. In particular we find a new single-letter expression for the excess forward communication cost of coherent feedback simulations of quantum channels (i.e. simulations in which the sender retains what would escape into the environment in an ordinary simulation), on non-tensor-power sources in the presence of unlimited ebits but no other auxiliary resource. Our results on tensor power sources establish a strong converse to the entanglement-assisted capacity theorem.

quant-ph↗

Indistinguishable Chargeon-Fluxion Pairs in the Quantum Double of Finite Groups

We consider the category of finite dimensional representations of the quantum double of a finite group as a modular tensor category. We study auto-equivalences of this category whose induced permutations on the set of simple objects (particles) are of the special form of PJ, where J sends every particle to its charge conjugation and P is a transposition of a chargeon-fluxion pair. We prove that if the underlying group is the semidirect product of the additive and multiplicative groups of a finite field, then such an auto-equivalence exists. In particular, we show that for S_3 (the permutation group over three letters) there is a chargeon and a fluxion which are not distinguishable. Conversely, by considering such permutations as modular invariants, we show that a transposition of a chargeon-fluxion pair forms a modular invariant if and only if the corresponding group is isomorphic to the semidirect product of the additive and multiplicative groups of a finite near-field.

quant-ph↗

Unfrustrated Qudit Chains and their Ground States

We investigate chains of 'd' dimensional quantum spins (qudits) on a line with generic nearest neighbor interactions without translational invariance. We find the conditions under which these systems are not frustrated, i.e. when the ground states are also the common ground states of all the local terms in the Hamiltonians. The states of a quantum spin chain are naturally represented in the Matrix Product States (MPS) framework. Using imaginary time evolution in the MPS ansatz, we numerically investigate the range of parameters in which we expect the ground states to be highly entangled and find them hard to approximate using our MPS method.

quant-ph↗

Quantum interactive proofs with short messages

This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The first variant is one in which the verifier sends a short message to the prover, and the prover responds with an ordinary, or polynomial-length, message; the second variant is one in which any number of messages can be exchanged, but where the combined length of all the messages is logarithmic; and the third variant is one in which the verifier sends polynomially many random bits to the prover, who responds with a short quantum message. We prove that in all of these cases the short messages can be eliminated without changing the power of the model, so the first variant has the expressive power of QMA and the second and third variants have the expressive power of BQP. These facts are proved through the use of quantum state tomography, along with the finite quantum de Finetti theorem for the first variant.

quant-ph↗

Approximating the Set of Separable States Using the Positive Partial Transpose Test

The positive partial transpose test is one of the main criteria for detecting entanglement, and the set of states with positive partial transpose is considered as an approximation of the set of separable states. However, we do not know to what extent this criterion, as well as the approximation, are efficient. In this paper, we show that the positive partial transpose test gives no bound on the distance of a density matrix from separable states. More precisely, we prove that, as the dimension of the space tends to infinity, the maximum trace distance of a positive partial transpose state from separable states tends to 1. Using similar techniques, we show that the same result holds for other well-known separability criteria such as reduction criterion, majorization criterion and symmetric extension criterion. We also bring an evidence that the sets of positive partial transpose states and separable states have totally different shapes.

quant-ph↗

C3, Semi-Clifford and Generalized Semi-Clifford Operations

Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and Clifford operators can be applied fault-tolerantly. Indeed, this technique can be generalized for an extended set of gates, the so called ${\mathcal{C}}_k$ hierarchy gates, introduced by Gottesman and Chuang (Nature, 402, 390-392). ${\mathcal{C}}_k$ gates are a generalization of Clifford operators, but our knowledge of these sets is not as rich as our knowledge of Clifford gates. Zeng et al. in (Phys. Rev. A 77, 042313) raise the question of the relation between ${\mathcal{C}}_k$ hierarchy and the set of semi-Clifford and generalized semi-Clifford operators. They conjecture that any ${\mathcal{C}}_k$ gate is a generalized semi-Clifford operator. In this paper, we prove this conjecture for $k=3$. Using the techniques that we develop, we obtain more insight on how to characterize ${\mathcal{C}}_3$ gates. Indeed, the more we understand ${\mathcal{C}}_3$, the more intuition we have on ${\mathcal{C}}_k$, $k\geq 4$, and then we have a way of attacking the conjecture for larger $k$.

quant-ph↗

High performance single-error-correcting quantum codes for amplitude damping

We construct families of high performance quantum amplitude damping codes. All of our codes are nonadditive and most modestly outperform the best possible additive codes in terms of encoded dimension. One family is built from nonlinear error-correcting codes for classical asymmetric channels, with which we systematically construct quantum amplitude damping codes with parameters better than any prior construction known for any block length n > 7 except n=2^r-1. We generalize this construction to employ classical codes over GF(3) with which we numerically obtain better performing codes up to length 14. Because the resulting codes are of the codeword stabilized (CWS) type, easy encoding and decoding circuits are available.

quant-ph↗

Time reversal and exchange symmetries of unitary gate capacities

Unitary gates are an interesting resource for quantum communication in part because they are always invertible and are intrinsically bidirectional. This paper explores these two symmetries: time-reversal and exchange of Alice and Bob. We will present examples of unitary gates that exhibit dramatic separations between forward and backward capacities (even when the back communication is assisted by free entanglement) and between entanglement-assisted and unassisted capacities, among many others. Along the way, we will give a general time-reversal rule for relating the capacities of a unitary gate and its inverse that will explain why previous attempts at finding asymmetric capacities failed. Finally, we will see how the ability to erase quantum information and destroy entanglement can be a valuable resource for quantum communication.

quant-ph↗

Generalized Concatenation for Quantum Codes

We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both stabilizer codes as well as so-called nonadditive codes.

quant-ph↗

On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels

One of the main problems in quantum complexity theory is that our understanding of the theory of QMA-completeness is not as rich as its classical analogue, the NP- completeness. In this paper we consider the clique problem in graphs, which is NP- complete, and try to find its quantum analogue. We show that, quantum clique problem can be defined as follows; Given a quantum channel, decide whether there are k states that are distinguishable, with no error, after passing through channel. This definition comes from reconsidering the clique problem in terms of the zero-error capacity of graphs, and then redefining it in quantum information theory. We prove that, quantum clique problem is QMA-complete. In the second part of paper, we consider the same problem for the Holevo capacity. We prove that computing the Holevo capacity as well as the minimum entropy of a quantum channel is NP-complete. Also, we show these results hold even if the set of quantum channels is restricted to entanglement breaking ones.

quant-ph↗

Estimating Jones polynomials is a complete problem for one clean qubit

It is known that evaluating a certain approximation to the Jones polynomial for the plat closure of a braid is a BQP-complete problem. That is, this problem exactly captures the power of the quantum circuit model. The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maximally mixed state. One clean qubit computers are believed to be strictly weaker than standard quantum computers, but still capable of solving some classically intractable problems. Here we show that evaluating a certain approximation to the Jones polynomial at a fifth root of unity for the trace closure of a braid is a complete problem for the one clean qubit complexity class. That is, a one clean qubit computer can approximate these Jones polynomials in time polynomial in both the number of strands and number of crossings, and the problem of simulating a one clean qubit computer is reducible to approximating the Jones polynomial of the trace closure of a braid.

quant-ph↗

Nonadditive quantum error correcting codes adapted to the ampltitude damping channel

A family of high rate quantum error correcting codes adapted to the amplitude damping channel is presented. These codes are nonadditive and exploit self-complementarity structure to correct all first-order errors. Their rates can be higher than 1/2. The recovery operations of these codes can be generated by a simple algorithm and have a projection nature, which makes them potentially easy to implement.

quant-ph↗

Random quantum codes from Gaussian ensembles and an uncertainty relation

Using random Gaussian vectors and an information-uncertainty relation, we give a proof that the coherent information is an achievable rate for entanglement transmission through a noisy quantum channel. The codes are random subspaces selected according to the Haar measure, but distorted as a function of the sender's input density operator. Using large deviations techniques, we show that classical data transmitted in either of two Fourier-conjugate bases for the coding subspace can be decoded with low probability of error. A recently discovered information-uncertainty relation then implies that the quantum mutual information for entanglement encoded into the subspace and transmitted through the channel will be high. The monogamy of quantum correlations finally implies that the environment of the channel cannot be significantly coupled to the entanglement, and concluding, which ensures the existence of a decoding by the receiver.

quant-ph↗

Channel-Adapted Quantum Error Correction for the Amplitude Damping Channel

We consider error correction procedures designed specifically for the amplitude damping channel. We analyze amplitude damping errors in the stabilizer formalism. This analysis allows a generalization of the [4,1] `approximate' amplitude damping code of quant-ph/9704002. We present this generalization as a class of [2(M+1),M] codes and present quantum circuits for encoding and recovery operations. We also present a [7,3] amplitude damping code based on the classical Hamming code. All of these are stabilizer codes whose encoding and recovery operations can be completely described with Clifford group operations. Finally, we describe optimization options in which recovery operations may be further adapted according to the damping probability gamma.

quant-ph↗

Structured Near-Optimal Channel-Adapted Quantum Error Correction

We present a class of numerical algorithms which adapt a quantum error correction scheme to a channel model. Given an encoding and a channel model, it was previously shown that the quantum operation that maximizes the average entanglement fidelity may be calculated by a semidefinite program (SDP), which is a convex optimization. While optimal, this recovery operation is computationally difficult for long codes. Furthermore, the optimal recovery operation has no structure beyond the completely positive trace preserving (CPTP) constraint. We derive methods to generate structured channel-adapted error recovery operations. Specifically, each recovery operation begins with a projective error syndrome measurement. The algorithms to compute the structured recovery operations are more scalable than the SDP and yield recovery operations with an intuitive physical form. Using Lagrange duality, we derive performance bounds to certify near-optimality.

quant-ph↗

Adaptive Entanglement Purification Protocols with Two-way Classical Communication

We present a family of entanglement purification protocols that generalize four previous methods, namely the recurrence method, the modified recurrence method, and the two methods proposed by Maneva-Smolin and Leung-Shor. We will show that this family of protocols have improved yields over a wide range of initial fidelities F, and hence imply new lower bounds on the quantum capacity assisted by two-way classical communication of the quantum depolarizing channel. In particular, the yields of these protocols are higher than the yield of universal hashing for F less than 0.993 and as F goes to 1.

quant-ph↗

Entanglement purification with two-way classical communication

We present an improved protocol for entanglement purification of bipartite mixed states. The protocol requires two-way classical communication and hence implies an improved lower bound on the quantum capacity with two-way classical communication of the quantum depolarizing channel.

quant-ph↗