DeepAI AI Chat
Log In Sign Up

Pegasus: The second connectivity graph for large-scale quantum annealing hardware

by   Nike Dattani, et al.
Harvard University
Durham University

Pegasus is a graph which offers substantially increased connectivity between the qubits of quantum annealing hardware compared to the graph Chimera. It is the first fundamental change in the connectivity graph of quantum annealers built by D-Wave since Chimera was introduced in 2009 and then used in 2011 for D-Wave's first commercial quantum annealer. In this article we describe an algorithm which defines the connectivity of Pegasus and we provide what we believe to be the best way to graphically visualize Pegasus in order to see which qubits couple to each other. As supplemental material, we provide a wide variety of different visualizations of Pegasus which expose different properties of the graph in different ways. We provide an open source code for generating the many depictions of Pegasus that we show.


page 9

page 10

page 13

page 14

page 15


Applications of Quantum Annealing in Statistics

Quantum computation offers exciting new possibilities for statistics. Th...

Single-Qubit Fidelity Assessment of Quantum Annealing Hardware

As a wide variety of quantum computing platforms become available, metho...

Breaking limitation of quantum annealer in solving optimization problems under constraints

Quantum annealing is a generic solver for optimization problems that use...

Graver Bases via Quantum Annealing with Application to Non-Linear Integer Programs

We propose a novel hybrid quantum-classical approach to calculate Graver...

Graffinity: Visualizing Connectivity In Large Graphs

Multivariate graphs are prolific across many fields, including transport...

Quadratization in discrete optimization and quantum mechanics

A book about turning high-degree optimization problems into quadratic op...