Pegasus: The second connectivity graph for large-scale quantum annealing hardware
arXiv:1901.07636
Abstract
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.
Figures were made with our open source software PegasusDraw: https://github.com/HPQC-LABS/PegasusDraw
References in corpus (1)
Cited by in corpus (22)
- Adiabatic Quantum Linear Regression
- An Application of Quantum Annealing Computing to Seismic Inversion
- Approximate optimization, sampling and spin-glass droplets discovery with tensor networks
- Optimal Thermometers with Spin Networks
- Guiding Principle for Minor-Embedding in Simulated-Annealing-Based Ising Machines
- The three phases of quantum annealing: fast, slow, and very slow
- Quadratization in discrete optimization and quantum mechanics
- Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
- Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits
- Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines
- Phase transition of Frustrated Ising model via D-wave Quantum Annealing Machine
- Initial State Encoding via Reverse Quantum Annealing and h-gain Features
- Disorder-assisted graph coloring on quantum annealers
- Balancing coherent and dissipative dynamics in a central-spin system
- Solving systems of Boolean multivariate equations with quantum annealing
- A Quantum Algorithm for Model-Independent Searches for New Physics
- Quantum Computing for Discrete Optimization: A Highlight of Three Technologies
- Solving rescheduling problems in heterogeneous urban railway networks using hybrid quantum-classical approach
- Dynamic Optimization on Quantum Hardware: Feasibility for a Process Industry Use Case
- Posiform Planting: Generating QUBO Instances for Benchmarking
- Multi-disk clutch optimization using quantum annealing
- SpinGlassPEPS.jl: Tensor-network package for Ising-like optimization on quasi-two-dimensional graphs