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

ETRI Journal

Numerical analysis of quantization‐based optimization

Jinwuk Seok, Chang Sik Cho

Published Nov 22, 2023• 1 citation
Publisher

Abstract

Abstract We propose a number‐theory‐based quantized mathematical optimization scheme for various NP‐hard and similar problems. Conventional global optimization schemes, such as simulated and quantum annealing, assume stochastic properties that require multiple attempts. Although our quantization‐based optimization proposal also depends on stochastic features (i.e., the white‐noise hypothesis), it provides a more reliable optimization performance. Our numerical analysis equates quantization‐based optimization to quantum annealing, and its quantization property effectively provides global optimization by decreasing the measure of the level sets associated with the objective function. Consequently, the proposed combinatorial optimization method allows the removal of the acceptance probability used in conventional heuristic algorithms to provide a more effective optimization. Numerical experiments show that the proposed algorithm determines the global optimum in less operational time than conventional schemes.

DOI
10.4218/etrij.2023-0083

Related papers

Based on Scalable Quantum Annealing for Combinatorial Optimization Algorithms

Jincheng Zhang

This paper investigates the application of scalable quantum annealing to solve computationally challenging combinatorial optimization problems. The core idea is to map these problems into a quantum annealing framework, leveraging quantum tunneling to efficiently explore the solution space and ultimately converge to the global optimum. The research addresses the existing limitations in the scalability of quantum annealing, proposing a novel approach to tackle NP-hard problems effectively. We will demonstrate the potential of this methodology through a theoretical analysis and formulation of the quantum annealing algorithm, focusing on key parameters and their impact on solution quality and runtime. The ultimate goal is to provide a foundational understanding of applying quantum annealing to combinatorial optimization, paving the way for future developments and practical implementations. This work introduces a new framework for approaching complex optimization problems by harnessing the unique properties of quantum mechanics.

•Sep 5, 2026•0 citations

Quantization-based Optimization with Perspective of Quantum Mechanics

Jinwuk Seok, Chang-Sik Cho

Statistical and stochastic analysis based on thermodynamics has been the main analysis framework for stochastic global optimization. Recently, with the appearance of quantum annealing or quantum tunneling algorithms for global optimization, we require a new research framework for global optimization algorithms. In this paper, we provide the analysis for quantization-based optimization based on the Schrödinger equation to reveal what property in quantum mechanics enables global optimization. We present that the tunneling effect derived by the Schrödinger equation in quantization-based optimization enables to escape of a local minimum. Additionally, we confirm that this tunneling effect is the same property included in quantum mechanics-based global optimization. Experiments with standard multi-modal benchmark functions represent that the proposed analysis is valid.

arXiv:2308.11594•International Conference on Information and Communication Technology Convergence (ICTC)•Oct 11, 2023•0 citations

Quantum Annealing-Based Combinatorial Optimization Algorithm

Jincheng Zhang

This paper investigates the application of quantum annealing for solving complex combinatorial optimization problems. The core claim is that quantum annealing leverages its global search capabilities to efficiently address such problems. The proposed mechanism involves formulating the combinatorial optimization problem as a quantum annealing problem and utilizing the simulated annealing process within quantum annealing to conduct a search for the optimal solution. This research explores the potential of quantum annealing in practical applications, acknowledging that its application in combinatorial optimization is still in its exploratory phase. The algorithm is designed to minimize the energy of a system described by a Hamiltonian, which evolves over time according to the time-dependent Schrödinger equation. The core of the algorithm lies in mapping the problem's constraints and objective function into this Hamiltonian. The search process is governed by quantum fluctuations, represented by the operator $\hat{H}$, which encourages transitions to lower energy states, effectively navigating the solution space. The effectiveness of the algorithm is evaluated based on the quality of the solution found and the computational resources required. This work provides a foundational exploration of quantum annealing's potential within the field of combinatorial optimization.

•Sep 3, 2026•0 citations

A Quantum Global Optimization Algorithm: Application to the Knapsack Problem

Mohamed Yassine Cherif, Wided Lejouad Chaari, Olfa Belkahla Driss

Abstract Solving combinatorial optimization problems represents a challenge for researchers, especially hard NP-complete problems that are commonly handled through heuristic methods providing approximate solutions. The emergence of quantum computing, which enables performing parallel computation, raises hope for solving such problems within a reasonable time frame. This paper proposes a quantum global optimization algorithm to solve combinatorial optimization problems intended to provide an improved performance. The proposed algorithm aims to amplify the probability of selecting the global optimum of the objective function defining the addressed problem using a specific variant of Grover’s search based on simultaneously exploring all comparison cases of possible solutions to recognize the global optimum. The paper also includes the study of precision and runtime of the presented concept and introduces a version of the proposed algorithm addressing the knapsack problem, along with its execution results and a comparison with other competing algorithms

•Mar 23, 2026•0 citations

A Quantum Global Optimization Algorithm: Application to the Knapsack Problem

Mohamed Yassine Cherif, Wided Lejouad Chaari, Olfa Belkahla Driss

Abstract Solving combinatorial optimization problems represents a challenge for researchers, especially hard NP-complete problems that are commonly handled through heuristic methods providing approximate solutions. The emergence of quantum computing, which enables performing parallel computation, raises hope for solving such problems within a reasonable time frame. This paper proposes a quantum global optimization algorithm to solve combinatorial optimization problems intended to provide an improved performance. The proposed algorithm aims to amplify the probability of selecting the global optimum of the objective function defining the addressed problem using a specific variant of Grover’s search based on simultaneously exploring all comparison cases of possible solutions to recognize the right one. The paper also includes the study of precision and runtime of the presented concept and introduces a version of the proposed algorithm addressing the knapsack problem, along with its execution results and a comparison with other competing algorithms.

•Jun 15, 2026•0 citations

Quantum mechanical framework for quantization-based optimization: from Gradient flow to Schroedinger equation

Jinwuk Seok, Changsik Cho

This work presents a quantum mechanical framework for analyzing quantization-based optimization algorithms. The sampling process of the quantization-based search is modeled as a gradient-flow dissipative system, leading to a Hamilton-Jacobi-Bellman (HJB) representation. Through a suitable transformation of the objective function, this formulation yields the Schroedinger equation, which reveals that quantum tunneling enables escape from local minima and guarantees access to the global optimum. By establishing the connection to the Fokker-Planck equation, the framework provides a thermodynamic interpretation of global convergence. Such an analysis between the thermodynamic and the quantum dynamic methodology unifies combinatorial and continuous optimization, and extends naturally to machine learning tasks such as image classification. Numerical experiments demonstrate that quantization-based optimization consistently outperforms conventional algorithms across both combinatorial problems and nonconvex continuous functions.

quant-pharXiv:2603.11536•Mar 13, 2026•0 citations
Abstract We propose a number‐theory‐based quantized mathematical optimization scheme for various NP‐hard and similar problems. Conventional global optimization schemes, such as simulated and quantum annealing, assume stochastic properties that require multiple attempts. Although our quantization‐based optimization proposal also depends on stochastic features (i.e., the white‐noise hypothesis), it provides a more reliable optimization performance. Our numerical analysis equates quantization‐based optimization to quantum annealing, and its quantization property effectively provides global optimization by decreasing the measure of the level sets associated with the objective function. Consequently, the proposed combinatorial optimization method allows the removal of the acceptance probability used in conventional heuristic algorithms to provide a more effective optimization. Numerical experiments show that the proposed algorithm determines the global optimum in less operational time than conventional schemes.
This paper investigates the application of scalable quantum annealing to solve computationally challenging combinatorial optimization problems. The core idea is to map these problems into a quantum annealing framework, leveraging quantum tunneling to efficiently explore the solution space and ultimately converge to the global optimum. The research addresses the existing limitations in the scalability of quantum annealing, proposing a novel approach to tackle NP-hard problems effectively. We will demonstrate the potential of this methodology through a theoretical analysis and formulation of the quantum annealing algorithm, focusing on key parameters and their impact on solution quality and runtime. The ultimate goal is to provide a foundational understanding of applying quantum annealing to combinatorial optimization, paving the way for future developments and practical implementations. This work introduces a new framework for approaching complex optimization problems by harnessing the unique properties of quantum mechanics.
Statistical and stochastic analysis based on thermodynamics has been the main analysis framework for stochastic global optimization. Recently, with the appearance of quantum annealing or quantum tunneling algorithms for global optimization, we require a new research framework for global optimization algorithms. In this paper, we provide the analysis for quantization-based optimization based on the Schrödinger equation to reveal what property in quantum mechanics enables global optimization. We present that the tunneling effect derived by the Schrödinger equation in quantization-based optimization enables to escape of a local minimum. Additionally, we confirm that this tunneling effect is the same property included in quantum mechanics-based global optimization. Experiments with standard multi-modal benchmark functions represent that the proposed analysis is valid.
This paper investigates the application of quantum annealing for solving complex combinatorial optimization problems. The core claim is that quantum annealing leverages its global search capabilities to efficiently address such problems. The proposed mechanism involves formulating the combinatorial optimization problem as a quantum annealing problem and utilizing the simulated annealing process within quantum annealing to conduct a search for the optimal solution. This research explores the potential of quantum annealing in practical applications, acknowledging that its application in combinatorial optimization is still in its exploratory phase. The algorithm is designed to minimize the energy of a system described by a Hamiltonian, which evolves over time according to the time-dependent Schrödinger equation. The core of the algorithm lies in mapping the problem's constraints and objective function into this Hamiltonian. The search process is governed by quantum fluctuations, represented by the operator H^\hat{H}H^, which encourages transitions to lower energy states, effectively navigating the solution space. The effectiveness of the algorithm is evaluated based on the quality of the solution found and the computational resources required. This work provides a foundational exploration of quantum annealing's potential within the field of combinatorial optimization.
Abstract Solving combinatorial optimization problems represents a challenge for researchers, especially hard NP-complete problems that are commonly handled through heuristic methods providing approximate solutions. The emergence of quantum computing, which enables performing parallel computation, raises hope for solving such problems within a reasonable time frame. This paper proposes a quantum global optimization algorithm to solve combinatorial optimization problems intended to provide an improved performance. The proposed algorithm aims to amplify the probability of selecting the global optimum of the objective function defining the addressed problem using a specific variant of Grover’s search based on simultaneously exploring all comparison cases of possible solutions to recognize the global optimum. The paper also includes the study of precision and runtime of the presented concept and introduces a version of the proposed algorithm addressing the knapsack problem, along with its execution results and a comparison with other competing algorithms
Abstract Solving combinatorial optimization problems represents a challenge for researchers, especially hard NP-complete problems that are commonly handled through heuristic methods providing approximate solutions. The emergence of quantum computing, which enables performing parallel computation, raises hope for solving such problems within a reasonable time frame. This paper proposes a quantum global optimization algorithm to solve combinatorial optimization problems intended to provide an improved performance. The proposed algorithm aims to amplify the probability of selecting the global optimum of the objective function defining the addressed problem using a specific variant of Grover’s search based on simultaneously exploring all comparison cases of possible solutions to recognize the right one. The paper also includes the study of precision and runtime of the presented concept and introduces a version of the proposed algorithm addressing the knapsack problem, along with its execution results and a comparison with other competing algorithms.
This work presents a quantum mechanical framework for analyzing quantization-based optimization algorithms. The sampling process of the quantization-based search is modeled as a gradient-flow dissipative system, leading to a Hamilton-Jacobi-Bellman (HJB) representation. Through a suitable transformation of the objective function, this formulation yields the Schroedinger equation, which reveals that quantum tunneling enables escape from local minima and guarantees access to the global optimum. By establishing the connection to the Fokker-Planck equation, the framework provides a thermodynamic interpretation of global convergence. Such an analysis between the thermodynamic and the quantum dynamic methodology unifies combinatorial and continuous optimization, and extends naturally to machine learning tasks such as image classification. Numerical experiments demonstrate that quantization-based optimization consistently outperforms conventional algorithms across both combinatorial problems and nonconvex continuous functions.