Magic teleportation with generalized lattice surgery

• URL: http://arxiv.org/abs/2503.19758v1
• Date: Tue, 25 Mar 2025 15:21:01 GMT
• Title: Magic teleportation with generalized lattice surgery
• Authors: Yifei Wang, Yingfei Gu,
• Abstract summary: We propose a novel, distillation-free scheme for the fault-tolerant implementation of non-Clifford logical level gates.<n>Specifically, non-Clifford gates are executed on one QEC code and then teleported to the main circuit via a logical-level joint measurement.<n>In contrast to conventional magic state distillation (MSD) combined with gate teleportation, our method obviates the need for concatenating separate codes for distillation and logical qubits.
• Score: 13.971120210536995
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a novel, distillation-free scheme for the fault-tolerant implementation of non-Clifford gates at the logical level, thereby completing the universal gate set. Our approach exploits generalized lattice surgery to integrate two quantum error-correcting (QEC) codes. Specifically, non-Clifford gates are executed transversally on one QEC code and then teleported to the main circuit via a logical-level joint measurement that connects two distinct QEC codes. In contrast to conventional magic state distillation (MSD) combined with gate teleportation, our method obviates the need for concatenating separate codes for distillation and logical qubits, thus reducing the total overhead from multiplicative to additive scaling. We illustrate our approach by explicitly demonstrating its implementation for a 3D color code interfaced with a surface code of the same code distance, and comment on its potential advantage over the conventional MSD-teleportation scheme.

Related papers

• Single-Shot Universality in Quantum LDPC Codes via Code-Switching [7.411709177042115]
  We present a single-shot, universal protocol that uses code-switching between high-rate quantum codes to perform fault-tolerant quantum computation.<n>We achieve this feat with single-shot code-switching between constant-rate 2D hypergraph product (HGP) codes and high-rate 3D HGP codes.<n>We prove the fault-tolerance of our code-switching protocol under both the adversarial and localstochastic noise models.
  arXiv  Detail & Related papers  (2025-10-09T17:57:46Z)
• Low Overhead Universal Quantum Computation with Triorthogonal Codes [8.516351290711953]
  We study the use of triorthogonal codes for universal fault-tolerant quantum computation.<n>We propose two methods to circumvent the Eastin-Knill theorem, which prohibits any single quantum error-correcting code from supporting both universality and a gate set.
  arXiv  Detail & Related papers  (2025-10-07T09:17:10Z)
• 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)
• Measurement-free code-switching for low overhead quantum computation using permutation invariant codes [6.281229317487581]
  We present a measurement-free code-switching protocol for universal quantum computation.<n>The novel non-Clifford gates enabled by this code-switching protocol enable implementation of a universal gate set more efficient than the Clifford$+T$ gate set.
  arXiv  Detail & Related papers  (2024-11-20T09:16:07Z)
• Measurement-free, scalable and fault-tolerant universal quantum computing [1.2600261666440378]
  We present a complete toolbox for fault-tolerant universal quantum computing without the need for measurements during algorithm execution. We develop new fault-tolerant, measurement-free protocols to transfer encoded information between 2D and 3D color codes. Our measurement-free approach provides a practical and scalable pathway for universal quantum computing on state-of-the-art quantum processors.
  arXiv  Detail & Related papers  (2024-10-17T14:04:14Z)
• 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 code switching via one-way transversal CNOT gates [0.0]
  We present a code scheme that respects the constraints of FT circuit design by only making use of switching gates. We analyze application of the scheme to low-distance color codes, which are suitable for operation in existing quantum processors. We discuss how the scheme can be implemented with a large degree of parallelization, provided that logical auxiliary qubits can be prepared reliably enough.
  arXiv  Detail & Related papers  (2024-09-20T12:54:47Z)
• Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors [0.0]
  Top color codes are widely acknowledged as promising candidates for fault-tolerant quantum computing. Top color codes can provide a universal gate set $$H, T, C$$, with the T-gate missing in the T-dimensional and the H-gate in the three-dimensional case. We construct resource-optimized deterministic and non-deterministic code switching protocols for two- and three-dimensional distance-three color codes.
  arXiv  Detail & Related papers  (2023-06-30T14:16:52Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• 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)
• Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum Computers [45.66259474547513]
  We design quantum circuits by using the standard cell approach borrowed from classical circuit design. We present evidence that, when compared with automatic routing methods, our layout-aware routers are significantly faster and achieve shallower 3D circuits.
  arXiv  Detail & Related papers  (2022-06-10T10:54:46Z)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes [63.62764375279861]
  We compare two leading FT implementations of the T gate in 2D color codes under circuit noise. We find a circuit noise threshold of 0.07(1)% for the T gate via code switching, almost an order of magnitude below that achievable by state distillation in the same setting.
  arXiv  Detail & Related papers  (2021-01-06T19:00:01Z)

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.