Results 51 to 60 of about 6,260,846 (177)
Application of the quantum approximate optimization algorithm to combinatorial optimization problems [PDF]
This licentiate thesis is an extended introduction to the accompanying papers, which encompass a study of the quantum approximate optimization algorithm (QAOA).
Vikst\ue5l, Pontus
core
Quantum approximate optimization algorithm for qudit systems [PDF]
A frequent starting point of quantum computation platforms is the two-state quantum system, i.e., the qubit. However, in the context of integer optimization problems, relevant to scheduling optimization and operations research, it is often more resource ...
Lenk, Steve +7 more
core +2 more sources
This thesis explores the Quantum Approximate Optimization Algorithm (QAOA), a hybrid classical-quantum algorithm designed to solve combinatorial optimization problems.
Vikstål, Pontus,
core
ABSTRACT X‐ray fluorescence (XRF) analysis combines spectral inverse modeling, elemental support selection and spatial interpretation. We develop quadratic unconstrained binary optimization (QUBO) and Ising formulations for these tasks. A detector‐response dictionary of broadened candidate emission‐line profiles induces a spectral overlap graph that ...
George Kourousias +6 more
wiley +1 more source
Vanishing performance of the parity-encoded quantum approximate optimization algorithm applied to spin-glass models [PDF]
The parity mapping provides a geometrically local encoding of the Quantum Approximate Optimization Algorithm (QAOA), at the expense of having a quadratic qubit overhead for all-to-all connected problems. In this work, we benchmark the parity-encoded QAOA
Elisabeth Wybo, Martin Leib
doaj +1 more source
Peptide conformational sampling using the Quantum Approximate Optimization Algorithm
Protein folding has attracted considerable research effort in biochemistry in recent decades. In this work, we explore the potential of quantum computing to solve a simplified version of protein folding.
Sami Boulebnane +4 more
doaj +1 more source
A frustrated 4×4$4\times 4$ J1−J2$J_{1}-J_{2}$ Ising model is examined using QAOA, exact calculations, and IonQ hardware benchmarks. Frustration and near‐degeneracy suppress finite‐depth ground‐state sampling, requiring deeper circuits for improved performance. Ideal simulations show systematic improvement with QAOA depth, whereas noisy hardware limits
Seunghan Lee, Hunpyo Lee
wiley +1 more source
Conceptual framework of physics‐guided hybrid quantum–classical machine learning for hydrological simulation, highlighting the opportunities and limitations of quantum computing and its integration with classical machine learning and mass‐balance physics.
Vidya Samadi
wiley +1 more source
Automatic Depth Optimization for Quantum Approximate Optimization Algorithm
Quantum Approximate Optimization Algorithm (QAOA) is a hybrid algorithm whose control parameters are classically optimized. In addition to the variational parameters, the right choice of hyperparameter is crucial for improving the performance of any ...
Tong, Yifan, Pan, Yu, Yang, Yi
core +1 more source
Applying the Quantum Approximate Optimization Algorithm to the Tail-Assignment Problem [PDF]
Airlines today are faced with a number of large-scale scheduling problems. One such problem is the tail-assignment problem, which is the task of assigning individual aircraft to a given set of flights, minimizing the overall cost.
Johansson, Göran, +17 more
core +1 more source

