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

The Journal of The Institute of Image Information and Television Engineers

2. Quantum Annealer, its Potential and Perspective

Masayuki Ohzeki

Published Jan 1, 2019• 0 citations
Publisher
DOI
10.3169/itej.73.47

Related papers

Perspectives of quantum annealing: Methods and implementations

秀稔 西森, Hidetoshi Nishimori

•May 1, 2020•0 citations

Data-driven multi-objective optimization for alloy recycling using factorization machines and quantum annealing

Thomas Plehn, Katrin Bugelnig, Silvana Tumminello +2 more

Quantum annealing has the potential to provide practical quantum advantage for complex optimization tasks. Here, we present a systematic assessment of an integrated factorization-machine and quantum-annealing workflow (FM+QA) for a technologically relevant application: multi-objective Pareto optimization in metal up-cycling through alloy design. To address the non-convex nature of the Pareto front, we employ the recently proposed data-driven Tchebycheff scalarization (DDTS) scheme. Our results show that FM+QA extends the applicability of QUBO-based optimization to data-driven materials discovery problems with multiple competing objectives. In particular, we analyze the scaling behavior of the approach and compare quantum annealing with classical simulated annealing using both regular binary encoding and one-hot encoding. Finally, we provide a critical perspective on the problem sizes and encoding strategies for which quantum-annealing-based optimization may become practically beneficial in the near future.

cond-mat.mtrl-sciCross-listedarXiv:2607.03208•Jul 6, 2026•1 citation

Progress Towards Quantum Annealer v2.0 II: Theory

Dvir Kafri, Chris Quintana, Yu Chen +2 more

Bulletin of the American Physical Society•Mar 5, 2018•0 citations

Quantum Annealing for Combinatorial Optimization Problems

Jincheng Zhang

This paper investigates the application of quantum annealing to solve combinatorial optimization problems. The core claim is that quantum annealing algorithms can effectively enhance the efficiency and accuracy of solving such problems. The underlying mechanism involves simulating the quantum annealing process, leveraging the quantum tunneling effect to explore the solution space and identify optimal solutions. This work presents a novel approach by applying quantum annealing to combinatorial optimization, offering a fresh perspective on problem-solving. We explore the theoretical foundations, model the annealing process, and discuss potential challenges and future research directions. The focus is on demonstrating the feasibility and potential benefits of this approach rather than presenting results from experimental implementations.

•Aug 28, 2026•0 citations

Applications on quantum annealers

Dennis Willsch

•Jan 1, 2026•0 citations

Experimental Findings on the Superconducting Quantum Annealing Circuit and those Applications to a Gate-Type Quantum Computer

Daisuke Saida

The superconducting quantum annealing circuit is constructed with four Nb layers and Josephson junctions with a critical current density of 1 μA/μm2. Three key points exist to perform the quantum annealing in experiments. First, the shape of the energy potential of the qubit should be accurately designed. Second, the current pulses for modulation of the shape of the energy potential must propagate to the qubit accurately. Third is the suppression of noise in the environment where the qubit is placed. Furthermore, calibration of the measurement data is necessary with consideration of the experimental environment. In this paper, I will present a mechanism for realizing quantum annealing from two perspectives: a theoretical model and an experiment. Experimental findings on quantum annealing will contribute to study of the surrounding circuit of a gate-type quantum computer.

TEION KOGAKU (Journal of Cryogenics and Superconductivity Society of Japan)•Jul 19, 2024•0 citations
Quantum annealing has the potential to provide practical quantum advantage for complex optimization tasks. Here, we present a systematic assessment of an integrated factorization-machine and quantum-annealing workflow (FM+QA) for a technologically relevant application: multi-objective Pareto optimization in metal up-cycling through alloy design. To address the non-convex nature of the Pareto front, we employ the recently proposed data-driven Tchebycheff scalarization (DDTS) scheme. Our results show that FM+QA extends the applicability of QUBO-based optimization to data-driven materials discovery problems with multiple competing objectives. In particular, we analyze the scaling behavior of the approach and compare quantum annealing with classical simulated annealing using both regular binary encoding and one-hot encoding. Finally, we provide a critical perspective on the problem sizes and encoding strategies for which quantum-annealing-based optimization may become practically beneficial in the near future.
This paper investigates the application of quantum annealing to solve combinatorial optimization problems. The core claim is that quantum annealing algorithms can effectively enhance the efficiency and accuracy of solving such problems. The underlying mechanism involves simulating the quantum annealing process, leveraging the quantum tunneling effect to explore the solution space and identify optimal solutions. This work presents a novel approach by applying quantum annealing to combinatorial optimization, offering a fresh perspective on problem-solving. We explore the theoretical foundations, model the annealing process, and discuss potential challenges and future research directions. The focus is on demonstrating the feasibility and potential benefits of this approach rather than presenting results from experimental implementations.
The superconducting quantum annealing circuit is constructed with four Nb layers and Josephson junctions with a critical current density of 1 μA/μm2. Three key points exist to perform the quantum annealing in experiments. First, the shape of the energy potential of the qubit should be accurately designed. Second, the current pulses for modulation of the shape of the energy potential must propagate to the qubit accurately. Third is the suppression of noise in the environment where the qubit is placed. Furthermore, calibration of the measurement data is necessary with consideration of the experimental environment. In this paper, I will present a mechanism for realizing quantum annealing from two perspectives: a theoretical model and an experiment. Experimental findings on quantum annealing will contribute to study of the surrounding circuit of a gate-type quantum computer.