DeepAI AI Chat
Log In Sign Up

Embedding quadratization gadgets on Chimera and Pegasus graphs

by   Nike Dattani, et al.

We group all known quadratizations of cubic and quartic terms in binary optimization problems into six and seven unique graphs respectively. We then perform a minor embedding of these graphs onto the well-known Chimera graph, and the brand new Pegasus graph. We conclude with recommendations for which gadgets are best to use when aiming to reduce the total number of qubits required to embed a problem.


page 1

page 2

page 3

page 4


A Note on Colourings of Connected 2-edge Coloured Cubic Graphs

In this short note we show that every connected 2-edge coloured cubic gr...

On the minimum leaf number of cubic graphs

The minimum leaf number ml (G) of a connected graph G is defined as the ...

A Note on Colourings of Connected Oriented Cubic Graphs

In this short note we show that every connected oriented cubic graph adm...

Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs

It follows from the work of Tait and the Four-Color-Theorem that a plana...

Isomorphism Testing for Graphs Excluding Small Minors

We prove that there is a graph isomorphism test running in time n^polylo...

Template-based Minor Embedding for Adiabatic Quantum Optimization

Quantum Annealing (QA) can be used to quickly obtain near-optimal soluti...

A natural extension to the convex hull problem and a novel solution

We study a natural extension to the well-known convex hull problem by in...