A review on quantum approximate optimization algorithm and its variants
Abstract The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising
variational quantum algorithm that aims to solve combinatorial optimization problems that …
variational quantum algorithm that aims to solve combinatorial optimization problems that …
[HTML][HTML] Short-depth QAOA circuits and quantum annealing on higher-order ising models
We present a direct comparison between QAOA (Quantum Alternating Operator Ansatz), and
QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p= 1, 2 rounds is …
QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p= 1, 2 rounds is …
Unconstrained binary models of the travelling salesman problem variants for quantum optimization
Quantum computing is offering a novel perspective for solving combinatorial optimization
problems. To fully explore the possibilities offered by quantum computers, the problems …
problems. To fully explore the possibilities offered by quantum computers, the problems …
[HTML][HTML] Application of quantum approximate optimization algorithm to job shop scheduling problem
K Kurowski, T Pecyna, M Slysz, R Różycki… - European Journal of …, 2023 - Elsevier
Abstract The Job Shop Scheduling Problem (JSSP) has always been considered as one of
the most complex and industry essential scheduling problems. Optimizing the makespan of …
the most complex and industry essential scheduling problems. Optimizing the makespan of …
Error mitigation for variational quantum algorithms through mid-circuit measurements
Noisy intermediate-scale quantum algorithms require novel paradigms of error mitigation. To
obtain noise-robust quantum computers, each logical qubit is equipped with hundreds or …
obtain noise-robust quantum computers, each logical qubit is equipped with hundreds or …
Quantum pricing-based column-generation framework for hard combinatorial problems
In this work we present a complete hybrid classical-quantum algorithm involving a quantum
sampler based on neutral-atom platforms. This approach is inspired by classical column …
sampler based on neutral-atom platforms. This approach is inspired by classical column …
Near-optimal circuit design for variational quantum optimization
Current state-of-the-art quantum optimization algorithms require representing the original
problem as a binary optimization problem, which is then converted into an equivalent Ising …
problem as a binary optimization problem, which is then converted into an equivalent Ising …
Accelerating grover adaptive search: Qubit and gate count reduction strategies with higher-order formulations
Y Sano, K Mitarai, N Yamamoto… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Grover adaptive search (GAS) is a quantum exhaustive search algorithm designed to solve
binary optimization problems. In this article, we propose higher order binary formulations …
binary optimization problems. In this article, we propose higher order binary formulations …
QAOA of the highest order
C Campbell, E Dahl - 2022 IEEE 19th International Conference …, 2022 - ieeexplore.ieee.org
The Quantum Approximate Optimization Algorithm (QAOA) has been one of the leading
candidates for near-term quantum advantage in gate-model quantum computers. From its …
candidates for near-term quantum advantage in gate-model quantum computers. From its …
Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing
As consequences of disruptions in railway traffic affect passenger experience and
satisfaction, appropriate rerouting and/or rescheduling is necessary. These problems are …
satisfaction, appropriate rerouting and/or rescheduling is necessary. These problems are …