A strategy for quantum algorithm design assisted by machine learning

@article{Bang2014ASF,
  title={A strategy for quantum algorithm design assisted by machine learning},
  author={Jeongho Bang and Junghee Ryu and Seokwon Yoo and M. Pawłowski and Jinhyoung Lee},
  journal={New Journal of Physics},
  year={2014},
  volume={16},
  pages={073017}
}
We propose a method for quantum algorithm design assisted by machine learning. The method uses a quantum–classical hybrid simulator, where a 'quantum student' is being taught by a 'classical teacher'. In other words, in our method, the learning system is supposed to evolve into a quantum algorithm for a given problem, assisted by a classical main-feedback system. Our method is applicable for designing quantum oracle-based algorithms. We chose, as a case study, an oracle decision problem, called… Expand

Figures from this paper

A quantum speedup in machine learning: finding an N-bit Boolean function for a classification
We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the twoExpand
Protocol for secure quantum machine learning at a distant place
TLDR
A novel protocol is presented in which an arbitrarily initialized device at a learner’s location is taught by a provider located at a distant place, designed such that any external learner who attempts to participate in or disrupt the learning process can be prohibited or noticed. Expand
A genetic-algorithm-based method to find unitary transformations for any desired quantum computation and application to a one-bit oracle decision problem
TLDR
A genetic-algorithm-based method to find the unitary transformations for any desired quantum computation and to generalize the corresponding quantum algorithms for a realistic problem, the one-bit oracle decision problem, or the often-called Deutsch problem. Expand
Learning unknown pure quantum states
We propose a learning method for estimating unknown pure quantum states. The basic idea of our method is to learn a unitary operation $\hat{U}$ that transforms a given unknown stateExpand
Machine learning for long-distance quantum communication
TLDR
It is shown that machine learning can be used to identify central quantum protocols, including teleportation, entanglement purification and the quantum repeater, based on a model of a learning agent that combines reinforcement learning and decision making in a physically motivated framework. Expand
Variational Quantum Information Processing
TLDR
This dissertation presents the application of the variational quantum computing approach to problems in quantum simulation, quantum state preparation, quantum error-correction, and generative modeling, and establishes practical guidelines to implement these methods on near-term quantum computers. Expand
Blind quantum machine learning
Blind quantum machine learning (BQML) enables a classical client with little quantum technology to delegate a remote quantum machine learning to the quantum server in such a approach that the privacyExpand
Dynamics of Driven Quantum Systems: A Search for Parallel Algorithms
TLDR
This thesis explores the possibility of using parallel algorithms to calculate the dynamics of driven quantum systems prevalent in atomic physics by borrowing a Bayesian global optimisation method from the machine learning community in an effort to find the optimum conditions in different systems quicker than textbook optimisation algorithms. Expand
Distributed secure quantum machine learning
TLDR
A DSQML protocol that the client can classify two-dimensional vectors to different clusters, resorting to a remote small-scale photon quantum computation processor and the protocol is secure without leaking any relevant information to the Eve. Expand
Quantum machine learning with glow for episodic tasks and decision games
TLDR
A reinforcement learning (RL) agent is described by an update rule that is inspired by the projective simulation (PS) model and equipped with a glow mechanism that allows for a backpropagation of policy changes, analogous to the eligibility traces in RL and edge glow in PS. Expand
...
1
2
...

References

SHOWING 1-10 OF 46 REFERENCES
The speed of quantum and classical learning for performing the kth root of NOT
TLDR
An explicit example of the task for which numerical simulations show that quantum learning is faster than its classical counterpart is found, and the reason for this speed-up is that the classical machine requires memory of size logk = m to accomplish the learning, while the memory of a single qubit is sufficient for the quantum machine for any k. Expand
Quantum algorithm design using dynamic learning
TLDR
A dynamic learning paradigm for "programming" a general quantum computer, used to find the control parameters for a coupled qubitsystem, such that the system at an initial time evolves to a state in which a given measurementresponds to the desired operation. Expand
Quantum Learning Machine
School of Mathematics and Physics, The Queen’s University of Belfast, BT7 1NN, United Kingdom(Received March 31, 2008)We propose a novel notion of a quantum learning machine for automaticallyExpand
Machine learning for precise quantum measurement.
TLDR
This work adapts machine learning for quantum information and uses its framework to generate autonomous adaptive feedback schemes for quantum measurement that outperform the best known adaptive scheme for interferometric phase estimation. Expand
Optimal quantum learning of a unitary transformation
We address the problem of learning an unknown unitary transformation from a finite number of examples. The problem consists in finding the learning machine that optimally emulates the examples, thusExpand
Quantum learning speedup in binary classification
TLDR
It is shown that quantum superposition enables quantum learning faster than classical learning by expanding the solution regions and is demonstrated by numerical simulations with a standard feedback model, random search, and a practical model, differential evolution. Expand
A genetic-algorithm-based method to find unitary transformations for any desired quantum computation and application to a one-bit oracle decision problem
TLDR
A genetic-algorithm-based method to find the unitary transformations for any desired quantum computation and to generalize the corresponding quantum algorithms for a realistic problem, the one-bit oracle decision problem, or the often-called Deutsch problem. Expand
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Quantum mechanics can speed up a range of search applications over unsorted data. For example, imagine a phone directory containing $N$ names arranged in completely random order. To find someone'sExpand
Deutsch-Jozsa algorithm as a test of quantum computation
A redundancy in the existing Deutsch-Jozsa quantum algorithm is removed and a refined algorithm, which reduces the size of the register and simplifies the function evaluation, is proposed. TheExpand
Quantum learning by measurement and feedback
We investigate an approach to quantum computing in which quantum gate strengths are parametrized by quantum degrees of freedom. The capability of the quantum computer to perform desired tasks isExpand
...
1
2
3
4
5
...