Results 101 to 110 of about 605 (179)
Equivariant QAOA and the Duel of the Mixers
Constructing an optimal mixer for Quantum Approximate Optimization Algorithm (QAOA) Hamiltonian is crucial for enhancing the performance of QAOA in solving combinatorial optimization problems. We present a systematic methodology for constructing the QAOA tailored mixer Hamiltonian, ensuring alignment with the inherent symmetries of classical ...
Tsvelikhovskiy, Boris +2 more
openaire +2 more sources
Rural cultural tourism resource allocation requires coordinated matching among tourist preferences, scenic spot capacities, and intangible cultural heritage (ICH) project services, forming a constrained high-dimensional ternary matching problem.
Jing Wang, Jing Ha
doaj +1 more source
Extrapolation method to optimize linear-ramp QAOA parameters: Evaluation of QAOA runtime scaling
14 pages, 15 ...
Dehn, Vanessa +5 more
openaire +2 more sources
The Lie algebra of XY-mixer topologies and warm starting QAOA for constrained optimization
The XY-mixer is widely used in quantum computing, particularly in variational quantum algorithms like the Quantum Alternating Operator Ansatz (QAOA).
Steven Kordonowy, Hannes Leipold
doaj +1 more source
Constrained combinatorial optimization remains challenging for quantum algorithms because feasibility must be explicitly enforced, typically through penalty terms or problem-specific mixers. We introduce Partitioned-Constraint QAOA (PC-QAOA), which partitions constraints into those enforced structurally and those enforced energetically.
Wilkie, Anthony +4 more
openaire +2 more sources
A SWAP-free Framework for QAOA
The performance of the Quantum Approximate Optimization Algorithm (QAOA) on noisy intermediate-scale quantum (NISQ) devices is strongly limited by sparse qubit connectivity. When interactions required by QAOA Hamiltonians are not aligned to the hardware topology, transpilation introduces SWAP gates, increasing circuit depth and noise. We propose a SWAP-
Assis, Thiago +4 more
openaire +2 more sources
Correctness of an application using QAOA
In this work, we analyze the Quantum Approximate Optimization Algorithm (QAOA) to solve a particular type of problem related to a graph clustering. We establish rigorous bounds for the efficiency of QAOA in the limit of a large problem.
Reittu, Hannu, Kotovirta, Ville
openaire +2 more sources
Oates’ Contributions to QAOA and CQAOA R. Oates’ notable contributions to the QAOA and CQAOA fields, which have made him widely recognized, include hybrid quantum-classical optimization, continuous-time generalizations of QAOA, control-theoretic interpretations, variational quantum circuits, algorithmic stability, practical optimization ...
openaire +1 more source

