Version 1
: Received: 14 October 2024 / Approved: 14 October 2024 / Online: 15 October 2024 (11:43:08 CEST)
How to cite:
Biró, C.; Kusper, G. Analysis of $d$-Wave Topologies with $k$-Hop-Based Graph Metrics. Preprints2024, 2024101116. https://doi.org/10.20944/preprints202410.1116.v1
Biró, C.; Kusper, G. Analysis of $d$-Wave Topologies with $k$-Hop-Based Graph Metrics. Preprints 2024, 2024101116. https://doi.org/10.20944/preprints202410.1116.v1
Biró, C.; Kusper, G. Analysis of $d$-Wave Topologies with $k$-Hop-Based Graph Metrics. Preprints2024, 2024101116. https://doi.org/10.20944/preprints202410.1116.v1
APA Style
Biró, C., & Kusper, G. (2024). Analysis of $d$-Wave Topologies with $k$-Hop-Based Graph Metrics. Preprints. https://doi.org/10.20944/preprints202410.1116.v1
Chicago/Turabian Style
Biró, C. and Gábor Kusper. 2024 "Analysis of $d$-Wave Topologies with $k$-Hop-Based Graph Metrics" Preprints. https://doi.org/10.20944/preprints202410.1116.v1
Abstract
In this paper, we focus on graph-based analysis of the topology of $D$-Wave quantum computers. The Pegasus, Chimera, and Zephyr topologies generated with different parameters are examined using $k$-hop-based graph metrics. In addition to the well-known classical graph metrics, we briefly describe the density and redundancy-based metrics interpreted in the $k$-hop environment. These topologies consist of different subgraphs depending on the implementation in which the qubits are connected in a specific pattern. Our main goal is to use metrics to highlight the main features and limitations of these topologies. The secondary goal is that the results contribute to the further development of more efficient quantum processors.
Computer Science and Mathematics, Applied Mathematics
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
