Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Parity check operation in a surface code plaquette segment with superconducting qubits

Jerry M. Chow, Jay Gambetta, Srikanth J. Srinivasan, Easwar Magesan, Andrew W. Cross, David W. Abraham, Nicholas A. Masluk, Blake Johnson, Colm A. Ryan, Christopher Lirakis, Matthias Steffen

Published Mar 3, 2014• 0 citations
OpenAlex

Related papers

Weight-4 Parity Checks on a Surface Code Sublattice with Superconducting Qubits

Maika Takita, Antonio D. Corcoles, Easwar Magesan +5 more

Bulletin of the American Physical Society•Mar 15, 2016•0 citations

Surface Code Error Correction via Stabilizer Formalism and Lattice Geometry — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Surface code error correction uses stabilizer formalism with parity check matrices derived from lattice geometry, enabling fault-tolerant quantum computation. MATH: - Stabilizer group \( S = \langle g_1, g_2, \dots, g_m \rangle \) where each \( g_i \) is a Pauli operator (tensor product of \( X, Y, Z, I \)) on \( n \) qubits. - Parity check matrix \( H \) over \( \mathbb{F}_2 \) (for \( X \) and \( Z \) errors separately) has size \( (n-k) \times n \), with rows corresponding to stabilizer generators. - Surface code: qubits on edges of a square lattice, stabilizers are plaquette (Z-type) and vertex (X-type) operators. Code distance \( d \) scales with lattice size \( L \): \( d = L \) for \( L \times L \) lattice. - Logical operators are non-trivial cycles on the dual lattice, with commutation relations given by intersection number mod 2. - Error correction threshold: \( p_{\text{th}} \approx 0.103 \) (for standard depolarizing noise) — no simple rational ratio, but Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 28, 2026•0 citations

Demonstrating a four-qubit network for the surface code with superconducting qubits

Srikanth J. Srinivasan, Easwar Magesan, Jerry M. Chow +7 more

Bulletin of the American Physical Society•Mar 3, 2014•0 citations

Weight-four parity checks with silicon spin qubits

Brennan Undseth, Nicola Meggiato, Yi-Hsien Wu +7 more

Recent advances in coherent spin shuttling have made sparse semiconductor spin qubit arrays an appealing solid-state platform to realize quantum processors. The dynamic and long-range connectivity enabled by shuttling is also essential for many quantum error-correction (QEC) schemes. Here, we demonstrate a silicon spin-qubit device that comprises a shuttling bus for coherently transporting qubits that can interact at four isolated locations we call bus stops. We dynamically populate the array and tune all single- and two-qubit operations using shuttling and quantum non-demolition (QND) spin measurements, without access to charge sensing in most of the device. We achieve universal control of the effective five-qubit processor and select the connectivity required to form a surface-code stabilizer plaquette that supports X- and Z-type parity checks up to weight-four. We use the parity checks to generate multi-qubit entanglement between all qubit combinations in the array and report the genuine entanglement of a five-qubit Greenberger-Horne-Zeilinger (GHZ) state, constituting the largest such state ever constructed with gate-defined semiconductor spins. This work opens immediate opportunities to pursue QEC experiments with spin qubits, and the protocols developed here lay the groundwork for the modular calibration and operation of sparse spin qubit arrays.

cond-mat.mes-hallCross-listedarXiv:2601.23267•Feb 2, 2026•0 citations

Small Quantum Low Density Parity Check Codes for Near-Term Experiments

Christian Kraglund Andersen, Eliška Greplová

It is widely accepted that quantum error correction is essential for realizing large-scale fault-tolerant quantum computing. Recent experiments have demonstrated error correction codes operating below threshold, primarily using local planar codes such as the surface code and color code. In parallel, theoretical advances in quantum low-density parity-check (LDPC) codes promise significantly lower overheads, albeit at the cost of requiring non-local parity checks. While these results are encouraging, implementing such codes remains challenging for near-term experiments, creating obstacles to holistic benchmarking of hardware architectures capable of supporting long-range couplers. In this work, we present a simple construction recipe for small quantum LDPC codes based on recent developments in the field. Our codes are approximately twice as efficient as comparable surface codes, yet require only weight-four parity checks, which simplifies experimental realization compared to other quantum LDPC codes. We provide concrete proposals for implementations with superconducting qubits in flip-chip architectures and with semiconductor spin qubits using shuttling-based approaches.

arXiv:2507.09690•Jul 13, 2025•1 citation

Superconducting quantum circuits at the surface code threshold for fault tolerance

R. Barends, J. Kelly, A. Megrant +19 more

arXiv:1402.4848•Nature•Apr 1, 2014•1,732 citations
FINDING: Surface code error correction uses stabilizer formalism with parity check matrices derived from lattice geometry, enabling fault-tolerant quantum computation. MATH: - Stabilizer group S=⟨g1,g2,…,gm⟩ S = \langle g_1, g_2, \dots, g_m \rangle S=⟨g1​,g2​,…,gm​⟩ where each gi g_i gi​ is a Pauli operator (tensor product of X,Y,Z,I X, Y, Z, I X,Y,Z,I) on n n n qubits. - Parity check matrix H H H over F2 \mathbb{F}_2 F2​ (for X X X and Z Z Z errors separately) has size (n−k)×n (n-k) \times n (n−k)×n, with rows corresponding to stabilizer generators. - Surface code: qubits on edges of a square lattice, stabilizers are plaquette (Z-type) and vertex (X-type) operators. Code distance d d d scales with lattice size L L L: d=L d = L d=L for L×L L \times L L×L lattice. - Logical operators are non-trivial cycles on the dual lattice, with commutation relations given by intersection number mod 2. - Error correction threshold: pth≈0.103 p_{\text{th}} \approx 0.103 pth​≈0.103 (for standard depolarizing noise) — no simple rational ratio, but Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Recent advances in coherent spin shuttling have made sparse semiconductor spin qubit arrays an appealing solid-state platform to realize quantum processors. The dynamic and long-range connectivity enabled by shuttling is also essential for many quantum error-correction (QEC) schemes. Here, we demonstrate a silicon spin-qubit device that comprises a shuttling bus for coherently transporting qubits that can interact at four isolated locations we call bus stops. We dynamically populate the array and tune all single- and two-qubit operations using shuttling and quantum non-demolition (QND) spin measurements, without access to charge sensing in most of the device. We achieve universal control of the effective five-qubit processor and select the connectivity required to form a surface-code stabilizer plaquette that supports X- and Z-type parity checks up to weight-four. We use the parity checks to generate multi-qubit entanglement between all qubit combinations in the array and report the genuine entanglement of a five-qubit Greenberger-Horne-Zeilinger (GHZ) state, constituting the largest such state ever constructed with gate-defined semiconductor spins. This work opens immediate opportunities to pursue QEC experiments with spin qubits, and the protocols developed here lay the groundwork for the modular calibration and operation of sparse spin qubit arrays.
It is widely accepted that quantum error correction is essential for realizing large-scale fault-tolerant quantum computing. Recent experiments have demonstrated error correction codes operating below threshold, primarily using local planar codes such as the surface code and color code. In parallel, theoretical advances in quantum low-density parity-check (LDPC) codes promise significantly lower overheads, albeit at the cost of requiring non-local parity checks. While these results are encouraging, implementing such codes remains challenging for near-term experiments, creating obstacles to holistic benchmarking of hardware architectures capable of supporting long-range couplers. In this work, we present a simple construction recipe for small quantum LDPC codes based on recent developments in the field. Our codes are approximately twice as efficient as comparable surface codes, yet require only weight-four parity checks, which simplifies experimental realization compared to other quantum LDPC codes. We provide concrete proposals for implementations with superconducting qubits in flip-chip architectures and with semiconductor spin qubits using shuttling-based approaches.