Multi-qubit lattice surgery scheduling

DOI10.4230/LIPICS.TQC.2024.1MaRDI QIDQ6859977zbMATH OpenFDO

Authors Allyson Silva, Xiangyi Zhang, Zak Webb, Mia Kramer, Chan Woo Yang, X. Liu, Jessica Lemieux, Ka-Wai Chen, Artur Scherer, Pooya Ronagh

Publication date 10 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.TQC.2024.1

zbMATH Keywords

circuit optimizationmulti-qubit lattice surgeryquantum compilationsurface code

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites work

• A faster approximation algorithm for the Steiner problem in graphs
• A hybrid GRASP with perturbations for the Steiner problem in graphs
• A robust and scalable algorithm for the Steiner problem in graphs
• Fast local search for the Steiner problem in graphs
• On approximation algorithms for the terminal Steiner tree problem
• On the terminal Steiner tree problem.
• Packing Steiner Forests
• Packing strong subgraph in digraphs
• Solving Steiner trees: Recent advances, challenges, and perspectives
• Steiner tree packing revisited
• Surface code quantum computing by lattice surgery
• The cavity approach for Steiner trees packing problems
• The Steiner forest problem revisited
• Thinning out Steiner trees: a node-based model for uniform edge costs
• Universal quantum computation with ideal Clifford gates and noisy ancillas

This page was built for publication: Multi-qubit lattice surgery scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859977)