Large-Scale Quantum Approximate Optimization via Divide-and-Conquer

Quantum approximate optimization algorithm (QAOA) is a promising hybrid quantum-classical algorithm for solving combinatorial optimization problems. However, it cannot overcome qubit limitation for large-scale problems. Furthermore, the simulation time of QAOA scales poorly with the problem size. We...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on computer-aided design of integrated circuits and systems Ročník 42; číslo 6; s. 1852 - 1860
Hlavní autoři:	Li, Junde, Alam, Mahabubul, Ghosh, Swaroop
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.06.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Approximation algorithms Chemical partition Combinatorial analysis Computers Graph maxcut Graph theory Logic gates noisy intermediate-scale quantum computing (QC) Optimization Partitioning Partitioning algorithms Polynomials quantum approximate optimization algorithm (QAOA) Quantum computers Quantum computing Qubit Qubits (quantum computing) Reconstruction
ISSN:	0278-0070, 1937-4151
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!