Topology-Aware Robustness Prediction: K-Hop Entropy Analysis of D-Wave Zephyr Architectures
Received: 14 August 2025 | Revised: 30 September 2025 and 19 October 2025 | Accepted: 21 October 2025 | Online: 2 December 2025
Corresponding author: Csaba Biro
Abstract
The physical connectivity of quantum processors significantly affects the performance and robustness of embedded quantum algorithms, particularly in architectures like D-Wave’s Zephyr. This work examines the use of K-hop Entropy Metric (KHEM) as a topology-aware metric to predict the stability of logical-to-physical qubit embeddings, eliminating the need for explicit noise models. KHEM quantifies the degree of heterogeneity within the k-hop neighborhood of each node. This provides insights into the local structural variability that influences the length of the embedding chain and the physical separation of the logical qubits. The present study analyzed simulated embeddings of Erdos–Renyi (ER) and complete logical graphs onto a Zephyr-8 architecture to assess the relationship between KHEM, average chain length, and hop-distance distributions. Jensen–Shannon Divergence (JSD) was then used to compare k = 2 and k = 3 distributions, while KHEM was shown to provide a fast, topology-driven pre-filter for robustness estimation on Zephyr-8.
Keywords:
quantum annealing, Zephyr topology, k-hop entropy metric, robustness prediction, Jensen–Shannon divergenceDownloads
References
V. Choi, "Minor-embedding in adiabatic quantum computation: I. The parameter setting problem," Quantum Information Processing, vol. 7, no. 5, pp. 193–209, Oct. 2008. DOI: https://doi.org/10.1007/s11128-008-0082-9
V. Choi, "Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design," Quantum Information Processing, vol. 10, no. 3, pp. 343–353, June 2011. DOI: https://doi.org/10.1007/s11128-010-0200-3
J. Cai, W. G. Macready, and A. Roy, "A practical heuristic for finding graph minors," arXiv, June 10, 2014.
S. Okada, M. Ohzeki, M. Terabe, and S. Taguchi, "Improving solutions by embedding larger subproblems in a D-Wave quantum annealer," Scientific Reports, vol. 9, no. 1, Feb. 2019, Art. no. 2098. DOI: https://doi.org/10.1038/s41598-018-38388-4
S. Zbinden, A. Bärtschi, H. Djidjev, and S. Eidenbenz, "Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies," in High Performance Computing, Cham, Switzerland, 2020, pp. 187–206. DOI: https://doi.org/10.1007/978-3-030-50743-5_10
E. Lobe, L. Schürmann, and T. Stollenwerk, "Embedding of complete graphs in broken Chimera graphs," Quantum Information Processing, vol. 20, no. 7, July 2021, Art. no. 234. DOI: https://doi.org/10.1007/s11128-021-03168-z
A. D. King et al., "Observation of topological phenomena in a programmable lattice of 1,800 qubits," Nature, vol. 560, no. 7719, pp. 456–460, Aug. 2018.
K. Boothby, P. Bunyk, J. Raymond, and A. Roy, "Next-Generation Topology of D-Wave Quantum Processors." arXiv, Feb. 29, 2020.
K. Boothby, A. D. King, and J. Raymond, "Zephyr Topology of D-Wave Quantum Processors," D-Wave Systems Inc., Palo Alto, CA, USA, Technical 14-1056A-A, Sept. 2021.
A. D. King and C. C. McGeoch, "Algorithm engineering for a quantum annealing platform." arXiv, Oct. 18, 2014.
C. Biró, "Structural Sensitivity in Graphs: An Entropy-Based k-Hop Metric and its Applications," in 2025 IEEE 19th International Symposium on Applied Computational Intelligence and Informatics (SACI), Timisoara, Romania, Feb. 2025, pp. 000273–000278. DOI: https://doi.org/10.1109/SACI66288.2025.11030155
C. Biró and G. Kusper, "Analysis of D-Wave Topologies with k-Hop-Based Graph Metrics," Quantum Reports, vol. 7, no. 2, June 2025, Art. no. 17. DOI: https://doi.org/10.3390/quantum7020017
C. Biró, "Hybrid Entropy-Based Metrics for k-Hop Environment Analysis in Complex Networks," Mathematics, vol. 13, no. 17, Jan. 2025, Art. no. 2902. DOI: https://doi.org/10.3390/math13172902
J. Lin, "Divergence measures based on the Shannon entropy," IEEE Transactions on Information Theory, vol. 37, no. 1, pp. 145–151, Jan. 1991. DOI: https://doi.org/10.1109/18.61115
P. Erdős and A. Rényi, "On random graphs I," Publicationes Mathematicae Debrecen, vol. 6, pp. 290–297, 1959. DOI: https://doi.org/10.5486/PMD.1959.6.3-4.12
N. R. Draper and H. Smith, Applied Regression Analysis, 3rd ed. Hoboken, NJ, USA: John Wiley & Sons, 1998. DOI: https://doi.org/10.1002/9781118625590
R. M. O’brien, "A Caution Regarding Rules of Thumb for Variance Inflation Factors," Quality & Quantity, vol. 41, no. 5, pp. 673–690, Oct. 2007. DOI: https://doi.org/10.1007/s11135-006-9018-6
A. Ali, M. a. H. Farquad, C. Atheeq, and C. Altaf, "A Quantum Encryption Algorithm based on the Rail Fence Mechanism to Provide Data Integrity," Engineering, Technology & Applied Science Research, vol. 14, no. 6, pp. 18818–18823, Dec. 2024. DOI: https://doi.org/10.48084/etasr.8993
S. Ali and B. Djaouida, "Optimizing Quantum Key Distribution Protocols using Decoy State Techniques and Experimental Validation," Engineering, Technology & Applied Science Research, vol. 14, no. 4, pp. 15133–15140, Aug. 2024. DOI: https://doi.org/10.48084/etasr.7521
T.-T. Nguyen, N.-Q. Luc, and T. T. Dao, "Developing Secure Messaging Software using Post-Quantum Cryptography," Engineering, Technology & Applied Science Research, vol. 13, no. 6, pp. 12440–12445, Dec. 2023. DOI: https://doi.org/10.48084/etasr.6549
E. Grant and T. S. Humble, "Benchmarking embedded chain breaking in quantum annealing," Quantum Science and Technology, vol. 7, no. 2, Nov. 2022, Art. no. 025029. DOI: https://doi.org/10.1088/2058-9565/ac26d2
S. Mandrà, Z. Zhu, W. Wang, A. Perdomo-Ortiz, and H. G. Katzgraber, "Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics versus quantum approaches," Physical Review A, vol. 94, no. 2, Aug. 2016, Art. no. 022337. DOI: https://doi.org/10.1103/PhysRevA.94.022337
Downloads
How to Cite
License
Copyright (c) 2025 Csaba Biro
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain the copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) after its publication in ETASR with an acknowledgement of its initial publication in this journal.
