Quantum Lego Power-up: Designing Transversal Gates with Tensor Networks

• URL: http://arxiv.org/abs/2603.03542v1
• Date: Tue, 03 Mar 2026 21:56:34 GMT
• Title: Quantum Lego Power-up: Designing Transversal Gates with Tensor Networks
• Authors: ChunJun Cao, Brad Lackey,
• Abstract summary: Transversal gates are the simplest form of fault-tolerant gates and are relatively easy to implement in practice.<n>We show that designing codes that support useful operations -- especially non-Clifford or addressable gates -- remains difficult within the stabilizer formalism or CSS constructions alone.<n>Within the quantum lego formalism, small codes carrying desirable symmetries can be "glued" into larger ones, with operator-flow rules guiding how logical symmetries are preserved.
• Score: 6.445605125467573
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Transversal gates are the simplest form of fault-tolerant gates and are relatively easy to implement in practice. Yet designing codes that support useful transversal operations -- especially non-Clifford or addressable gates -- remains difficult within the stabilizer formalism or CSS constructions alone. We show that these limitations can be overcome using tensor-network frameworks such as the quantum lego formalism, where transversal gates naturally appear as global or localized symmetries. Within the quantum lego formalism, small codes carrying desirable symmetries can be "glued" into larger ones, with operator-flow rules guiding how logical symmetries are preserved. This approach enables the systematic construction of codes with addressable transversal single- and multi-qubit gates targeting specific logical qubits regardless of whether the gate is Clifford or not. As a proof of principle, we build new finite-rate code families that support strongly transversal $T$, $CCZ$, $SH$, and Gottesman's $K_3$ gates, structures that are challenging to realize with conventional methods. We further construct holographic and fractal-like codes that admit addressable transversal inter-, meso-, and intra-block $T$, $CS$, and $C^\ell Z$ gates. As a corollary, we demonstrate that the heterogeneous holographic Steane-Reed-Muller black hole code also supports fully addressable transversal inter- and intra-block $CZ$ gates, significantly lowering the overhead for universal fault-tolerant computation.

Related papers

• Note on Logical Gates by Gauge Field Formalism of Quantum Error Correction [0.0]
  We show that logical gates can be expressed as exponential qubits of the electric and magnetic gauge fields.<n>Our results offer new insights into the interplay between quantum error correction, topology, and quantum field theory.
  arXiv  Detail & Related papers  (2025-11-19T08:23:50Z)
• Transversal Gates for Highly Asymmetric qLDPC Codes [0.0]
  Transversal gates are the ideal gates in a fault-tolerant scenario.<n>We show that qLDPC codes with phase gates have a number of logical qubits that grows linearly with $n$.<n>This is critical when addressing the question of what a phase gate truly means when there are many logical qubits in the system.
  arXiv  Detail & Related papers  (2025-06-18T22:37:21Z)
• Multi-Target Rydberg Gates via Spatial Blockade Engineering [47.582155477608445]
  Multi-target gates offer the potential to reduce gate depth in syndrome extraction for quantum error correction.<n>We propose single-control-multi-target CZotimes N gates on a single-species neutral-atom platform.<n>We synthesise smooth control pulses for CZZ and CZZZ gates, achieving fidelities of up to 99.55% and 99.24%, respectively.
  arXiv  Detail & Related papers  (2025-04-21T17:59:56Z)
• Quantum Codes with Addressable and Transversal Non-Clifford Gates [8.194994143531677]
  We study codes that support gates which induce $textitaddressable$ logical gates.<n>We develop a formalism for constructing quantum codes with $textitaddressable and $ell neq 2$ gates.
  arXiv  Detail & Related papers  (2025-02-03T22:24:34Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Targeted Clifford logical gates for hypergraph product codes [54.57204856880369]
  We first derive symplectic matrices for CNOT, CZ, Phase, and Hadamard operators, which together generate the Clifford group.<n>This enables us to design explicit transformations that result in targeted logical gates for arbitrary codes in this family.
  arXiv  Detail & Related papers  (2024-11-26T02:32:44Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays [19.62225357437067]
  We demonstrate that features of the reconfigurable atom array platform are inherently well-suited for addressing this key challenge. We consider a series of different strategies including magic state distillation, code array, and fault-tolerant logical multi-controlled-$Z$ gates. Our analysis provides valuable insights into the efficient experimental realization of logical gates, serving as a guide for the full-cycle demonstration of fault-tolerant quantum computation with reconfigurable atom arrays.
  arXiv  Detail & Related papers  (2023-12-14T16:46:25Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes [0.0]
  Quantum computers should have both universal and fault-tolerant logic gates. A number of no-go theorems constrain the ways in which a set of fault-tolerant logic gates can be universal. We present a general framework for universal fault-tolerant logic with stabiliser codes. We show how non-unitary implementations of logic gates provide a general approach to circumvent the no-go theorem.
  arXiv  Detail & Related papers  (2020-12-09T19:01:07Z)

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.