Results 81 to 90 of about 605 (179)
An improved QAOA algorithm based on multi-angle and RY-assisted structure
The standard quantum approximate optimization algorithm (QAOA) has a limited expressive power in shallow circuits, whereas naively increasing the number of layers leads to greater quantum circuit depth and higher noise sensitivity.
Tian-Yu Ye, Peng-Hui Ma, Zhi-Gang Gan
doaj
The effect of classical optimizers and Ansatz depth on QAOA performance in noisy devices. [PDF]
The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum algorithm for Near-term Intermediate-Scale Quantum computers (NISQ) providing approximate solutions for combinatorial optimization problems.
Pellow-Jarman A +5 more
europepmc +2 more sources
The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical variational algorithm designed to tackle combinatorial optimization problems.
Leo Zhou +4 more
doaj +1 more source
The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest.
Elijah Pelofske +6 more
doaj +1 more source
Shallow-depth QAOA on sparse, high-diameter MaxCut instances faces a locality bottleneck: at depth \(p\), local observables can depend only on a bounded neighborhood of the circuit interaction graph. We propose a transport-augmented QAOA that keeps the MaxCut cost Hamiltonian unchanged but enriches the mixer with optimized, unweighted shortcut ...
Kumar, Mithilesh, Tahir, Yusuf
openaire +2 more sources
Improved QAOA based on multi-angle and RY-assisted structure
To address the limited expressive capability of the standard quantum approximate optimization algorithm (QAOA) in shallow circuits and the increased noise sensitivity caused by deeper quantum circuits, an improved QAOA, termed MA-RY-QAOA, was proposed by
Ye Tianyu, Ma Penghui, Gan Zhigang
doaj
The quantum approximate optimization algorithm (QAOA) is a promising algorithm for solving combinatorial optimization problems (COPs), with performance governed by variational parameters $${\{{\gamma }_{i},{\beta }_{i}\}}_{i = 0}^{p-1}$$ { γ i , β i } i =
J. A. Montañez-Barrera +1 more
doaj +1 more source
Performance of parity QAOA for the signed Max-Cut problem
The practical implementation of quantum optimization algorithms on noisy intermediate-scale quantum devices requires accounting for their limited connectivity. As such, the Parity architecture was introduced to overcome this limitation by encoding binary
Anita Weidinger +4 more
doaj +1 more source
Universal resources for quantum approximate optimization algorithm and quantum annealing
The quantum approximate optimization algorithm (QAOA) is a variational ansatz that resembles the Trotterized dynamics of a quantum annealing (QA) protocol.
Pablo Díez-Valle +3 more
doaj +1 more source
An Exclusive-Sum-of-Products Pipeline for QAOA
The quantum approximate optimization algorithm is commonly used to solve combinatorial optimization problems. While unconstrained problems map naturally into the algorithm, incorporating constraints typically requires penalizing constraint violations in the objective function. In this work, we propose an alternative approach that encodes constraints as
Matthew Brunet +4 more
openaire +2 more sources

