Untangling Surface Codes: Bridging Braids and Lattice Surgery

• URL: http://arxiv.org/abs/2511.22290v1
• Date: Thu, 27 Nov 2025 10:12:38 GMT
• Title: Untangling Surface Codes: Bridging Braids and Lattice Surgery
• Authors: Alexandru Paler,
• Abstract summary: We present a systematic method for translating fault-tolerant quantum circuits between their braiding and lattice surgery representations within the surface code.<n>Our framework provides a foundation for the automated verification, compilation, and benchmarking of large-scale surface code computations.
• Score: 51.748182660642776
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a systematic method for translating fault-tolerant quantum circuits between their braiding and lattice surgery (LS) representations within the surface code. Our approach employs the ZX calculus to establish an equivalence between these two paradigms, enabling verified, bidirectional conversion of arbitrary surface-code-level circuits. We show that both braiding and LS operations can be uniformly expressed as compositions of multibody measurements and demonstrate that the Raussendorf compression rule encompasses all known braid and bridge optimizations. We also introduce a novel CNOT circuit with LS. Our framework provides a foundation for the automated verification, compilation, and benchmarking of large-scale surface code computations, advancing toward a unified formal language for topological quantum computation.

Related papers

• Universal quantum computation with group surface codes [0.0]
  Group surface codes are equivalent to quantum double models of finite groups with specific conditions.<n>We show that group codes can be leveraged to perform non-Clifford gates in $mathbbZ$ surface codes.<n>For suitably chosen groups, we demonstrate that arbitrary classical surface gates can be implemented reversiblely in the group surface code.
  arXiv  Detail & Related papers  (2026-03-05T18:59:27Z)
• Weighted Projective Line ZX Calculus: Quantized Orbifold Geometry for Quantum Compilation [0.764671395172401]
  We develop a unified framework for quantum circuit compilation based on quantized orbifold phases and their diagrammatic semantics.<n>We show that these effects admit a natural description on the weighted projective line $mathbbP(a,b)$, whose orbifold points encode discrete phase grids.<n>We introduce the WPL--ZX calculus, an extension of the standard ZX formalism in which each spider carries a weight--phase--winding triple $(a,,k)$.
  arXiv  Detail & Related papers  (2025-11-30T00:56:39Z)
• Unlocking Symbol-Level Precoding Efficiency Through Tensor Equivariant Neural Network [84.22115118596741]
  We propose an end-to-end deep learning (DL) framework with low inference complexity for symbol-level precoding.<n>We show that the proposed framework captures substantial performance gains of optimal SLP, while achieving an approximately 80-times speedup over conventional methods.
  arXiv  Detail & Related papers  (2025-10-02T15:15:50Z)
• Surface-Code Hardware Hamiltonian [5.411640324412968]
  We present a framework for accurately modeling many-body interactions in surface-code quantum processor units (QPUs)<n>Our approach efficiently evaluates high-order, long-range Pauli string couplings and maps complete chip layouts onto exact effective Hamiltonians.<n>This framework serves as a powerful guide for optimizing next-generation high-fidelity surface-code hardware.
  arXiv  Detail & Related papers  (2025-07-08T17:27:32Z)
• Two-Qubit Gate Synthesis via Linear Programming for Heterogeneous Instruction Sets [0.7468717050144966]
  We present a segmented Cartan trajectory method that compiles arbitrary two-qubit unitaries into native gate sets.<n> GULPS provides a scalable, ISA-aware compilation strategy suitable for integration into platforms like Qiskit.
  arXiv  Detail & Related papers  (2025-05-01T14:13:13Z)
• Modeling and Performance Analysis for Semantic Communications Based on Empirical Results [53.805458017074294]
  We propose an Alpha-Beta-Gamma (ABG) formula to model the relationship between the end-to-end measurement and SNR.<n>For image reconstruction tasks, the proposed ABG formula can well fit the commonly used DL networks, such as SCUNet, and Vision Transformer.<n>To the best of our knowledge, this is the first theoretical expression between end-to-end performance metrics and SNR for semantic communications.
  arXiv  Detail & Related papers  (2025-04-29T06:07:50Z)
• Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph Neural Networks [38.499527873574436]
  We introduce a framework based on ZX calculus, graph-neural networks and reinforcement learning for quantum circuit optimization.<n>By combining reinforcement learning and tree search, our method addresses the challenge of selecting optimal sequences of ZX calculus rewrite rules.<n>We demonstrate our method's competetiveness with state-of-the-art circuit generalizations and capabilities on large sets of diverse random circuits.
  arXiv  Detail & Related papers  (2025-04-04T13:19:08Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Error correction of transversal CNOT gates for scalable surface code computation [0.37282630026096597]
  A controlled-NOT (tCNOT) gate introduces correlated errors across the code blocks. We examine and benchmark the performance of three different decoding strategies for the tC for scalable, fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2024-08-02T17:09:08Z)
• Transformers as Statisticians: Provable In-Context Learning with In-Context Algorithm Selection [88.23337313766353]
  This work first provides a comprehensive statistical theory for transformers to perform ICL. We show that transformers can implement a broad class of standard machine learning algorithms in context. A emphsingle transformer can adaptively select different base ICL algorithms.
  arXiv  Detail & Related papers  (2023-06-07T17:59:31Z)
• Local Propagation in Constraint-based Neural Network [77.37829055999238]
  We study a constraint-based representation of neural network architectures. We investigate a simple optimization procedure that is well suited to fulfil the so-called architectural constraints.
  arXiv  Detail & Related papers  (2020-02-18T16:47:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.