Results 151 to 160 of about 605 (179)

Exploiting Symmetry Reduces the Cost of Training QAOA

open access: yesIEEE Transactions on Quantum Engineering, 2021
A promising approach to the practical application of the quantum approximate optimization algorithm (QAOA) is finding QAOA parameters classically in simulation and sampling the solutions from QAOA with optimized parameters on a quantum computer. Doing so
Stefan M. Wild, Ruslan Shaydulin
exaly   +3 more sources

Impact of Graph Structures for QAOA on MaxCut [PDF]

open access: yesQuantum Information Processing, 2021
The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on specific families of graphs, however, little is known about the algorithm on arbitrary graphs.
James Ostrowski   +2 more
exaly   +3 more sources

QAOA of the Highest Order

open access: yes2022 IEEE 19th International Conference on Software Architecture Companion (ICSA-C), 2022
The Quantum Approximate Optimization Algorithm (QAOA) has been one of the leading candidates for near-term quantum advantage in gate-model quantum computers. From its inception, this algorithm has sparked the desire for comparison between gate-model and annealing platforms.
Colin Campbell, Edward Dahl
exaly   +4 more sources

Fuzzy Clustering for QAOA Complexity Reduction

2023 IEEE International Conference on Fuzzy Systems (FUZZ), 2023
The Quantum Approximate Optimization Algorithm (QAOA) has become one of the most widely used components in the development of modern quantum applications. It works on the paradigm of quantum variational circuits, where a quantum circuit is trained - by repeatedly adjusting circuit parameters - to adequately solve a combinatorial optimization problem ...
Acampora G., Chiatto A., Vitiello A.
openaire   +3 more sources

Hybrid Classical-Quantum Simulation of MaxCut Using QAOA-in-QAOA

open access: yes2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
The Quantum approximate optimization algorithm (QAOA) is a leading hybrid classical-quantum algorithm for solving complex combinatorial optimization problems. QAOA-in-QAOA (QAOA^2) uses a divide-and-conquer heuristic to solve large-scale Maximum Cut (MaxCut) problems, where many subgraph problems can be solved in parallel.
Aniello Esposito
exaly   +3 more sources

Bridging Classical and Quantum With SDP Initialized Warm-Starts for QAOA

ACM Transactions on Quantum Computing, 2023
Greg Mohler, Swati Gupta, Creston Herold
exaly  

Benchmarking the Performance of Portfolio Optimization With QAOA

Quantum Information Processing, 2023
Daniel Braun   +2 more
exaly  

Compiler Optimizations for QAOA

Proceedings of the 43rd IEEE/ACM International Conference on Computer-Aided Design
Yuchen Zhu   +6 more
openaire   +2 more sources

Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers

Lecture Notes in Computer Science, 2023
Stephan Eidenbenz   +2 more
exaly  

QAOA with N·p≥200.

CoRR, 2023
Ruslan Shaydulin, Marco Pistoia
openaire   +1 more source

Home - About - Disclaimer - Privacy