暂无分享,去创建一个
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.
[1] Hartmut Neven,et al. NIPS 2009 Demonstration: Binary Classification using Hardware Implementation of Quantum Annealing , 2009 .
[2] Nikesh S. Dattani,et al. Quadratization in discrete optimization and quantum mechanics , 2019, ArXiv.