[HTML][HTML] Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths
Abstract We generalize the Quantum Approximate Optimization Algorithm (QAOA) of Farhi et
al.(2014) to allow for arbitrary separable initial states with corresponding mixers such that …
al.(2014) to allow for arbitrary separable initial states with corresponding mixers such that …
Circuit depth scaling for quantum approximate optimization
Variational quantum algorithms are the centerpiece of modern quantum programming.
These algorithms involve training parametrized quantum circuits using a classical …
These algorithms involve training parametrized quantum circuits using a classical …
Warm-started quantum sphere decoding via reverse annealing for massive iot connectivity
With the continuous growth of the Internet of Things (IoT), the trend of increasing numbers of
IoT devices will continue. To increase the network's capability to support a large number of …
IoT devices will continue. To increase the network's capability to support a large number of …
Initial state encoding via reverse quantum annealing and h-gain features
Quantum annealing is a specialized type of quantum computation that aims to use quantum
fluctuations in order to obtain global minimum solutions of combinatorial optimization …
fluctuations in order to obtain global minimum solutions of combinatorial optimization …
Lower bounds on number of qaoa rounds required for guaranteed approximation ratios
N Benchasattabuse, A Bärtschi… - arXiv preprint arXiv …, 2023 - arxiv.org
The quantum alternating operator ansatz (QAOA) is a heuristic hybrid quantum-classical
algorithm for finding high-quality approximate solutions to combinatorial optimization …
algorithm for finding high-quality approximate solutions to combinatorial optimization …
Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm
The quantum approximate optimization algorithm (QAOA) is a promising method for solving
certain classical combinatorial optimization problems on near-term quantum devices. When …
certain classical combinatorial optimization problems on near-term quantum devices. When …
Approaches to constrained quantum approximate optimization
We study the costs and benefits of different quantum approaches to finding approximate
solutions of constrained combinatorial optimization problems with a focus on the maximum …
solutions of constrained combinatorial optimization problems with a focus on the maximum …
Mapping state transition susceptibility in quantum annealing
E Pelofske - Physical Review Research, 2023 - APS
Quantum annealing is a novel type of analog computation that aims to use quantum-
mechanical fluctuations to search for optimal solutions for Ising problems. Quantum …
mechanical fluctuations to search for optimal solutions for Ising problems. Quantum …
Google Quantum AI's Quest for Error-Corrected Quantum Computers
M AbuGhanem - arXiv preprint arXiv:2410.00917, 2024 - arxiv.org
Quantum computers stand at the forefront of technological innovation, offering exponential
computational speed-ups that challenge classical computing capabilities. At the cutting edge …
computational speed-ups that challenge classical computing capabilities. At the cutting edge …
[HTML][HTML] Tailored Quantum Alternating Operator Ansätzes for Circuit Fault Diagnostics
The quantum alternating operator ansatz (QAOA) and constrained quantum annealing
(CQA) restrict the evolution of a quantum system to remain in a constrained space, often with …
(CQA) restrict the evolution of a quantum system to remain in a constrained space, often with …