Results 101 to 110 of about 4,386 (222)
Clifford Accelerated Adaptive QAOA
Clifford Circuit Initializaton improves on initial guess of parameters on Parametric Quantum Circuits (PQCs) by leveraging efficient simulation of circuits made out of gates from the Clifford Group. The parameter space is pre-optimized by exploring the Hilbert space in a reduced ensemble of Clifford-expressible points (Clifford Points), providing ...
Lisart-Liebermann, Théo +1 more
openaire +2 more sources
Data from "QAOA with N · p ≥ 200"
v2 includes additional experiments on H2 device with up to 32 ...
Shaydulin, Ruslan, Pistoia, Marco
openaire +1 more source
Extrapolation method to optimize linear-ramp QAOA parameters: Evaluation of QAOA runtime scaling
14 pages, 15 ...
Dehn, Vanessa +4 more
openaire +2 more sources
Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs [PDF]
Current state-of-the-art quantum optimization algorithms require representing the original problem as a binary optimization problem, which is then converted into an equivalent cost Hamiltonian suitable for the quantum device.
Bence Bakó +3 more
doaj +1 more source
Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs
8 pages, 1 ...
Eunok Bae, Soojoon Lee
openaire +2 more sources
Parameter initialization for warm-starting QAOA
Der Quantum Approximate Optimization Algorithm (QAOA) ist ein vielversprechender Kandidat für Quantenüberlegenheit auf Near-Term-Hardware. Warm-started QAOA (WS-QAOA) ist eine verbesserte Version von QAOA. Diese nutzt für das vorliegende Problem eine vorberechnete approximative Lösung, welche effizient auf klassischer Hardware bestimmt wird.
openaire +3 more sources
Multi-round QAOA and advanced mixers on a trapped-ion quantum computer [PDF]
Yingyue Zhu +7 more
openalex +1 more source
Benchmarking QAOA through Maximum Cardinality Matching
Benchmarking QAOA through Maximum Cardinality ...
Gilbert, Valentin +2 more
openaire +1 more source
Scaling whole-chip QAOA for higher-order ising spin glass models on heavy-hex graphs
We show that the quantum approximate optimization algorithm (QAOA) for higher-order, random coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from 16 up to 127 qubits for p = 1 up to p = 5 ...
Elijah Pelofske +4 more
doaj +1 more source
Exploring Network-Related Optimization Problems Using Quantum Heuristics [PDF]
Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum ...
Adnane, Mustafa +6 more
core +1 more source

