Results 11 - 20
of
264
Parallelization, Amplification, and Exponential Time Simulation of Quantum Interactive Proof Systems
- In Proceedings of the 32nd ACM Symposium on Theory of Computing
, 2000
"... In this paper we consider quantum interactive proof systems, which are interactive proof systems in which the prover and verier may perform quantum computations and exchange quantum information. We prove that any polynomial-round quantum interactive proof system with two-sided bounded error can be p ..."
Abstract
-
Cited by 77 (19 self)
- Add to MetaCart
(Show Context)
In this paper we consider quantum interactive proof systems, which are interactive proof systems in which the prover and verier may perform quantum computations and exchange quantum information. We prove that any polynomial-round quantum interactive proof system with two-sided bounded error can be parallelized to a quantum interactive proof system with exponentially small one-sided error in which the prover and verier exchange only 3 messages. This yields a simplied proof that PSPACE has 3-message quantum interactive proof systems. We also prove that any language having a quantum interactive proof system can be decided in deterministic exponential time, implying that single-prover quantum interactive proof systems are strictly less powerful than multiple-prover classical interactive proof systems unless EXP = NEXP. 1. INTRODUCTION Interactive proof systems were introduced by Babai [3] and Goldwasser, Micali, and Racko [17] in 1985. In the same year, Deutsch [10] gave the rst for...
Quantum cryptanalysis of hidden linear functions
- in Proceedings of Crypto’95, Lecture Notes in Comput. Sci. 963
, 1995
"... Abstract. Recently there has been a great deal of interest in the power of \Quantum Computers " [4, 15, 18]. The driving force is the recent beautiful result of Shor that shows that discrete log and factoring are solvable in random quantum polynomial time [15]. We use a method similar to Shor&a ..."
Abstract
-
Cited by 74 (0 self)
- Add to MetaCart
(Show Context)
Abstract. Recently there has been a great deal of interest in the power of \Quantum Computers " [4, 15, 18]. The driving force is the recent beautiful result of Shor that shows that discrete log and factoring are solvable in random quantum polynomial time [15]. We use a method similar to Shor's to obtain a general theorem about quantum polyno-mial time. We show that any cryptosystem based on what we refer to as a `hidden linear form ' can be broken in quantum polynomial time. Our results imply that the discrete log problem is doable in quantum poly-nomial time over any group including Galois elds and elliptic curves. Finally, we introduce the notion of `junk bits ' which are helpful when performing classical computations that are not injective. 1
Improved simulation of stabilizer circuits
- Phys. Rev. Lett
"... The Gottesman-Knill 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 66 (6 self)
- Add to MetaCart
(Show Context)
The Gottesman-Knill 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 factor-2 increase in the number of bits needed to represent a state. We have implemented the improved algorithm in a freely-available program called CHP (CNOT-Hadamard-Phase), 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 n-qubit 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 non-stabilizer gates, and circuits acting on general tensor-product initial states but containing only a limited number of measurements. 1
Quantum automata and quantum grammars
- Theoretical Computer Science
"... Abstract. To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finite-state and push-down automata, and regular and context-free grammars. We find analogs of several classical the ..."
Abstract
-
Cited by 52 (2 self)
- Add to MetaCart
(Show Context)
Abstract. To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finite-state and push-down automata, and regular and context-free grammars. We find analogs of several classical theorems, including pumping lemmas, closure properties, rational and algebraic generating functions, and Greibach normal form. We also show that there are quantum context-free languages that are not context-free. 1
Fault-Tolerant Error Correction with Efficient Quantum Codes
, 1996
"... 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 fu ..."
Abstract
-
Cited by 51 (4 self)
- Add to MetaCart
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.
Quantum multi-prover interactive proof systems with limited prior entanglement
- Journal of Computer and System Sciences
"... This paper gives the first formal treatment of a quantum analogue of multi-prover interactive proof systems. In quantum multi-prover interactive proof systems there can be two natural situations: one is with prior entanglement among provers, and the other does not allow prior entanglement among prov ..."
Abstract
-
Cited by 46 (5 self)
- Add to MetaCart
(Show Context)
This paper gives the first formal treatment of a quantum analogue of multi-prover interactive proof systems. In quantum multi-prover interactive proof systems there can be two natural situations: one is with prior entanglement among provers, and the other does not allow prior entanglement among provers. This paper focuses on the latter situation and proves that, if provers do not share any prior entanglement each other, the class of languages that have quantum multi-prover interactive proof systems is equal to NEXP. It implies that the quantum multi-prover interactive proof systems without prior entanglement have no gain to the classical ones. This result can be extended to the following statement of the cases with prior entanglement: if a language L has a quantum multi-prover interactive proof system allowing at most polynomially many prior entangled qubits among provers, L is necessarily in NEXP. Another interesting result shown in this paper is that, in the case the prover does not have his private qubits, the class of languages that have single-prover quantum interactive proof systems is also equal to NEXP. Our results are also of importance in the sense of giving exact correspondances between quantum and classical complexity classes, because there have been known only a few results giving such correspondances.
Fault-tolerant quantum computation with local gates
- Jour. of Modern Optics
"... I discuss how to perform fault-tolerant quantum computation with concatenated codes using local gates in small numbers of dimensions. I show that a threshold result still exists in three, two, or one dimensions when next-to-nearest-neighbor gates are available, and present explicit constructions. In ..."
Abstract
-
Cited by 44 (2 self)
- Add to MetaCart
(Show Context)
I discuss how to perform fault-tolerant quantum computation with concatenated codes using local gates in small numbers of dimensions. I show that a threshold result still exists in three, two, or one dimensions when next-to-nearest-neighbor gates are available, and present explicit constructions. In two or three dimensions, I also show how nearestneighbor gates can give a threshold result. In all cases, I simply demonstrate that a threshold exists, and do not attempt to optimize the error correction circuit or determine the exact value of the threshold. The additional overhead due to the fault-tolerance in both space and time is polylogarithmic in the error rate per logical gate. 1
Quantum summation with an application to integration
, 2001
"... We study summation of sequences and integration in the quantum model of computation. We develop quantum algorithms for computing the mean of sequences which satisfy a p-summability ( condition and for d integration of functions from Lebesgue spaces Lp [0, 1] ) and analyze their convergence rates. We ..."
Abstract
-
Cited by 43 (11 self)
- Add to MetaCart
We study summation of sequences and integration in the quantum model of computation. We develop quantum algorithms for computing the mean of sequences which satisfy a p-summability ( condition and for d integration of functions from Lebesgue spaces Lp [0, 1] ) and analyze their convergence rates. We also prove lower bounds which show that the proposed algorithms are, in many cases, optimal within the setting of quantum computing. This extends recent results of Brassard, Høyer, Mosca, and Tapp (2000) on computing the mean for bounded sequences and complements results of Novak (2001) on integration of functions from Hölder classes.
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
, 2008
"... This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical multi-proof systems are obviously equivalent to classical single-proof systems (i.e., usual Merlin-Arthur proof systems), it ..."
Abstract
-
Cited by 41 (8 self)
- Add to MetaCart
(Show Context)
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical multi-proof systems are obviously equivalent to classical single-proof systems (i.e., usual Merlin-Arthur proof systems), it is unclear whether or not quantum multi-proof systems collapse to quantum single-proof systems (i.e., usual quantum Merlin-Arthur proof systems). This paper presents a necessary and sufficient condition under which the number of quantum proofs is reducible to two. It is also proved that, in the case of perfect soundness, using multiple quantum proofs
