Reducing quantum annealing biases for solving the graph partitioning problem

Quantum annealers offer an efficient way to compute high quality solutions of NP-hard problems when expressed in a QUBO (quadratic unconstrained binary optimization) or an Ising form. This is done by mapping a problem onto the physical qubits and couplers of the quantum chip, from which a solution i...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Pelofske, Elijah, Hahn, Georg, Djidjev, Hristo N
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 08.03.2021
Predmet:	Annealing Apexes Bias Chemical partition Constraints Graph theory Ising model Iterative methods Optimization Partitioning Qubits (quantum computing)
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!