Quantization-based Optimization with Perspective of Quantum Mechanics
- URL: http://arxiv.org/abs/2308.11594v3
- Date: Wed, 18 Oct 2023 04:02:41 GMT
- Title: Quantization-based Optimization with Perspective of Quantum Mechanics
- Authors: Jinwuk Seok, and Changsik Cho
- Abstract summary: We provide the analysis for quantization-based optimization based on the Schr"odinger equation.
We show that the tunneling effect derived by the Schr"odinger equation in quantization-based optimization enables to escape of a local minimum.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Statistical and stochastic analysis based on thermodynamics has been the main
analysis framework for stochastic global optimization. Recently, appearing
quantum annealing or quantum tunneling algorithm for global optimization, we
require a new researching framework for global optimization algorithms. In this
paper, we provide the analysis for quantization-based optimization based on the
Schr\"odinger equation to reveal what property in quantum mechanics enables
global optimization. We present that the tunneling effect derived by the
Schr\"odinger 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.
Related papers
- Intuitive Analysis of the Quantization-based Optimization: From Stochastic and Quantum Mechanical Perspective [0.0]
Quantization of an objective function is an effective optimization methodology.
We present an intuitive analysis of the technique based on the quantization of an objective function.
arXiv Detail & Related papers (2024-12-31T13:38:30Z) - Optimizing Unitary Coupled Cluster Wave Functions on Quantum Hardware: Error Bound and Resource-Efficient Optimizer [0.0]
We study the projective quantum eigensolver (PQE) approach to optimizing unitary coupled cluster wave functions on quantum hardware.
The algorithm uses projections of the Schr"odinger equation to efficiently bring the trial state closer to an eigenstate of the Hamiltonian.
We present numerical evidence of superiority over both the optimization introduced in arXiv:2102.00345 and VQE optimized using the Broyden Fletcher Goldfarb Shanno (BFGS) method.
arXiv Detail & Related papers (2024-10-19T15:03:59Z) - Randomized Benchmarking of Local Zeroth-Order Optimizers for Variational
Quantum Systems [65.268245109828]
We compare the performance of classicals across a series of partially-randomized tasks.
We focus on local zeroth-orders due to their generally favorable performance and query-efficiency on quantum systems.
arXiv Detail & Related papers (2023-10-14T02:13:26Z) - A self-consistent field approach for the variational quantum
eigensolver: orbital optimization goes adaptive [52.77024349608834]
We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE)
This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
arXiv Detail & Related papers (2022-12-21T23:15:17Z) - Quantization-Based Optimization: Alternative Stochastic Approximation of
Global Optimization [0.0]
We propose a global optimization algorithm based on quantizing the energy level of an objective function in an NP-hard problem.
Numerical experiments show that the proposed algorithm outperforms conventional learning methods in solving NP-hard optimization problems.
arXiv Detail & Related papers (2022-11-08T03:01:45Z) - Evaluating the Convergence of Tabu Enhanced Hybrid Quantum Optimization [58.720142291102135]
We introduce the Tabu Enhanced Hybrid Quantum Optimization metaheuristic approach useful for optimization problem solving on a quantum hardware.
We address the theoretical convergence of the proposed scheme from the viewpoint of the collisions in the object which stores the tabu states, based on the Ising model.
arXiv Detail & Related papers (2022-09-05T07:23:03Z) - Markov Chain Monte-Carlo Enhanced Variational Quantum Algorithms [0.0]
We introduce a variational quantum algorithm that uses Monte Carlo techniques to place analytic bounds on its time-complexity.
We demonstrate both the effectiveness of our technique and the validity of our analysis through quantum circuit simulations for MaxCut instances.
arXiv Detail & Related papers (2021-12-03T23:03:44Z) - Generalization Properties of Stochastic Optimizers via Trajectory
Analysis [48.38493838310503]
We show that both the Fernique-Talagrand functional and the local powerlaw are predictive of generalization performance.
We show that both our Fernique-Talagrand functional and the local powerlaw are predictive of generalization performance.
arXiv Detail & Related papers (2021-08-02T10:58:32Z) - Feedback-based quantum optimization [0.0]
We introduce a feedback-based strategy for quantum optimization, where the results of qubit measurements are used to constructively assign values to quantum circuit parameters.
We show that this procedure results in an estimate of the optimization problem solution that improves monotonically with the depth of the quantum circuit.
arXiv Detail & Related papers (2021-03-15T18:01:03Z) - Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices.
We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT)
Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
arXiv Detail & Related papers (2020-10-01T18:14:11Z) - Quantum-Enhanced Simulation-Based Optimization [0.8057006406834467]
Simulation-based optimization seeks to optimize an objective function that is computationally expensive to evaluate exactly.
Quantum Amplitude Estimation (QAE) can achieve a quadratic speed-up over classical Monte Carlo simulation.
arXiv Detail & Related papers (2020-05-21T17:02:59Z) - Cross Entropy Hyperparameter Optimization for Constrained Problem
Hamiltonians Applied to QAOA [68.11912614360878]
Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications.
Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem.
In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
arXiv Detail & Related papers (2020-03-11T13:52:41Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.