Poly-Locality in Quantum Computing

  title={Poly-Locality in Quantum Computing},
  author={Michael H. Freedman},
  journal={Foundations of Computational Mathematics},
  • M. Freedman
  • Published 20 January 2000
  • Mathematics, Physics, Computer Science
  • Foundations of Computational Mathematics
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at a fine scale, these are precisely the transformations which will be available from physics to solve computational problems. The poly-locality of a discrete Fourier transform on cyclic groups is at the heart of Shor's factoring algorithm. We describe a class of poly-local transformations, which include the discrete… Expand
Bibliographic guide to the foundations of quantum mechanics and quantum information
This is a collection of references (papers, books, preprints, book reviews, Ph. D. thesis, patents, web sites, etc.), sorted alphabetically and (some of them) classified by subject, on foundations ofExpand
Quantum algorithms using the curvelet transform
  • Yi-Kai Liu
  • Mathematics, Computer Science
  • STOC '09
  • 2009
This work gives an efficient implementation of a quantum curvelet transform, together with two applications: a single-shot measurement procedure for approximately finding the center of a ball in Rn, given a quantum-sample over the ball; and, a quantum algorithm for finding the Center of a radial function over RN, given oracle access to the function. Expand
The geometry of quantum learning
This work derives a general technique for quantum concept learning called Amplified Impatient Learning and applies it to construct quantum algorithms solving two new problems: Battleship and Majority, more efficiently than is possible classically. Expand
Decoherence, Control, and Symmetry in Quantum Computers
Methods for avoiding the detrimental effects of decoherence while at the same time still allowing for computation of the quantum information are described and explicit gate constructions for encoded universality on ion trap and exchange based quantum computers are given. Expand
Sophisticated quantum search without entanglement
  • Meyer
  • Computer Science, Medicine
  • Physical review letters
  • 2000
There is a quantum algorithm which searches a "sophisticated" database with a single query, but which it is shown does not require entanglement even for multiparticle implementations. Expand
Physical quantum algorithms
I review the differences between classical and quantum systems, emphasizing the connection between no-hidden variable theorems and superior computational power of quantum computers. Using quantumExpand
Quantum computation of multifractal exponents through the quantum wavelet transform
We study the use of the quantum wavelet transform to extract efficiently information about the multifractal exponents for multifractal quantum states. We show that, combined with quantum simulationExpand
Some connections between operator theory and wavelet anal- ysis: Since the mid eighties, it has become clear that key tools in wavelet analysis rely crucially on operator theory. While isolatedExpand
Wavelets Through a Looking Glass: The World of the Spectrum
Preface * List of Figures * List of Tables * 1. Introduction * 2.Homotopy Theory and Cascades * 3. Can You Hear the Shape of a Wavelet?* 4. The Transfer Operator and Perron-Frobenius Theory * 5. TheExpand


Simulation of Topological Field Theories¶by Quantum Computers
Abstract: Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for aExpand
Efficient Quantum Transforms
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitaryExpand
Efficient networks for quantum factoring.
The number of memory quantum bits (qubits) and the number of operations required to perform factorization, using the algorithm suggested by Shor are estimated. Expand
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Mathematics, Computer Science
  • Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given. Expand
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits
This paper derives efficient, complete, quantum circuits for two representative quantum wavelet transforms by factor the classical operators for these transforms into direct sums, direct products and dot products of unitary matrices, and finds that permutation matrices play a pivotal role. Expand
Quantum networks for elementary arithmetic operations.
  • Vedral, Barenco, Ekert
  • Physics, Medicine
  • Physical review. A, Atomic, molecular, and optical physics
  • 1996
This work provides an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation, and shows that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorized. Expand
Quantum computations: algorithms and error correction
Contents §0. Introduction §1. Abelian problem on the stabilizer §2. Classical models of computations2.1. Boolean schemes and sequences of operations2.2. Reversible computations §3. QuantumExpand
Quantum Computation and Quantum Information
Preface Acknowledgement Nomenclature and notation Part I. Fundamental Concepts: 1. Introduction and overview 2. Introduction to quantum mechanics 3. Introduction to computer science Part II. QuantumExpand
Fractional statistics and anyon superconductivity
The occurrence of fractional statistics has been discovered in more and more quantum field theory models, including some of the most geometrical and canonical ones. In a remarkable case, theExpand
Truncation of wavelet matrices: Edge effects and the reduction of topological control
Abstract Edge effects and Gibbs phenomena are a ubiquitous problem in signal processing. We show how this problem can arise from a mismatch between the “topology” of the data D (e.g., an interval inExpand