Embedding quadratization gadgets on Chimera and Pegasus graphs

01/23/2019
by   Nike Dattani, et al.
1

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/24/2019

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...
research
06/12/2018

On the minimum leaf number of cubic graphs

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

A Note on Colourings of Connected Oriented Cubic Graphs

In this short note we show that every connected oriented cubic graph adm...
research
04/25/2022

Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs

It follows from the work of Tait and the Four-Color-Theorem that a plana...
research
04/16/2020

Isomorphism Testing for Graphs Excluding Small Minors

We prove that there is a graph isomorphism test running in time n^polylo...
research
10/05/2019

Template-based Minor Embedding for Adiabatic Quantum Optimization

Quantum Annealing (QA) can be used to quickly obtain near-optimal soluti...
research
12/02/2020

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

Please sign up or login with your details

Forgot password? Click here to reset