PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 2, 20251 citationsOpen Access

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

View Full Paper
CAChristian Kraglund AndersenEGEliška Greplová

Key Points

  • The new quantum LDPC codes offer approximately twice the efficiency compared to surface codes, simplifying experimental use.
  • These codes utilize only weight-four parity checks, making them easier to implement for near-term quantum computing experiments.
  • Concrete proposals for implementation suggest using superconducting qubits in flip-chip architectures and spin qubits with shuttling methods.
  • These advancements aim to facilitate better benchmarking of hardware designs for long-range couplers in quantum systems.

Abstract

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Andersen et al. (2025) studied this question.

synapsesocial.com/papers/68de5da783cbc991d0a20abfhttps://doi.org/10.48550/arxiv.2507.09690
Ask AI
Helpful
Bookmark
Share
View Full Paper