Results 1  10
of
183
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 483 (5 self)
 Add to MetaCart
Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This construction is substantially more complicated than the corresponding construction for classical Turing machines (TMs); in fact, even simple primitives such as looping, branching, and composition are not straightforward in the context of quantum Turing machines. We establish how these familiar primitives can be implemented and introduce some new, purely quantum mechanical primitives, such as changing the computational basis and carrying out an arbitrary unitary transformation of polynomially bounded dimension. We also consider the precision to which the transition amplitudes of a quantum Turing machine need to be specified. We prove that O(log T) bits of precision suffice to support a T step computation. This justifies the claim that the quantum Turing machine model should be regarded as a discrete model of computation and not an analog one. We give the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church–Turing thesis. We show the existence of a problem, relative to an oracle, that can be solved in polynomial time on a quantum Turing machine, but requires superpolynomial time on a boundederror probabilistic Turing machine, and thus not in the class BPP. The class BQP of languages that are efficiently decidable (with small errorprobability) on a quantum Turing machine satisfies BPP ⊆ BQP ⊆ P ♯P. Therefore, there is no possibility of giving a mathematical proof that quantum Turing machines are more powerful than classical probabilistic Turing machines (in the unrelativized setting) unless there is a major breakthrough in complexity theory.
On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts  Towards Memetic Algorithms
, 1989
"... Short abstract, isn't it? P.A.C.S. numbers 05.20, 02.50, 87.10 1 Introduction Large Numbers "...the optimal tour displayed (see Figure 6) is the possible unique tour having one arc fixed from among 10 655 tours that are possible among 318 points and have one arc fixed. Assuming that one could ..."
Abstract

Cited by 187 (10 self)
 Add to MetaCart
Short abstract, isn't it? P.A.C.S. numbers 05.20, 02.50, 87.10 1 Introduction Large Numbers "...the optimal tour displayed (see Figure 6) is the possible unique tour having one arc fixed from among 10 655 tours that are possible among 318 points and have one arc fixed. Assuming that one could possibly enumerate 10 9 tours per second on a computer it would thus take roughly 10 639 years of computing to establish the optimality of this tour by exhaustive enumeration." This quote shows the real difficulty of a combinatorial optimization problem. The huge number of configurations is the primary difficulty when dealing with one of these problems. The quote belongs to M.W Padberg and M. Grotschel, Chap. 9., "Polyhedral computations", from the book The Traveling Salesman Problem: A Guided tour of Combinatorial Optimization [124]. It is interesting to compare the number of configurations of realworld problems in combinatorial optimization with those large numbers arising in Cosmol...
Oracle quantum computing
 Brassard & U.Vazirani, Strengths and weaknesses of quantum computing
, 1994
"... \Because nature isn't classical, dammit..." ..."
Topological quantum computation
 Bull. Amer. Math. Soc. (N.S
"... Abstract. The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in WittenChernSimons theory. The braiding and fusion of anyonic excitations ..."
Abstract

Cited by 109 (14 self)
 Add to MetaCart
Abstract. The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in WittenChernSimons theory. The braiding and fusion of anyonic excitations in quantum Hall electron liquids and 2Dmagnets are modeled by modular functors, opening a new possibility for the realization of quantum computers. The chief advantage of anyonic computation would be physical error correction: An error rate scaling like e−αℓ, where ℓ is a length scale, and α is some positive constant. In contrast, the “presumptive ” qubitmodel of quantum computation, which repairs errors combinatorically, requires a fantastically low initial error rate (about 10−4) before computation can be stabilized. Quantum computation is a catchall for several models of computation based on a theoretical ability to manufacture, manipulate and measure quantum states. In this context, there are three areas where remarkable algorithms have been found: searching a data base [15], abelian groups (factoring and discrete logarithm) [19],
Efficient simulation of quantum systems by quantum computers. Online preprint quantph/9603026
, 1996
"... We show that the time evolution of the wave function of a quantummechanical manyparticle system can be simulated precisely and efficiently on a quantum computer. The time needed for such a simulation is comparable to the time of a conventional simulation of the corresponding classical system, a per ..."
Abstract

Cited by 58 (0 self)
 Add to MetaCart
We show that the time evolution of the wave function of a quantummechanical manyparticle system can be simulated precisely and efficiently on a quantum computer. The time needed for such a simulation is comparable to the time of a conventional simulation of the corresponding classical system, a performance which can’t be expected from any classical simulation of a quantum system. We then show how quantities of interest, like the energy spectrum of a system, can be obtained. We also indicate that ultimately the simulation of quantum field theory might be possible on large quantum computers.
Parallel quantum computation
 Complexity, Entropy, and the Physics of Information,SFI Studies in the Sciences of Complexity
, 1990
"... A computer is a physical system which has a very general ability to simulate other physical systems (and in particular, other computers). In this paper we investigate the question of whether microscopic quantum systems can be computers. Using a reversible cellular automaton model of computation we i ..."
Abstract

Cited by 53 (10 self)
 Add to MetaCart
A computer is a physical system which has a very general ability to simulate other physical systems (and in particular, other computers). In this paper we investigate the question of whether microscopic quantum systems can be computers. Using a reversible cellular automaton model of computation we illustrate several approaches to this question. We then attempt to extend Feynman’s construction of a quantum computer in order to arrive at a quantum model of parallel processing. 1
Synthesis of Reversible Logic Circuits
, 2003
"... Reversible or informationlossless circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requirement in the emerging field of quantum computation. We investigate the synthesis of reversible circuits that employ a minim ..."
Abstract

Cited by 48 (6 self)
 Add to MetaCart
Reversible or informationlossless circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requirement in the emerging field of quantum computation. We investigate the synthesis of reversible circuits that employ a minimum number of gates and contain no redundant inputoutput linepairs (temporary storage channels). We prove constructively that every even permutation can be implemented without temporary storage using NOT, CNOT and TOFFOLI gates. We describe an algorithm for the synthesis of optimal circuits and study the reversible functions on three wires, reporting the distribution of circuit sizes. Finally, in an application important to quantum computing, we synthesize oracle circuits for Grover's search algorithm, and show a significant improvement over a previously proposed synthesis algorithm.
Simulating quantum mechanics on a quantum computer
 PHYSICA D
, 1998
"... Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrödinger equation for interacting manybody systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quant ..."
Abstract

Cited by 41 (3 self)
 Add to MetaCart
Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrödinger equation for interacting manybody systems are presented in some detail. These algorithms would make it possible to simulate nonrelativistic quantum systems on a quantum computer with an exponential speedup compared to simulations on classical computers. Issues involved in simulating relativistic systems of Dirac or gauge particles are discussed.
QuantumInspired Computing
, 1995
"... The paper identifies and demonstrates the feasibility of a novel computational paradigm which is inspired by the principles of quantum mechanics and quantum computing. A brief history of quantum computing and basic exposition of quantum mechanics are provided, followed by a detailed description of S ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
The paper identifies and demonstrates the feasibility of a novel computational paradigm which is inspired by the principles of quantum mechanics and quantum computing. A brief history of quantum computing and basic exposition of quantum mechanics are provided, followed by a detailed description of Shor's quantum `algorithm' for factoring very large numbers. An extension to Shor's method is described, and this leads to two further applications of `quantuminspired' methods: sorting, and the 15puzzle. In all cases, quantuminspired methods require the use of `classical' methods to determine whether the candidate answers provided by the quantuminspired methods are correct. Finally, some basic methodological principles and guidelines are provided for quantuminspired computing. The aim is not to provide a formal exposition of quantuminspired computing but to identify its novelty and potential use in tackling NPhard problems. 1 Introduction It has been estimated that every two years ...
Information Distance
, 1997
"... While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distance between two individual objects, for example, two pictures. We give several natural definitions of a universal inf ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distance between two individual objects, for example, two pictures. We give several natural definitions of a universal information metric, based on length of shortest programs for either ordinary computations or reversible (dissipationless) computations. It turns out that these definitions are equivalent up to an additive logarithmic term. We show that the information distance is a universal cognitive similarity distance. We investigate the maximal correlation of the shortest programs involved, the maximal uncorrelation of programs (a generalization of the SlepianWolf theorem of classical information theory), and the density properties of the discrete metric spaces induced by the information distances. A related distance measures the amount of nonreversibility of a computation. Using the physical theo...