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

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Pelofske, Elijah, Hahn, Georg, Djidjev, Hristo N
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 08.03.2021
Subjects:	Annealing Apexes Bias Chemical partition Constraints Graph theory Ising model Iterative methods Optimization Partitioning Qubits (quantum computing)
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!