Abstract
In this paper, a new quantum algorithm for solving the combinatorial optimization problems is discussed. It is based on the quantum adiabatic evolution algorithm. We propose a new method for synthesizing a Hamiltonian inspired by a Hopfield network in order to improve calculation cost. The quantum system given by a new Hamiltonian has neuron-like interactions and shows quantum behavior. We present simulation results of the new algorithm for the 4-queen problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shor, P.W.: Polynomial-time algorithm for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, (1997) 1484.
Grover, L.K.: A fast quantum mechanical algorithm for database search. in Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, May, (1996) 212–219.
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., Preda, D.: A quantum adiabatic evolution algorithm applied to random instances of an NPcomplete problem. Science 292, (2001) 472.
Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution. quant-ph/0001106.
Farhi, E., Goldstone, J., Gutmann, S.: A numerical study of the performance of a quantum adiabatic evolution algorithm for satisfiability. quant-ph/0007071.
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., Preda, D.: A quantum adiabatic evolution algorithm applied to random instances of an NPcomplete problem. quant-ph/0104129.
Messiah, A.: Quantum Mechanics. Dover, New York, (1999) p. 739.
Kinjo, M., Sato, S., Nakajima, K.: Advantage and disadvantage of the quantum adiabatic evolution algorithm for combinatorial optimization problems. Abstracts of the 10th JST International Symposium (ISQC), Tokyo, Japan, March, (2002), P-2.
Tank, D.W., Hopfield, J.J.: Simple ‘neural’ optimization networks: An A/D converter, signal decision circuit, and a linear programming circuit. IEEE Trans. Circuits Syst. 35, (1988) 1273.
Loss, D., DiVincenzo, D.P.: Quantum computation with quantum dots. Phys. Rev. A, 57, (1997), 120–126.
Kane, B.E.: A silicon-based nuclear spin quantum computer. Nature, 393, (1998) 133–137.
Golub, G.H., van Loan, C.F.: Matrix Computations, 3rd Ed. Johns Hopkins University, Baltimore, MD, (1996) 572.
Tagliarini, G.A., Page, E.W.: Solving constraint satisfaction problems with neural networks. Proceedings of the IEEE International Conference on Neural Networks, 3, (1987) 741–747.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kinjo, M., Sato, S., Nakajima, K. (2003). Quantum Adiabatic Evolution Algorithm for a Quantum Neural Network. In: Kaynak, O., Alpaydin, E., Oja, E., Xu, L. (eds) Artificial Neural Networks and Neural Information Processing — ICANN/ICONIP 2003. ICANN ICONIP 2003 2003. Lecture Notes in Computer Science, vol 2714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44989-2_113
Download citation
DOI: https://doi.org/10.1007/3-540-44989-2_113
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40408-8
Online ISBN: 978-3-540-44989-8
eBook Packages: Springer Book Archive