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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on computer-aided design of integrated circuits and systems Vol. 42; no. 6; pp. 1852 - 1860
Main Authors:	Li, Junde, Alam, Mahabubul, Ghosh, Swaroop
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!