Solving Combinatorial Optimization Problems on Quantum Computers

Introduction. Quantum computers provide several times faster solutions to several NP-hard combinatorial optimization problems in comparison with computing clusters. The trend of doubling the number of qubits of quantum computers every year suggests the existence of an analog of Moore's law for...

Full description

Bibliographic Details

Published in:	Kìbernetika ta komp'ûternì tehnologìï (Online) no. 2; pp. 5 - 13
Main Authors:	Korolyov, Vyacheslav, Khodzinskyi, Oleksandr
Format:	Journal Article
Language:	English Ukrainian
Published:	V.M. Glushkov Institute of Cybernetics 24.07.2020
Subjects:	maximal independent set for a graph quantum computer quantum computer mathematics qubit
ISSN:	2707-4501, 2707-451X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!