Superconducting surface-code processor with lattice-surgery logical operations — experimental demonstration of fault-tolerant logical Bell state preparation, Deutsch-Jozsa algorithm, and magic-state injection for non-Clifford rotations. Logical gate fidelity 0.943 for RX(π/4).
Scanned 9/11/2026
Install to Claude Code
npx -y skills add hiyenwong/ai_collection --skill surface-code-lattice-surgery --agent claude-codeInstalls into .claude/skills of the current project.
Are you the author of Surface Code Lattice Surgery?
Add the live security badge to your README — it updates automatically with every re-scan.
[](https://www.skillsdirectory.com/skills/hiyenwong-surface-code-lattice-surgery)More formats (shields.io, HTML) on the badges page.
---
name: surface-code-lattice-surgery
category: quantum
description: Superconducting surface-code processor with lattice-surgery logical operations — experimental demonstration of fault-tolerant logical Bell state preparation, Deutsch-Jozsa algorithm, and magic-state injection for non-Clifford rotations. Logical gate fidelity 0.943 for RX(π/4).
trigger: "lattice surgery, surface code logical operations, fault-tolerant logical gates, magic-state injection, logical Bell state, non-Clifford logical rotations, distance-three surface code, superconducting fault-tolerant"
source: "arXiv: 2606.06598"
created: "2026-06-09"
---
# Superconducting Surface-Code Processor with Lattice-Surgery Logical Operations
## Overview
This paper reports the experimental realization of lattice-surgery operations between distance-three surface-code logical qubits on a planar superconducting processor. Key achievements: deterministic logical Bell state preparation, logical Deutsch-Jozsa algorithm, and magic-state injection for continuous non-Clifford rotations with logical gate fidelity 0.943 for RX(π/4).
## Key Results
### Logical Qubit Performance
- **Distance-3 surface code** logical qubits implemented on planar superconducting processor
- **Per-cycle error rates**: 0.0365(2) and 0.0282(1) after leakage rejection
- **Repeated syndrome extraction** cycles demonstrated
### Lattice Surgery Operations
1. **Logical Bell State Preparation**
- Joint initialization + lattice splitting
- Confirmed genuine bipartite entanglement via error-corrected logical state fidelity
- Deterministic (not probabilistic) preparation
2. **Logical Deutsch-Jozsa Algorithm**
- Two-qubit algorithm executed at logical level
- Demonstrates algorithmic utility in fault-tolerant framework
3. **Magic-State Injection & Gate Teleportation**
- Continuous non-Clifford rotations about logical X axis
- Logical RX(π/4) gate fidelity: 0.943 (+10/-9) conditioned on no detected errors
- Enables universal control beyond Clifford group
## Architecture
### Lattice Surgery vs CNOT
| Aspect | CNOT-based | Lattice Surgery |
|--------|-----------|-----------------|
| Connectivity | Requires direct coupling | Neighboring patches sufficient |
| Overhead | Higher gate count | Lower spacetime cost |
| Fault tolerance | Code distance maintained | Merge-split operations |
### Logical Gate Set
- **Clifford**: Via lattice surgery (merge/split)
- **Non-Clifford**: Via magic-state injection + gate teleportation
- **Universal**: Clifford + T-gate (via magic states) achieves universality
## Experimental Setup
- **Hardware**: Planar superconducting qubit processor
- **Code distance**: d=3 surface code
- **Syndrome extraction**: Repeated cycles with leakage detection/rejection
- **Mid-circuit measurement**: Addressable measurement and reset
## Comparison with Other Approaches
- **Trapped-ion qLDPC** (2606.06455): Higher encoding rates but different connectivity model
- **Repetition code** (2606.07377): Simpler code but no full error correction capability
- **Surface code**: Lower encoding rate but proven fault tolerance pathway
## Applications
- **Near-term FTQC**: Lattice surgery is practical for near-term surface-code architectures
- **Scalable quantum computing**: Critical milestone toward fault-tolerant quantum advantage
- **Logical algorithm execution**: Demonstrated algorithmic utility at logical level
## Pitfalls
- **Leakage events**: Must be detected and rejected; reduces effective throughput
- **Distance-3 limitation**: Small code distance; larger distances needed for practical advantage
- **Conditional fidelity**: 0.943 fidelity conditioned on no detected errors; unconditioned fidelity lower
- **Planar constraint**: 2D nearest-neighbor connectivity limits parallelism
- **Magic-state overhead**: Non-Clifford gates require expensive magic-state preparation
## Verification
- Check logical state fidelity exceeds physical qubit fidelity (breakeven)
- Verify error rates scale with code distance as predicted by surface code theory
- Cross-validate with surface code simulation tools (Stim, QECsim)
- Compare gate fidelity against fault-tolerance threshold estimates
## Related Methodologies
- Surface code syndrome extraction
- Lattice surgery protocol design
- Magic-state distillation
- Gate teleportation protocols
- Leakage detection and rejection
Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.
No comments yet. Be the first to comment!