The geometry of quantum learning

@article{Hunziker2010TheGO,
  title={The geometry of quantum learning},
  author={Markus Hunziker and David A. Meyer and Ji-Heon Park and James Pommersheim and Mitch Rothstein},
  journal={Quantum Information Processing},
  year={2010},
  volume={9},
  pages={321-341}
}
Concept learning provides a natural framework in which to place the problems solved by the quantum algorithms of Bernstein-Vazirani and Grover. By combining the tools used in these algorithms—quantum fast transforms and amplitude amplification—with a novel (in this context) tool—a solution method for geometrical optimization problems—we derive a general technique for quantum concept learning. We name this technique “Amplified Impatient Learning” and apply it to construct quantum algorithms… 
Quantum algorithms and learning theory
TLDR
A quantum algorithm to solve a search space of N elements using essentially sqrt{N} queries and other operations, improving over the gate count of Grover's algorithm is described.
An introduction to quantum machine learning
TLDR
This contribution gives a systematic overview of the emerging field of quantum machine learning and presents the approaches as well as technical details in an accessible way, and discusses the potential of a future theory of quantum learning.
A Survey of Quantum Learning Theory
TLDR
The main results known for three models of learning are described: exact learning from membership queries, and Probably Approximately Correct (PAC) and agnostic learning from classical or quantum examples.
Guest Column: A Survey of Quantum Learning Theory
TLDR
The main results known for three models of learning are described: exact learning from membership queries, and Probably Approximately Correct (PAC) and agnostic learning from classical or quantum examples.
Efficient algorithms in quantum query complexity
TLDR
These algorithms are a novel application of the quantum walk search framework and give improved upper bounds for several subgraph-finding problems and study the quantum query complexity of matrix multiplication and related problems over rings, semirings, and the Boolean semiring in particular.
Machine Learning Algorithms in Quantum Computing: A Survey
TLDR
An overview of the current state of knowledge in application of ML on QC is presented, and the speed up, and complexity advantages of using quantum machines are evaluated.
Structure, randomness and complexity in quantum computation
TLDR
This thesis begins by giving a necessary and sufficient condition for one notion of a quantum walk to be defined on a directed graph, and goes on to derive conditions on the structure of graphs that allow a quantum advantage in a non-local graph colouring game.
Quantum Computing for Pattern Classification
TLDR
A quantum pattern classification algorithm is introduced that draws on Trugenberger’s proposal for measuring the Hamming distance on a quantum computer and is discussed using handwritten digit recognition as from the MNIST database.
Potential Quantum Advantages
In this last chapter, we summarise some of the results and efforts to understand the potential power of quantum machine learning algorithms. We will first have a closer look at different criteria for
An optimal quantum algorithm for the oracle identification problem
TLDR
The algorithm considerably simplifies and improves the previous best algorithm due to Ambainis et al. and removes all log factors from the best known quantum algorithm for Boolean matrix multiplication.
...
...

References

SHOWING 1-10 OF 72 REFERENCES
A framework for fast quantum mechanical algorithms
TLDR
The sqrt(N) step quantum search algorithm is an immediate consequence of a framework for the design and analysis of quantum mechanical algorithms, and several other search-type applications are presented.
Quantum Counting
TLDR
This work generalizes the Grover iteration in the light of a concept called amplitude amplification, and shows that the quadratic speedup obtained by the quantum searching algorithm over classical brute force can still be obtained for a large family of search problems for which good classical heuristics exist.
Poly-Locality in Quantum Computing
TLDR
A class of poly-local transformations, which include the discrete orthogonal wavelet transforms, are described in the hope that these may be helpful in constructing new quantum algorithms.
Quantum algorithms revisited
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum
Quantum Algorithms for Weighing Matrices and Quadratic Residues
  • W. V. Dam
  • Mathematics, Computer Science
    Algorithmica
  • 2002
TLDR
It is shown how the properties of a weighing matrix can be used to construct a problem for which the quantum query complexity is significantly lower than the classical one, and designed a query problem that uses the Legendre symbol χ.
An exact quantum polynomial-time algorithm for Simon's problem
  • G. Brassard, P. Høyer
  • Computer Science, Mathematics
    Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems
  • 1997
TLDR
It is shown that there is a decision problem that can be solved in exact quantum polynomial time, which would require expected exponential time on any classical bounded-error probabilistic computer if the data is supplied as a black box.
Efficient Quantum Transforms
TLDR
A novel network for computing a Fourier transform for a group used in quantum errorcorrection is given and a slightly relaxed definition is shown to simplify the analysis and the networks that computes the transforms.
Reversing quantum dynamics with near-optimal quantum and classical fidelity
We consider the problem of reversing quantum dynamics, with the goal of preserving an initial state’s quantum entanglement or classical correlation with a reference system. We exhibit an approximate
Quantum versus classical learnability
  • R. Servedio, S. Gortler
  • Computer Science
    Proceedings 16th Annual IEEE Conference on Computational Complexity
  • 2001
TLDR
This work considers quantum versions of two well-studied models of learning Boolean functions: Angluin's model of exact learning from membership queries and Valiant's Probably Approximately Correct (PAC) model of learning from random examples to establish a polynomial relationship between the number of quantum versus classical queries required for learning.
Sophisticated quantum search without entanglement
  • Meyer
  • Computer Science, Physics
    Physical review letters
  • 2000
TLDR
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.
...
...