Results 1  10
of
323
PolynomialTime Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
 SIAM J. on Computing
, 1997
"... 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 by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 1275 (5 self)
 Add to MetaCart
(Show Context)
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 by 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 which 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.
Faulttolerant quantum computation
 In Proc. 37th FOCS
, 1996
"... It has recently been 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 in realizing quantum computation is that decoherence tends to destroy the information i ..."
Abstract

Cited by 267 (5 self)
 Add to MetaCart
(Show Context)
It has recently been 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 in realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer, making long computations impossible. A further difficulty is that inaccuracies in quantum state transformations throughout the computation accumulate, rendering long computations unreliable. However, these obstacles may not be as formidable as originally believed. For any quantum computation with t gates, we show how to build a polynomial size quantum circuit that tolerates O(1 / log c t) amounts of inaccuracy and decoherence per gate, for some constant c; the previous bound was O(1 /t). We do this by showing that operations can be performed on quantum data encoded by quantum errorcorrecting codes without decoding this data. 1.
Quantum mechanics as quantum information (and only a little more), Quantum Theory: Reconsideration of Foundations
, 2002
"... In this paper, I try once again to cause some goodnatured trouble. The issue remains, when will we ever stop burdening the taxpayer with conferences devoted to the quantum foundations? The suspicion is expressed that no end will be in sight until a means is found to reduce quantum theory to two or ..."
Abstract

Cited by 113 (8 self)
 Add to MetaCart
(Show Context)
In this paper, I try once again to cause some goodnatured trouble. The issue remains, when will we ever stop burdening the taxpayer with conferences devoted to the quantum foundations? The suspicion is expressed that no end will be in sight until a means is found to reduce quantum theory to two or three statements of crisp physical (rather than abstract, axiomatic) significance. In this regard, no tool appears better calibrated for a direct assault than quantum information theory. Far from a strained application of the latest fad to a timehonored problem, this method holds promise precisely because a large part—but not all—of the structure of quantum theory has always concerned information. It is just that the physics community needs reminding. This paper, though takingquantph/0106166 as its core, corrects one mistake and offers several observations beyond the previous version. In particular, I identify one element of quantum mechanics that I would not label a subjective term in the theory—it is the integer parameter D traditionally ascribed to a quantum system via its Hilbertspace dimension. 1
A Theory of Quantum ErrorCorrecting Codes
, 1996
"... Quantum Error Correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. ..."
Abstract

Cited by 102 (11 self)
 Add to MetaCart
(Show Context)
Quantum Error Correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery operator independent definition of errorcorrecting codes. We relate this definition to four others: The existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state, and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct e errors and a formal proof that the classical bounds on the probability of error of eerrorcorrecting codes applies to eerrorcorrecting quantum codes, provided that the interaction is dominated by an identity component.
Quantum information theory
, 1998
"... We survey the field of quantum information theory. In particular, we discuss the fundamentals of the field, source coding, quantum errorcorrecting codes, capacities of quantum channels, measures of entanglement, and quantum cryptography. ..."
Abstract

Cited by 100 (3 self)
 Add to MetaCart
We survey the field of quantum information theory. In particular, we discuss the fundamentals of the field, source coding, quantum errorcorrecting codes, capacities of quantum channels, measures of entanglement, and quantum cryptography.
Unknown quantum states: the quantum de Finetti representation
 J. Math. Phys
"... We present an elementary proof of the quantum de Finetti representation theorem, a quantum analogue of de Finetti’s classical theorem on exchangeable probability assignments. This contrasts with the original proof of Hudson and Moody [Z. Wahrschein. verw. Geb. 33, 343 (1976)], which relies on advanc ..."
Abstract

Cited by 67 (9 self)
 Add to MetaCart
(Show Context)
We present an elementary proof of the quantum de Finetti representation theorem, a quantum analogue of de Finetti’s classical theorem on exchangeable probability assignments. This contrasts with the original proof of Hudson and Moody [Z. Wahrschein. verw. Geb. 33, 343 (1976)], which relies on advanced mathematics and does not share the same potential for generalization. The classical de Finetti theorem provides an operational definition of the concept of an unknown probability in Bayesian probability theory, where probabilities are taken to be degrees of belief instead of objective states of nature. The quantum de Finetti theorem, in a closely analogous fashion, deals with exchangeable densityoperator assignments and provides an operational definition of the concept of an “unknown quantum state ” in quantumstate tomography. This result is especially important for informationbased interpretations of quantum mechanics, where quantum states, like probabilities, are taken to be states of knowledge rather than states of nature. We further demonstrate that the theorem fails for real Hilbert spaces and discuss the significance of this point. I.
Improved simulation of stabilizer circuits
 Phys. Rev. Lett
"... The GottesmanKnill theorem says that a stabilizer circuit—that is, a quantum circuit consisting solely of CNOT, Hadamard, and phase gates—can be simulated efficiently on a classical computer. This paper improves that theorem in several directions. • By removing the need for Gaussian elimination, we ..."
Abstract

Cited by 65 (6 self)
 Add to MetaCart
(Show Context)
The GottesmanKnill theorem says that a stabilizer circuit—that is, a quantum circuit consisting solely of CNOT, Hadamard, and phase gates—can be simulated efficiently on a classical computer. This paper improves that theorem in several directions. • By removing the need for Gaussian elimination, we make the simulation algorithm much faster at the cost of a factor2 increase in the number of bits needed to represent a state. We have implemented the improved algorithm in a freelyavailable program called CHP (CNOTHadamardPhase), which can handle thousands of qubits easily. • We show that the problem of simulating stabilizer circuits is complete for the classical complexity class ⊕L, which means that stabilizer circuits are probably not even universal for classical computation. • We give efficient algorithms for computing the inner product between two stabilizer states, putting any nqubit stabilizer circuit into a “canonical form ” that requires at most O ( n 2 /log n) gates, and other useful tasks. • We extend our simulation algorithm to circuits acting on mixed states, circuits containing a limited number of nonstabilizer gates, and circuits acting on general tensorproduct initial states but containing only a limited number of measurements. 1
Nonbinary Unitary Error Bases and Quantum Codes
 Codes, in LANL eprint quantph/9608048, http://xxx.lanl.gov
, 1996
"... Error operator bases for systems of any dimension are defined and natural generalizations of the bit/sign flip error basis for qubits are given. These bases allow generalizing the construction of quantum codes based on eigenspaces of Abelian groups. As a consequence, quantum codes can be constructed ..."
Abstract

Cited by 61 (3 self)
 Add to MetaCart
(Show Context)
Error operator bases for systems of any dimension are defined and natural generalizations of the bit/sign flip error basis for qubits are given. These bases allow generalizing the construction of quantum codes based on eigenspaces of Abelian groups. As a consequence, quantum codes can be constructed from linear codes over Zn for any n. The generalization of the punctured code construction leads to many codes which permit transversal (i.e. fault tolerant) implementations of certain operations compatible with the error basis. Note: This report is preliminary. Please contact the author if you wish to be notified of updates. A continuation can be found in "Group representations, error bases and quantum codes" [5]. 1 Overview Quantum error correction on products of qubits is increasingly well understood [10, 12, 3, 1, 6, 2]. See the references and the many papers on quantum computation and error correction on http://xxx.lanl.gov/ in the quantph section for background information on the s...