Results 11 to 20 of about 429 (149)
Quantum computational phase transition in combinatorial problems
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
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
Classically Optimal Variational Quantum Algorithms
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
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
Local classical MAX-CUT algorithm outperforms $p=2$ QAOA on high-girth regular graphs [PDF]
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]
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
Quantum approximate optimization algorithm with adaptive bias fields
The quantum approximate optimization algorithm (QAOA) transforms a simple many-qubit wave function into one that encodes a solution to a difficult classical optimization problem.
Yunlong Yu +5 more
doaj +1 more source
Similarity-based parameter transferability in the quantum approximate optimization algorithm
The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization.
Alexey Galda +10 more
doaj +1 more source
Alignment between initial state and mixer improves QAOA performance for constrained optimization
Quantum alternating operator ansatz (QAOA) has a strong connection to the adiabatic algorithm, which it can approximate with sufficient depth. However, it is unclear to what extent the lessons from the adiabatic regime apply to QAOA as executed in ...
Zichang He +6 more
doaj +1 more source
Quantum Approximate Optimization With Parallelizable Gates
The quantum approximate optimization algorithm (QAOA) has been introduced as a heuristic digital quantum computing scheme to find approximate solutions of combinatorial optimization problems. We present a scheme to parallelize this approach for arbitrary
Wolfgang Lechner
doaj +1 more source

