A strategy for quantum algorithm design assisted by machine learning

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 a Deutsch–Jozsa problem. We showed by using Monte Carlo simulations that our simulator can faithfully learn a quantum algorithm for solving the problem for a given oracle. Remarkably, the learning time is proportional to the square root of the total number of parameters, rather than showing the exponential dependence found in the classical machine learning-based method.

[1]  Alexander Hentschel,et al.  Machine learning for precise quantum measurement. , 2009, Physical review letters.

[2]  d-outcome measurement for a nonlocality test , 2003, quant-ph/0309193.

[3]  Jeongho Bang,et al.  Quantum learning speedup in binary classification , 2013 .

[4]  Masaru Uchiyama,et al.  Formation of High-Speed Motion Pattern of a Mechanical Arm by Trial , 1978 .

[5]  Caslav Brukner,et al.  The speed of quantum and classical learning for performing the kth root of NOT , 2009, 0904.4571.

[6]  J. Eberly,et al.  N-Level Coherence Vector and Higher Conservation Laws in Quantum Optics and Quantum Mechanics , 1981 .

[7]  Lov K. Grover.  Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[8]  Pat Langley,et al.  Elements of Machine Learning , 1995 .

[9]  Peter W. Shor,et al.  Why haven't more quantum algorithms been found? , 2003, JACM.

[10]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[11]  Andries Petrus Engelbrecht,et al.  A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[12]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[13]  K. Kim,et al.  Deutsch-Jozsa algorithm as a test of quantum computation , 1998, quant-ph/9807012.

[14]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[15]  Prem Kumar,et al.  Quantum algorithm design using dynamic learning , 2008, Quantum Inf. Comput..

[16]  Klaus Molmer,et al.  Quantum learning by measurement and feedback , 2008, 0803.1418.

[17]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[18]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[19]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[20]  David Collins,et al.  Scaling issues in ensemble implementations of the Deutsch-Jozsa algorithm , 2003 .

[21]  Procedures for realizing an approximate universal-NOT gate , 2012, 1208.2111.

[22]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[23]  G. D’Ariano,et al.  Optimal quantum learning of a unitary transformation , 2009, 0903.0543.

[24]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[25]  Gerber,et al.  Control of chemical reactions by feedback-optimized phase-shaped femtosecond laser pulses , 1998, Science.

[26]  Jaehyun Kim,et al.  Implementing unitary operators in quantum computation , 2000 .

[27]  L. Ioffe,et al.  Physical implementation of protected qubits , 2012, Reports on progress in physics. Physical Society.

[28]  Jeongho Bang,et al.  Quantum Learning Machine , 2008, 0803.2976.

[29]  Elham Kashefi,et al.  Comparison of quantum oracles , 2002 .

[30]  R. Cleve,et al.  Quantum algorithms revisited , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[31]  J. K. Kinnear,et al.  Advances in Genetic Programming , 1994 .

[32]  Jeongho Bang,et al.  A genetic-algorithm-based method to find unitary transformations for any desired quantum computation and application to a one-bit oracle decision problem , 2014, 1403.2827.

[33]  Luc De Raedt,et al.  Inductive Logic Programming: Theory and Methods , 1994, J. Log. Program..

[34]  Wei Chu,et al.  A new evolutionary search strategy for global optimization of high-dimensional problems , 2011, Inf. Sci..

[35]  Masahide Sasaki,et al.  Quantum learning and universal quantum matching machine , 2002 .

[36]  Reck,et al.  Experimental realization of any discrete unitary operator. , 1994, Physical review letters.