Results 11 to 20 of about 2,386 (159)
Counterdiabaticity and the quantum approximate optimization algorithm [PDF]
Quantum, 2022 The quantum approximate optimization algorithm (QAOA) is a near-term hybrid algorithm intended to solve combinatorial optimization problems, such as MaxCut. QAOA can be made to mimic an adiabatic schedule, and in the $p\to\infty$ limit the final state is
Jonathan Wurtz, Peter J. Love
doaj +1 more source
Mean-Field Approximate Optimization Algorithm
PRX Quantum, 2023 The quantum approximate optimization algorithm (QAOA) is suggested as a promising application on early quantum computers. Here a quantum-inspired classical algorithm, the mean-field approximate optimization algorithm (mean-field AOA), is developed by ...
Aditi Misra-Spieldenner +5 more
doaj +1 more source
Digitized-counterdiabatic quantum approximate optimization algorithm
Physical Review Research, 2022 The quantum approximate optimization algorithm (QAOA) has proved to be an effective classical-quantum algorithm serving multiple purposes, from solving combinatorial optimization problems to finding the ground state of many-body quantum systems.
P. Chandarana +6 more
doaj +1 more source
Quantum computational phase transition in combinatorial problems
npj Quantum Information, 2022 Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers.
Bingzhi Zhang, Akira Sone, Quntao Zhuang
doaj +1 more source
Quantum Approximation for Wireless Scheduling
Applied Sciences, 2020 This paper proposes an application algorithm based on a quantum approximate optimization algorithm (QAOA) for wireless scheduling problems. QAOA is one of the promising hybrid quantum-classical algorithms to solve combinatorial optimization problems and ...
Jaeho Choi, Seunghyeok Oh, Joongheon Kim
doaj +1 more source
Physical Review Research, 2022 The quantum approximate optimization algorithm (QAOA) is a hybrid variational quantum-classical algorithm that solves combinatorial optimization problems.
Linghua Zhu +6 more
doaj +1 more source
Classically Optimal Variational Quantum Algorithms
IEEE Transactions on Quantum Engineering, 2021 Hybrid quantum-classical algorithms, such as variational quantum algorithms (VQAs), are suitable for implementation on noisy intermediate-scale quantum computers.
Jonathan Wurtz, Peter Love
doaj +1 more source
Classical Optimizers for Noisy Intermediate-Scale Quantum Devices [PDF]
, 2020 We present a collection of optimizers tuned for usage on Noisy Intermediate-Scale Quantum (NISQ) devices. Optimizers have a range of applications in quantum computing, including the Variational Quantum Eigensolver (VQE) and Quantum Approximate ...
De Jong, W +4 more
core +2 more sources
Local classical MAX-CUT algorithm outperforms $p=2$ QAOA on high-girth regular graphs [PDF]
Quantum, 2021 The $p$-stage Quantum Approximate Optimization Algorithm (QAOA$_p$) is a promising approach for combinatorial optimization on noisy intermediate-scale quantum (NISQ) devices, but its theoretical behavior is not well understood beyond $p=1$.
Kunal Marwaha
doaj +1 more source
The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size [PDF]
Quantum, 2022 The Quantum Approximate Optimization Algorithm (QAOA) is a general-purpose algorithm for combinatorial optimization problems whose performance can only improve with the number of layers $p$.
Edward Farhi +3 more
doaj +1 more source