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

Entropy

Adaptive Problem Solving Dynamics in Gate-Model Quantum Computers

László Gyöngyösi

Published Aug 26, 2022• 12 citations
Publisher

Abstract

Gate-model quantum computer architectures represent an implementable model used to realize quantum computations. The mathematical description of the dynamical attributes of adaptive problem solving and iterative objective function evaluation in a gate-model quantum computer is currently a challenge. Here, a mathematical model of adaptive problem solving dynamics in a gate-model quantum computer is defined. We characterize a canonical equation of adaptive objective function evaluation of computational problems. We study the stability of adaptive problem solving in gate-model quantum computers.

DOI
10.3390/e24091196

Related papers

Objective function estimation for solving optimization problems in gate-model quantum computers

László Gyöngyösi

Quantum computers provide a valuable resource to solve computational problems. The maximization of the objective function of a computational problem is a crucial problem in gate-model quantum computers. The objective function estimation is a high-cost procedure that requires several rounds of quantum computations and measurements. Here, we define a method for objective function estimation of arbitrary computational problems in gate-model quantum computers. The proposed solution significantly reduces the costs of the objective function estimation and provides an optimized estimate of the state of the quantum computer for solving optimization problems.

Scientific Reports•Aug 26, 2020•11 citations

Scalable distributed gate-model quantum computers

László Gyöngyösi, Sándor Imre

A scalable model for a distributed quantum computation is a challenging problem due to the complexity of the problem space provided by the diversity of possible quantum systems, from small-scale quantum devices to large-scale quantum computers. Here, we define a model of scalable distributed gate-model quantum computation in near-term quantum systems of the NISQ (noisy intermediate scale quantum) technology era. We prove that the proposed architecture can maximize an objective function of a computational problem in a distributed manner. We study the impacts of decoherence on distributed objective function evaluation.

Scientific Reports•Feb 26, 2021•86 citations

Approximation Method for Optimization Problems in Gate-Model Quantum Computers

László Gyöngyösi

In near-term quantum computers, the computations are realized via unitary operators. The optimization problem fed into the quantum computer sets an objective function that is to be estimated via several measurement rounds. Here, we define a procedure for objective function approximation in gate-model quantum computers. The proposed solution optimizes the process of objective function estimation for optimization problems in gate-model quantum computers and quantum devices.

Chaos Solitons & Fractals X•Sep 27, 2021•1 citation

Adaptive Quantum State Protocols for Enhanced Quantum Computing

Jincheng Zhang

Quantum computing holds immense promise for revolutionizing various fields, from drug discovery to materials science. However, current quantum computing architectures face significant challenges related to qubit coherence, gate fidelity, and scalability. This paper introduces a novel quantum computing protocol, termed "Adaptive Quantum State Protocols," that dynamically adjusts the quantum state of qubits to mitigate these challenges, aiming to significantly improve the efficiency and stability of quantum computations. The core of this protocol involves a sophisticated feedback mechanism that leverages continuous state evolution to optimize qubit parameters and minimize decoherence. We explore the design of a robust and adaptable framework for implementing this protocol, demonstrating its potential to overcome current limitations of quantum computing. The proposed method offers a fundamentally new approach to managing quantum states, ultimately paving the way for more practical and reliable quantum technologies.

•Sep 7, 2026•0 citations

Objective function maximization by machine learning for gate-model quantum computers

László Gyöngyösi, Sándor Imre

We define a framework for objective function estimation and maximization of arbitrary computational problems in gatemodel quantum computers. The method significantly reduces the costs of the objective function estimation and provides an estimate of the new state of the quantum computer. The framework integrates an objective function extension procedure, a segmentation algorithm that utilizes the gate parameters of the quantum computer, and a machine-learning unit for the quantum state prediction. The results are particularly convenient for the performance optimization of experimental gate-model quantum computations.

•Apr 24, 2020•0 citations

The Grover Adaptive Search Algorithm as a Solver: High-Order Unconstrained Binary Optimization Problems

Le Manh Quan Tran

High-order binary optimization (HUBO) formulation can represent many real world problems. This mathematical approach is particularly relevant within the quantum computation domain because quantum hardware allows to directly map and solve these problems. The thesis explores the implementation of Grover Adaptive Search (GAS) by varying the different free parameters to evaluate the quality of the solution and the success rate of the algorithm, along with a possible optimization procedure. In particular, GAS is an algorithm that is compliant with HUBO and theoretically offer a quadratic speed up over classical computation. This thesis implements a quantum circuit for GAS algorithm to solve a 4-city traveling salesman problem along with two strategies to reduce the gate counts. The results include the output quality of the value of the objective function and the success rate of reaching the true minimum of 7, where the optimal configuration achieves an average value of 9.4 and a success rate of 36%. This configuration also maintains a 7% lower average value and a 10% higher success rate compared to randomly generated parameters.

•Apr 24, 2026•0 citations
Gate-model quantum computer architectures represent an implementable model used to realize quantum computations. The mathematical description of the dynamical attributes of adaptive problem solving and iterative objective function evaluation in a gate-model quantum computer is currently a challenge. Here, a mathematical model of adaptive problem solving dynamics in a gate-model quantum computer is defined. We characterize a canonical equation of adaptive objective function evaluation of computational problems. We study the stability of adaptive problem solving in gate-model quantum computers.
Quantum computers provide a valuable resource to solve computational problems. The maximization of the objective function of a computational problem is a crucial problem in gate-model quantum computers. The objective function estimation is a high-cost procedure that requires several rounds of quantum computations and measurements. Here, we define a method for objective function estimation of arbitrary computational problems in gate-model quantum computers. The proposed solution significantly reduces the costs of the objective function estimation and provides an optimized estimate of the state of the quantum computer for solving optimization problems.
A scalable model for a distributed quantum computation is a challenging problem due to the complexity of the problem space provided by the diversity of possible quantum systems, from small-scale quantum devices to large-scale quantum computers. Here, we define a model of scalable distributed gate-model quantum computation in near-term quantum systems of the NISQ (noisy intermediate scale quantum) technology era. We prove that the proposed architecture can maximize an objective function of a computational problem in a distributed manner. We study the impacts of decoherence on distributed objective function evaluation.
Quantum computing holds immense promise for revolutionizing various fields, from drug discovery to materials science. However, current quantum computing architectures face significant challenges related to qubit coherence, gate fidelity, and scalability. This paper introduces a novel quantum computing protocol, termed "Adaptive Quantum State Protocols," that dynamically adjusts the quantum state of qubits to mitigate these challenges, aiming to significantly improve the efficiency and stability of quantum computations. The core of this protocol involves a sophisticated feedback mechanism that leverages continuous state evolution to optimize qubit parameters and minimize decoherence. We explore the design of a robust and adaptable framework for implementing this protocol, demonstrating its potential to overcome current limitations of quantum computing. The proposed method offers a fundamentally new approach to managing quantum states, ultimately paving the way for more practical and reliable quantum technologies.
We define a framework for objective function estimation and maximization of arbitrary computational problems in gatemodel quantum computers. The method significantly reduces the costs of the objective function estimation and provides an estimate of the new state of the quantum computer. The framework integrates an objective function extension procedure, a segmentation algorithm that utilizes the gate parameters of the quantum computer, and a machine-learning unit for the quantum state prediction. The results are particularly convenient for the performance optimization of experimental gate-model quantum computations.
High-order binary optimization (HUBO) formulation can represent many real world problems. This mathematical approach is particularly relevant within the quantum computation domain because quantum hardware allows to directly map and solve these problems. The thesis explores the implementation of Grover Adaptive Search (GAS) by varying the different free parameters to evaluate the quality of the solution and the success rate of the algorithm, along with a possible optimization procedure. In particular, GAS is an algorithm that is compliant with HUBO and theoretically offer a quadratic speed up over classical computation. This thesis implements a quantum circuit for GAS algorithm to solve a 4-city traveling salesman problem along with two strategies to reduce the gate counts. The results include the output quality of the value of the objective function and the success rate of reaching the true minimum of 7, where the optimal configuration achieves an average value of 9.4 and a success rate of 36%. This configuration also maintains a 7% lower average value and a 10% higher success rate compared to randomly generated parameters.