Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

NTT technical review

Quantum Neural Network for Solving Complex Combinatorial Optimization Problems

Hiroki Takesue, Takahiro Inagaki, Kensuke Inaba, Toshimori Honjo

Published Jul 1, 2017• 8 citations
Publisher

Abstract

Optimization of various social systems, including communication, traffic, and social networking systems, requires the solving of complex combinatorial optimization problems.In this article, we describe the recent progress achieved in developing a quantum neural network, a computer that finds solutions to combinatorial optimization problems using a network of degenerate optical parametric oscillators.

DOI
10.53829/ntr201707fa2

Related papers

QNSA: Quantum Neural Simulated Annealing for Combinatorial Optimization

Seongbin Kwon, Dohun Kim, Sunghye Park +2 more

In the field of combinatorial optimization (CO), quantum computing is increasingly recognized for its potential to provide groundbreaking solutions. However, embedding the problems into quantum circuits presents significant challenges due to the complexities of scaling to large dimensions and the constraints in qubit count and circuit depth.In this paper, we introduce a quantum neural simulated annealing (QNSA) framework, combining both simulated annealing (SA) in the classical domain and quantum neural networks (QNNs) in the quantum domain to address the computational challenges for large-scale problems. By employing an SA algorithm, we can explore the vast combination space of optimization problems. In addition, by incorporating QNNs with proposed adaptive embedding and observable, our approach extends beyond the standalone capabilities of quantum computing, leveraging the unique strengths of both quantum and classical computing paradigms. Our experimental results show that the QNSA framework significantly outperforms traditional classical computing methods, showcasing its potential for efficient problem-solving in complex scenarios.

International Symposium on Quality Electronic Design (ISQED)•Apr 3, 2024•3 citations

Combinatorial optimization solving by coherent Ising machines based on spiking neural networks

Bo Lü, Yong‐Pan Gao, Kai Wen +1 more

Spiking neural network is a kind of neuromorphic computing that is believed to improve the level of intelligence and provide advantages for quantum computing. In this work, we address this issue by designing an optical spiking neural network and find that it can be used to accelerate the speed of computation, especially on combinatorial optimization problems. Here the spiking neural network is constructed by the antisymmetrically coupled degenerate optical parametric oscillator pulses and dissipative pulses. A nonlinear transfer function is chosen to mitigate amplitude inhomogeneities and destabilize the resulting local minima according to the dynamical behavior of spiking neurons. It is numerically shown that the spiking neural network-coherent Ising machines have excellent performance on combinatorial optimization problems, which is expected to offer new applications for neural computing and optical computing.

arXiv:2208.07502•Quantum•Oct 24, 2023•15 citations

Overview of Quantum Computing in Quantum Neural Network and Artificial Intelligence

M. Vasuki, A. Karunamurthy, R. Ramakrishnan +1 more

In recent years, quantum computing has emerged as a potentially gamechanging technology, with applications across various disciplines, including AI and machine learning.In recent years, the combination of quantum computing and neural networks has led to the development of quantum neural networks (QNNs).This paper explores the potential of QNNs and their applications in solving complex problems that are challenging for classical neural networks.This paper explores the fundamental principles of quantum computing, the architecture of QNNs, and their advantages over classical neural networks.Furthermore, this will highlight key research areas and challenges in the development and utilization of QNNs.Through an in-depth analysis, it demonstrates the QNNs hold significant promise for addressing complex computational problems and advancing the field of artificial intelligence.

Quing International Journal of Innovative Research in Science and Engineering•Jun 30, 2023•3 citations

Quantum Annealing for Combinatorial Optimization with Graph Neural Networks

Jincheng Zhang

This paper investigates the application of quantum annealing in conjunction with graph neural networks (GNNs) for solving complex combinatorial optimization problems. Traditional classical optimization algorithms often face significant challenges in identifying optimal solutions within large and intricate solution spaces. The core idea presented herein is to represent these problems as graphs and utilize the inherent quantum mechanical properties of quantum annealing to explore this space more efficiently. Specifically, GNNs are employed to generate embeddings of the graph, effectively encoding problem-specific features and relationships. This approach aims to bridge the gap between the probabilistic nature of quantum computation and the structural information captured by GNNs. We detail the theoretical framework, explore the potential benefits of this hybrid approach, and outline a methodology for integrating these techniques. The potential for improved optimization performance compared to conventional methods is discussed, highlighting the synergy between quantum annealing's ability to find low-energy states and GNNs' capacity to learn complex graph representations.

•Aug 31, 2026•0 citations

Quantum Neural Networks in Machine Learning: Problems and Prospects

K. Yu. Safronov

Despite rapid theoretical and practical progress, machine learning algorithms require large computational resources. However, new opportunities are opening up due to the advent of quantum computing devices that directly use the laws of quantum mechanics to bypass the technological and thermodynamic limitations of classical computing. Taking into account that artificial neural networks are actively used in solving a number of practical problems, with the advent of quantum computing technologies, the development of quantum neural networks for the implementation of quantum machine learning is very relevant. The article considers a quantum analogue of classical neurons that form quantum neural networks capable of performing universal quantum computations.

INFORMACIONNYE TEHNOLOGII•May 16, 2022•1 citation

Hamiltonian-Based Quantum Reinforcement Learning for Neural Combinatorial Optimization

Georg Kruse, Rodrigo Coelho, Andreas Roßkopf +2 more

Advancements in Quantum Computing (QC) and Neural Combinatorial Optimization (NCO) represent promising steps in tackling complex computational challenges. On the one hand, Variational Quantum Algorithms such as QAOA can be used to solve a wide range of combinatorial optimization problems. On the other hand, the same class of problems can be solved by NCO, a method that has shown promising results, particularly since the introduction of Graph Neural Networks. Given recent advances in both research areas, we introduce Hamiltonian-based Quantum Reinforcement Learning (QRL), an approach at the intersection of QC and NCO. We model our ansatzes directly on the combinatorial optimization problem's Hamiltonian formulation, which allows us to apply our approach to a broad class of problems. Our ansatzes show favourable trainability properties when compared to the hardware efficient ansatzes, while also not being limited to graph-based problems, unlike previous approaches. In this work, we evaluate the performance of Hamiltonian-based QRL on a diverse set of combinatorial optimization problems to demonstrate the broad applicability of our approach and compare it to QAOA.

arXiv:2405.07790•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•7 citations
Optimization of various social systems, including communication, traffic, and social networking systems, requires the solving of complex combinatorial optimization problems.In this article, we describe the recent progress achieved in developing a quantum neural network, a computer that finds solutions to combinatorial optimization problems using a network of degenerate optical parametric oscillators.
In the field of combinatorial optimization (CO), quantum computing is increasingly recognized for its potential to provide groundbreaking solutions. However, embedding the problems into quantum circuits presents significant challenges due to the complexities of scaling to large dimensions and the constraints in qubit count and circuit depth.In this paper, we introduce a quantum neural simulated annealing (QNSA) framework, combining both simulated annealing (SA) in the classical domain and quantum neural networks (QNNs) in the quantum domain to address the computational challenges for large-scale problems. By employing an SA algorithm, we can explore the vast combination space of optimization problems. In addition, by incorporating QNNs with proposed adaptive embedding and observable, our approach extends beyond the standalone capabilities of quantum computing, leveraging the unique strengths of both quantum and classical computing paradigms. Our experimental results show that the QNSA framework significantly outperforms traditional classical computing methods, showcasing its potential for efficient problem-solving in complex scenarios.
Spiking neural network is a kind of neuromorphic computing that is believed to improve the level of intelligence and provide advantages for quantum computing. In this work, we address this issue by designing an optical spiking neural network and find that it can be used to accelerate the speed of computation, especially on combinatorial optimization problems. Here the spiking neural network is constructed by the antisymmetrically coupled degenerate optical parametric oscillator pulses and dissipative pulses. A nonlinear transfer function is chosen to mitigate amplitude inhomogeneities and destabilize the resulting local minima according to the dynamical behavior of spiking neurons. It is numerically shown that the spiking neural network-coherent Ising machines have excellent performance on combinatorial optimization problems, which is expected to offer new applications for neural computing and optical computing.
In recent years, quantum computing has emerged as a potentially gamechanging technology, with applications across various disciplines, including AI and machine learning.In recent years, the combination of quantum computing and neural networks has led to the development of quantum neural networks (QNNs).This paper explores the potential of QNNs and their applications in solving complex problems that are challenging for classical neural networks.This paper explores the fundamental principles of quantum computing, the architecture of QNNs, and their advantages over classical neural networks.Furthermore, this will highlight key research areas and challenges in the development and utilization of QNNs.Through an in-depth analysis, it demonstrates the QNNs hold significant promise for addressing complex computational problems and advancing the field of artificial intelligence.
This paper investigates the application of quantum annealing in conjunction with graph neural networks (GNNs) for solving complex combinatorial optimization problems. Traditional classical optimization algorithms often face significant challenges in identifying optimal solutions within large and intricate solution spaces. The core idea presented herein is to represent these problems as graphs and utilize the inherent quantum mechanical properties of quantum annealing to explore this space more efficiently. Specifically, GNNs are employed to generate embeddings of the graph, effectively encoding problem-specific features and relationships. This approach aims to bridge the gap between the probabilistic nature of quantum computation and the structural information captured by GNNs. We detail the theoretical framework, explore the potential benefits of this hybrid approach, and outline a methodology for integrating these techniques. The potential for improved optimization performance compared to conventional methods is discussed, highlighting the synergy between quantum annealing's ability to find low-energy states and GNNs' capacity to learn complex graph representations.
Despite rapid theoretical and practical progress, machine learning algorithms require large computational resources. However, new opportunities are opening up due to the advent of quantum computing devices that directly use the laws of quantum mechanics to bypass the technological and thermodynamic limitations of classical computing. Taking into account that artificial neural networks are actively used in solving a number of practical problems, with the advent of quantum computing technologies, the development of quantum neural networks for the implementation of quantum machine learning is very relevant. The article considers a quantum analogue of classical neurons that form quantum neural networks capable of performing universal quantum computations.
Advancements in Quantum Computing (QC) and Neural Combinatorial Optimization (NCO) represent promising steps in tackling complex computational challenges. On the one hand, Variational Quantum Algorithms such as QAOA can be used to solve a wide range of combinatorial optimization problems. On the other hand, the same class of problems can be solved by NCO, a method that has shown promising results, particularly since the introduction of Graph Neural Networks. Given recent advances in both research areas, we introduce Hamiltonian-based Quantum Reinforcement Learning (QRL), an approach at the intersection of QC and NCO. We model our ansatzes directly on the combinatorial optimization problem's Hamiltonian formulation, which allows us to apply our approach to a broad class of problems. Our ansatzes show favourable trainability properties when compared to the hardware efficient ansatzes, while also not being limited to graph-based problems, unlike previous approaches. In this work, we evaluate the performance of Hamiltonian-based QRL on a diverse set of combinatorial optimization problems to demonstrate the broad applicability of our approach and compare it to QAOA.