Diamond Circuits for Surface Codes

• URL: http://arxiv.org/abs/2502.10355v1
• Date: Fri, 14 Feb 2025 18:33:43 GMT
• Title: Diamond Circuits for Surface Codes
• Abstract summary: We present and benchmark an interesting circuit family which we call diamond circuits.<n>They use a mid-cycle construction built around the subsystem surface code to implement a surface code on a Lieb or "Heavy-Square" lattice.<n>These circuits could be useful in regimes where quantum computers are limited by frequency collisions or number of control lines.
• Score: 0.36556493054302697
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present and benchmark an interesting circuit family which we call diamond circuits, that use a mid-cycle construction built around the subsystem surface code to implement a surface code on a Lieb or "Heavy-Square" lattice. This makes them more qubit- and measurement-efficient than previous constructions. These circuits are described via the LUCI framework, and are effectively circuits with half the measure qubits dropped out of the grid. These circuits preserve the spacelike distance of the code, but suffer a penalty in timelike distance, and could be useful in regimes where quantum computers are limited by frequency collisions or number of control lines.

Related papers

• Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid [3.6646002427839126]
  We introduce a family of quantum low-density parity-check codes, for the first time, using only nearest-neighbour gates on a square grid of qubits.<n>We find finite-size instances such as a [[323,14,15]] code, whose code-efficiency ratio is nearly an order of magnitude larger than that of rotated surface-code patches.<n>These results show that the advantages of quantum low-density parity-check codes can survive compilation into strictly planar nearest-neighbour circuits.
  arXiv  Detail & Related papers  (2026-06-17T18:14:23Z)
• Untangling Surface Codes: Bridging Braids and Lattice Surgery [51.748182660642776]
  We present a systematic method for translating fault-tolerant quantum circuits between their braiding and lattice surgery representations within the surface code.<n>Our framework provides a foundation for the automated verification, compilation, and benchmarking of large-scale surface code computations.
  arXiv  Detail & Related papers  (2025-11-27T10:12:38Z)
• A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes [2.160196691362033]
  We show that long-range connections can be reduced at the cost of increased syndrome extraction circuit depth.<n>Our approach is applicable to diverse quantum codes, offering a practical pathway toward their implementation on hardware with connectivity constraints.
  arXiv  Detail & Related papers  (2025-08-31T13:51:05Z)
• Handling fabrication defects in hex-grid surface codes [0.27907620376288694]
  We propose a method for handling broken qubits and couplers even in hex-grid surface code architectures.<n>We show that for isolated broken qubits, the circuit distance drops by one, while for isolated broken couplers, the distance drops by one in one or both bases.
  arXiv  Detail & Related papers  (2025-08-11T15:55:35Z)
• Reducing Quantum Error Correction Overhead with Versatile Flag-Sharing Syndrome Extraction Circuits [5.770351255180495]
  An efficient error syndrome extraction circuit should use fewer ancillary qubits, quantum gates, and measurements. We propose to design parallel flagged syndrome extraction with shared flag qubits for quantum stabilizer codes.
  arXiv  Detail & Related papers  (2024-06-30T06:35:48Z)
• CktGNN: Circuit Graph Neural Network for Electronic Design Automation [67.29634073660239]
  This paper presents a Circuit Graph Neural Network (CktGNN) that simultaneously automates the circuit topology generation and device sizing. We introduce Open Circuit Benchmark (OCB), an open-sourced dataset that contains $10$K distinct operational amplifiers. Our work paves the way toward a learning-based open-sourced design automation for analog circuits.
  arXiv  Detail & Related papers  (2023-08-31T02:20:25Z)
• Quantum spherical codes [55.33545082776197]
  We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
  arXiv  Detail & Related papers  (2023-02-22T19:00:11Z)
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics [0.09960584843614038]
  We design time-dynamic QEC circuits directly instead of designing static QEC codes to decompose into circuits. We present new circuits that can embed on a hexagonal grid instead of a square grid. All these constructions use no additional entangling gate layers and display essentially the same logical performance.
  arXiv  Detail & Related papers  (2023-02-04T16:35:42Z)
• Space-time optimized table lookup [3.961270923919885]
  We describe a space-time optimized circuit for the table lookup subroutine from lattice-surgery surface code primitives respecting 2D grid connectivity. Table lookup circuits are ubiquitous in quantum computing, allowing the presented circuit to be used for applications ranging from cryptography to quantum chemistry.
  arXiv  Detail & Related papers  (2022-11-02T14:10:40Z)
• 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)
• Circuit knitting with classical communication [1.8311368766923968]
  We study a method of circuit knitting based on quasiprobability simulation of nonlocal gates with operations that act locally on the subcircuits. We provide a positive answer by showing that for circuits containing $n$ nonlocal CNOT gates connecting two circuit parts, the simulation overhead can be reduced from $O(9n)$ to $O(4n)$ if one allows for classical information exchange.
  arXiv  Detail & Related papers  (2022-04-29T18:00:11Z)
• Surface code compilation via edge-disjoint paths [0.0]
  We show how to prepare many long-range pairs on qubits connected by edge-disjoint paths of ancillas in constant depth. This forms one core part of our Edge-Disjoint Paths Compilation algorithm. We find significantly improved performance for circuits built from parallel cnots, and for circuits which implement the multi-controlled $X$ gate.
  arXiv  Detail & Related papers  (2021-10-21T21:40:43Z)
• On the realistic worst case analysis of quantum arithmetic circuits [69.43216268165402]
  We show that commonly held intuitions when designing quantum circuits can be misleading. We show that reducing the T-count can increase the total depth. We illustrate our method on addition and multiplication circuits using ripple-carry.
  arXiv  Detail & Related papers  (2021-01-12T21:36:16Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit [62.997667081978825]
  We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code. We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
  arXiv  Detail & Related papers  (2020-02-18T16:45:09Z)

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.