[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 …
Graph neural network initialisation of quantum approximate optimisation
Approximate combinatorial optimisation has emerged as one of the most promising
application areas for quantum computers, particularly those in the near term. In this work, we …
application areas for quantum computers, particularly those in the near term. In this work, we …
Scaling quantum approximate optimization on near-term hardware
The quantum approximate optimization algorithm (QAOA) is an approach for near-term
quantum computers to potentially demonstrate computational advantage in solving …
quantum computers to potentially demonstrate computational advantage in solving …
Problem-size-independent angles for a Grover-driven quantum approximate optimization algorithm
D Headley, FK Wilhelm - Physical Review A, 2023 - APS
The quantum approximate optimization algorithm (QAOA) requires that circuit parameters
are determined that allow one to sample from high-quality solutions to combinatorial …
are determined that allow one to sample from high-quality solutions to combinatorial …
Mixer-phaser ansätze for quantum optimization with hard constraints
We introduce multiple parametrized circuit ansätze and present the results of a numerical
study comparing their performance with a standard Quantum Alternating Operator Ansatz …
study comparing their performance with a standard Quantum Alternating Operator Ansatz …
Iteration-free quantum approximate optimization algorithm using neural networks
The quantum approximate optimization algorithm (QAOA) is a leading iterative variational
quantum algorithm for heuristically solving combinatorial optimization problems. A large …
quantum algorithm for heuristically solving combinatorial optimization problems. A large …
Mitigating quantum gate errors for variational eigensolvers using hardware-inspired zero-noise extrapolation
Variational quantum algorithms have emerged as a cornerstone of contemporary quantum
algorithms research. Practical implementations of these algorithms, despite offering certain …
algorithms research. Practical implementations of these algorithms, despite offering certain …
Angles and devices for quantum approximate optimization
DK Headley - 2023 - publikationen.sulb.uni-saarland.de
A potential application of emerging Noisy Intermediate-Scale Quantum (NISQ) devices is
that of approximately solving combinatorial optimization problems. This thesis investigates a …
that of approximately solving combinatorial optimization problems. This thesis investigates a …
Analytical Expressions for the Quantum Approximate Optimization Algorithm and its Variants
The quantum approximate optimization algorithm (QAOA) is a near-term quantum algorithm
aimed at solving combinatorial optimization problems. Since its introduction, various …
aimed at solving combinatorial optimization problems. Since its introduction, various …
Preface to the Special Issue on “Quantum Computing Algorithms and Computational Complexity”
In 1982, Richard Feynman stated that in order to simulate quantum systems, we would
rather go for a sort of brand-new powered quantum processor instead of a classical one …
rather go for a sort of brand-new powered quantum processor instead of a classical one …