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

Celý popis

Podrobná bibliografia

Vydané v:	Kìbernetika ta komp'ûternì tehnologìï (Online) číslo 2; s. 5 - 13
Hlavní autori:	Korolyov, Vyacheslav, Khodzinskyi, Oleksandr
Médium:	Journal Article
Jazyk:	English Ukrainian
Vydavateľské údaje:	V.M. Glushkov Institute of Cybernetics 24.07.2020
Predmet:	maximal independent set for a graph quantum computer quantum computer mathematics qubit
ISSN:	2707-4501, 2707-451X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!