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

Quantum annealing: Messages to and from Japan

秀稔 西森, Hidetoshi Nishimori

Published May 1, 2016• 0 citations
OpenAlex

Related papers

Demonstration of a compatibility-based childcare support service using quantum annealing

Yuuma Matsumoto, Taisei Takabayashi, Rima Sato +2 more

In contemporary Japan, isolated parenting has become a serious social issue, increasing psychological stress on parents and potentially affecting children's development. Existing childcare support services tend to focus on physical assistance, while psychological support and community connections remain insufficient. To address this gap, we developed a service that connects parents with senior community members who have parenting experience, aiming to provide psychological support and foster intergenerational exchange. Achieving high-quality matching requires considering pair compatibility, balancing supporter workload, and handling scheduling constraints, which can be formulated as a combinatorial optimization problem. We represented this matching problem as a Quadratic Unconstrained Binary Optimization (QUBO) model and evaluated a quantum-annealing-based sampling pipeline against simulated annealing (SA) and the exact mixed-integer optimization solver Gurobi. In randomized benchmark instances, the QA-based pipeline generated high-quality and diverse matching candidates, particularly for larger instances; at [Formula: see text], the mean best relative error was 1.94% for QA with post-processing and 7.45% for SA. Furthermore, a proof-of-concept field experiment conducted in Sendai City, Japan, demonstrated that the framework can generate multiple high-quality matching candidates, enabling flexible scheduling in real-world operations.

arXiv:2509.08520•Scientific Reports•Jul 21, 2026•1 citation

Quantum annealing: near future applications

Oscar Escolano Rubio

•Nov 1, 2020•0 citations

Perspectives of quantum annealing: Methods and implementations

秀稔 西森, Hidetoshi Nishimori

•May 1, 2020•0 citations

Control of Automated Guided Vehicles Without Collision by Quantum Annealer and Digital Devices

Masayuki Ohzeki, Akira Miki, Masamichi J. Miyama +1 more

Recent advance on quantum devices realizes an artificial quantum spin system known as the D-Wave 2000Q, which implements the Ising model with tunable transverse field. In this system, we perform a specific protocol of quantum annealing to attain the ground state, the minimizer of the energy. Therefore the device is often called the quantum annealer. However the resulting spin configurations are not always in the ground state. It can rather quickly generate many spin configurations following the Gibbs-Boltzmann distribution. In the present study, we formulate an Ising model to control a large number of automated guided vehicles in a factory without collision. We deal with an actual factory in Japan, in which vehicles run, and assess efficiency of our formulation. Compared to the conventional powerful techniques performed in digital computer, still the quantum annealer does not show outstanding advantage in the practical problem. Our study demonstrates a possibility of the quantum annealer to contribute solving industrial problems.

arXiv:1812.01532•Frontiers in Computer Science•Nov 19, 2019•115 citations

Quantum annealing – foundations and frontiers

Eliahu Cohen, Boaz Tamir

arXiv:1408.5784•The European Physical Journal Special Topics•Feb 1, 2015•19 citations

Breaking limitation of quantum annealer in solving optimization problems under constraints

Masayuki Ohzeki

Quantum annealing is a generic solver for optimization problems that uses fictitious quantum fluctuation. The most groundbreaking progress in the research field of quantum annealing is its hardware implementation, i.e., the so-called quantum annealer, using artificial spins. However, the connectivity between the artificial spins is sparse and limited on a special network known as the chimera graph. Several embedding techniques have been proposed, but the number of logical spins, which represents the optimization problems to be solved, is drastically reduced. In particular, an optimization problem including fully or even partly connected spins suffers from low embeddable size on the chimera graph. In the present study, we propose an alternative approach to solve a large-scale optimization problem on the chimera graph via a well-known method in statistical mechanics called the Hubbard-Stratonovich transformation or its variants. The proposed method can be used to deal with a fully connected Ising model without embedding on the chimera graph and leads to nontrivial results of the optimization problem. We tested the proposed method with a number of partition problems involving solving linear equations and the traffic flow optimization problem in Sendai and Kyoto cities in Japan.

arXiv:2002.05298•Scientific Reports•Feb 20, 2020•73 citations
In contemporary Japan, isolated parenting has become a serious social issue, increasing psychological stress on parents and potentially affecting children's development. Existing childcare support services tend to focus on physical assistance, while psychological support and community connections remain insufficient. To address this gap, we developed a service that connects parents with senior community members who have parenting experience, aiming to provide psychological support and foster intergenerational exchange. Achieving high-quality matching requires considering pair compatibility, balancing supporter workload, and handling scheduling constraints, which can be formulated as a combinatorial optimization problem. We represented this matching problem as a Quadratic Unconstrained Binary Optimization (QUBO) model and evaluated a quantum-annealing-based sampling pipeline against simulated annealing (SA) and the exact mixed-integer optimization solver Gurobi. In randomized benchmark instances, the QA-based pipeline generated high-quality and diverse matching candidates, particularly for larger instances; at [Formula: see text], the mean best relative error was 1.94% for QA with post-processing and 7.45% for SA. Furthermore, a proof-of-concept field experiment conducted in Sendai City, Japan, demonstrated that the framework can generate multiple high-quality matching candidates, enabling flexible scheduling in real-world operations.
Recent advance on quantum devices realizes an artificial quantum spin system known as the D-Wave 2000Q, which implements the Ising model with tunable transverse field. In this system, we perform a specific protocol of quantum annealing to attain the ground state, the minimizer of the energy. Therefore the device is often called the quantum annealer. However the resulting spin configurations are not always in the ground state. It can rather quickly generate many spin configurations following the Gibbs-Boltzmann distribution. In the present study, we formulate an Ising model to control a large number of automated guided vehicles in a factory without collision. We deal with an actual factory in Japan, in which vehicles run, and assess efficiency of our formulation. Compared to the conventional powerful techniques performed in digital computer, still the quantum annealer does not show outstanding advantage in the practical problem. Our study demonstrates a possibility of the quantum annealer to contribute solving industrial problems.
Quantum annealing is a generic solver for optimization problems that uses fictitious quantum fluctuation. The most groundbreaking progress in the research field of quantum annealing is its hardware implementation, i.e., the so-called quantum annealer, using artificial spins. However, the connectivity between the artificial spins is sparse and limited on a special network known as the chimera graph. Several embedding techniques have been proposed, but the number of logical spins, which represents the optimization problems to be solved, is drastically reduced. In particular, an optimization problem including fully or even partly connected spins suffers from low embeddable size on the chimera graph. In the present study, we propose an alternative approach to solve a large-scale optimization problem on the chimera graph via a well-known method in statistical mechanics called the Hubbard-Stratonovich transformation or its variants. The proposed method can be used to deal with a fully connected Ising model without embedding on the chimera graph and leads to nontrivial results of the optimization problem. We tested the proposed method with a number of partition problems involving solving linear equations and the traffic flow optimization problem in Sendai and Kyoto cities in Japan.