Results 1 - 10
of
158
Fault-tolerant 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 264 (5 self)
- Add to MetaCart
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 error-correcting codes without decoding this data. 1.
Quantum lower bounds by quantum arguments
- In Proceedings of the ACM Symposium on Theory of Computing
, 2000
"... We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input, we use a quantum adversary that runs the algorithm with a superposition of inputs. If the algorithm works correctly, its ..."
Abstract
-
Cited by 193 (19 self)
- Add to MetaCart
(Show Context)
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input, we use a quantum adversary that runs the algorithm with a superposition of inputs. If the algorithm works correctly, its state becomes entangled with the superposition over inputs. We bound the number of queries needed to achieve a sufficient entanglement and this implies a lower bound on the number of queries for the computation. Using this method, we prove two new Ω ( √ N) lower bounds on computing AND of ORs and inverting a permutation and also provide more uniform proofs for several known lower bounds which have been previously proven via variety of different techniques. 1
Consequences and Limits of Nonlocal Strategies
, 2010
"... Thispaperinvestigatesthepowersandlimitationsofquantum entanglementinthecontext of cooperative games of incomplete information. We give several examples of such nonlocal games where strategies that make use of entanglement outperform all possible classical strategies. One implication ofthese examples ..."
Abstract
-
Cited by 120 (20 self)
- Add to MetaCart
(Show Context)
Thispaperinvestigatesthepowersandlimitationsofquantum entanglementinthecontext of cooperative games of incomplete information. We give several examples of such nonlocal games where strategies that make use of entanglement outperform all possible classical strategies. One implication ofthese examplesis that entanglement canprofoundly affectthesoundness property of two-prover interactive proof systems. We then establish limits on the probability with which strategies making use of entanglement can win restricted types of nonlocal games. These upperbounds mayberegardedasgeneralizationsof Tsirelson-typeinequalities, which place bounds on the extent to which quantum information can allow for the violation of Bell inequalities. We also investigate the amount of entanglement required by optimal and nearly optimal quantum strategies forsome games.
Quantum Communication Complexity of Symmetric Predicates
- Izvestiya of the Russian Academy of Science, Mathematics
, 2002
"... We completely (that is, up to a logarithmic factor) characterize the bounded-error quantum communication complexity of every predicate f(x; y) (x; y [n]) depending only on jx\yj. Namely, for a predicate D on f0; 1; : : : ; ng let ` 0 (D) = max f` j 1 ` n=2 ^ D(`) 6 D(` 1)g and ` 1 (D) = ..."
Abstract
-
Cited by 104 (1 self)
- Add to MetaCart
(Show Context)
We completely (that is, up to a logarithmic factor) characterize the bounded-error quantum communication complexity of every predicate f(x; y) (x; y [n]) depending only on jx\yj. Namely, for a predicate D on f0; 1; : : : ; ng let ` 0 (D) = max f` j 1 ` n=2 ^ D(`) 6 D(` 1)g and ` 1 (D) = max fn ` j n=2 ` < n ^ D(`) 6 D(` + 1)g. Then the bounded-error quantum communication complexity of f D (x; y) = D(jx \ yj) is equal (again, up to a logarithmic factor) to ` 1 (D). In particular, the complexity of the set disjointness predicate is n). This result holds both in the model with prior entanglement and without it.
Exponential Separation of Quantum and Classical Communication Complexity
, 1999
"... Communication complexity has become a central complexity model. In that model, we count the amount of communication bits needed between two parties in order to solve certain computational problems. We show that for certain communication complexity problems quantum communication protocols are expo ..."
Abstract
-
Cited by 93 (2 self)
- Add to MetaCart
Communication complexity has become a central complexity model. In that model, we count the amount of communication bits needed between two parties in order to solve certain computational problems. We show that for certain communication complexity problems quantum communication protocols are exponentially faster than classical ones. More explicitly, we give an example for a communication complexity relation (or promise problem) P such that: 1. The quantum communication complexity of P is O(log m). 2. The classical probabilistic communication complexity of P is \Omega\Gamma m 1=4 = log m). (where m is the length of the inputs). This gives an exponential gap between quantum communication complexity and classical probabilistic communication complexity. Only a quadratic gap was previously known. Our problem P is of geometrical nature, and is a finite precision variation of the following problem: Player I gets as input a unit vector x 2 R n and two orthogonal subspaces M 0 ...
Polynomial degree vs. quantum query complexity
- Proceedings of FOCS’03
"... The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whether this lower bound is tight. We exhibit a function with pol ..."
Abstract
-
Cited by 81 (14 self)
- Add to MetaCart
(Show Context)
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whether this lower bound is tight. We exhibit a function with polynomial degree M and quantum query complexity Ω(M 1.321...). This is the first superlinear separation between polynomial degree and quantum query complexity. The lower bound is shown by a new, more general version of quantum adversary method. 1
The physical implementation of quantum computation
- Fortschr. Phys
, 2000
"... After a brief introduction to the principles and promise of quantum information processing, the requirements for the physical implementation of quantum computation are discussed. These five requirements, plus two relating to the communication of quantum information, are extensively explored and rela ..."
Abstract
-
Cited by 75 (0 self)
- Add to MetaCart
(Show Context)
After a brief introduction to the principles and promise of quantum information processing, the requirements for the physical implementation of quantum computation are discussed. These five requirements, plus two relating to the communication of quantum information, are extensively explored and related to the many schemes in atomic physics, quantum optics, nuclear and electron magnetic resonance spectroscopy, superconducting electronics, and quantum-dot physics, for achieving quantum computing. 1.
Quantum Algorithms for Element Distinctness
- SIAM Journal of Computing
, 2001
"... We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Høyer, and Tapp, and imply an O(N 3/4 log N) quantum upper bound for the element distinctness problem in the comparison c ..."
Abstract
-
Cited by 75 (9 self)
- Add to MetaCart
(Show Context)
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Høyer, and Tapp, and imply an O(N 3/4 log N) quantum upper bound for the element distinctness problem in the comparison complexity model. This contrasts with Θ(N log N) classical complexity. We also prove a lower bound of Ω ( √ N) comparisons for this problem and derive bounds for a number of related problems. 1
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
- SIAM Journal on Computing
, 2004
"... A strong direct product theorem says that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then our overall success probability will be exponentially small in k. We establish such theorems for the classical as well as quantum ..."
Abstract
-
Cited by 65 (13 self)
- Add to MetaCart
A strong direct product theorem says that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then our overall success probability will be exponentially small in k. We establish such theorems for the classical as well as quantum query complexity of the OR function. This implies slightly weaker direct product results for all total functions. We prove a similar result for quantum communication protocols computing k instances of the Disjointness function. Our direct product theorems...