EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Bipartitioning of graph states for distributed Measurement-Based Quantum Computing

Kjell Fredrik Pettersen, Matthias Heller, Giorgio Sartor, Raoul Heese

Physica Scripta · 13.11.2026 · 101 (45) · 455103

DOI: 10.1088/1402-4896/aeba4c ↗

Kurz gefasst

Fachartikel in der Zeitschrift Physica Scripta, online erschienen am 11.11.2026. Verfasst von Kjell Fredrik Pettersen und 3 weiteren Autor:innen. Die Arbeit nennt 39 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Hessisches Ministerium für Wissenschaft und Kunst, Hessisches Ministerium für Digitalisierung und Innovation, Norges Forskningsråd.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Measurement-Based Quantum Computing is inherently well-suited for Distributed Quantum Computing: once a resource state is prepared and distributed across a network of quantum nodes, computation proceeds through local measurements coordinated by classical communication. However, since non-local gates acting on different Quantum Processing Units (QPUs) are a bottleneck, it is crucial to optimize the qubit assignment to minimize inter-node entanglement of the shared resource. For graph state resources shared across two QPUs, this task reduces to finding balanced bipartitions with minimal cut rank. We introduce a simulated annealing-based algorithm that efficiently updates the cut rank when two vertices swap sides across a bipartition, such that computing the new cut rank from scratch, which would be much more expensive, is not necessary. Testing our approach on grid graphs, random graphs and measurement-based Quantum Approximate Optimization Algorithm instances, we find that it matches the quality of established hypergraph partitioning with the potential advantage of remaining invariant under local Clifford operations and thus independent of the chosen representative of the graph state.

Förderung

  • Hessisches Ministerium für Wissenschaft und Kunst
  • Hessisches Ministerium für Digitalisierung und Innovation
  • Norges Forskningsråd

Zitieren

APA

Pettersen, K. F., Heller, M., Sartor, G., & Heese, R. (2026). Bipartitioning of graph states for distributed Measurement-Based Quantum Computing. Physica Scripta, 101(45), 455103. https://doi.org/10.1088/1402-4896/aeba4c

Vancouver

Pettersen KF, Heller M, Sartor G, Heese R. Bipartitioning of graph states for distributed Measurement-Based Quantum Computing. Physica Scripta. 2026;101(45):455103. doi:10.1088/1402-4896/aeba4c

BibTeX
@article{Pettersen2026,
  author = {Pettersen, Kjell Fredrik and Heller, Matthias and Sartor, Giorgio and Heese, Raoul},
  title = {Bipartitioning of graph states for distributed Measurement-Based Quantum Computing},
  journal = {Physica Scripta},
  year = {2026},
  volume = {101},
  number = {45},
  pages = {455103},
  doi = {10.1088/1402-4896/aeba4c}
}
Kostenlos starten →