A Hybrid Approach for Solving Optimization Problems on Small Quantum Computers

Solving larger-sized problems is an important area of research in quantum computing. Designing hybrid quantumclassical algorithms is a promising approach to solving this. We discuss decomposition-based hybrid approaches for solving optimization problems and demonstrate them for applications related...

Full description

Saved in:
Bibliographic Details
Published in:Computer (Long Beach, Calif.) Calif.), 2019-06, Vol.52 (6), p.18-26
Main Authors: Shaydulin, Ruslan, Ushijima-Mwesigwa, Hayato, Negre, Christian F. A., Safro, Ilya, Mniszewski, Susan M., Alexeev, Yuri
Format: Article
Language:English
Subjects:
Algorithms
Annealing
computational complexity
Computers
Hardware
Logic gates
MATHEMATICS AND COMPUTING
optimisation
Optimization
QAOA
quantum annealing
Quantum computers
Quantum computing
quantum–classical algorithms
Qubit
universal quantum computing
variational hybrid algorithms
VQE
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Solving larger-sized problems is an important area of research in quantum computing. Designing hybrid quantumclassical algorithms is a promising approach to solving this. We discuss decomposition-based hybrid approaches for solving optimization problems and demonstrate them for applications related to community detection.
ISSN:0018-9162
1558-0814
DOI:10.1109/MC.2019.2908942