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 …
Iterative quantum algorithms for maximum independent set
Quantum algorithms have been widely studied in the context of combinatorial optimization
problems. While this endeavor can often analytically and practically achieve quadratic …
problems. While this endeavor can often analytically and practically achieve quadratic …
Google Quantum AI's Quest for Error-Corrected Quantum Computers
M AbuGhanem - ar** 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 …