Clifford-deformed Surface Codes

• URL: http://arxiv.org/abs/2201.07802v3
• Date: Wed, 28 Feb 2024 03:47:12 GMT
• Title: Clifford-deformed Surface Codes
• Authors: Arpit Dua, Aleksander Kubica, Liang Jiang, Steven T. Flammia, Michael J. Gullans
• Abstract summary: Various realizations of Kitaev's surface code perform surprisingly well for biased Pauli noise. We analyze CDSCs on the $3times 3$ square lattice and find that, depending on the noise bias, their logical error rates can differ by orders of magnitude.
• Score: 43.586723306759254
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Various realizations of Kitaev's surface code perform surprisingly well for biased Pauli noise. Attracted by these potential gains, we study the performance of Clifford-deformed surface codes (CDSCs) obtained from the surface code by applying single-qubit Clifford operators. We first analyze CDSCs on the $3\times 3$ square lattice and find that, depending on the noise bias, their logical error rates can differ by orders of magnitude. To explain the observed behavior, we introduce the effective distance $d'$, which reduces to the standard distance for unbiased noise. To study CDSC performance in the thermodynamic limit, we focus on random CDSCs. Using the statistical mechanical mapping for quantum codes, we uncover a phase diagram that describes random CDSC families with $50\%$ threshold at infinite bias. In the high-threshold region, we further demonstrate that typical code realizations outperform the thresholds and subthreshold logical error rates, at finite bias, of the best-known translationally invariant codes. We demonstrate the practical relevance of these random CDSC families by constructing a translation-invariant CDSC belonging to a high-performance random CDSC family. We also show that our translation-invariant CDSC outperforms well-known translation-invariant CDSCs such as the XZZX and XY codes.

Related papers

• Clifford-Deformed Compass Codes [0.49109372384514843]
  We find Clifford deformations that can be applied to elongated compass codes resulting in QEC codes with improved performance under noise models. One of the Clifford deformations we explore yields QEC codes with better thresholds and logical error rates than those of the XZZX surface code at moderate biases.
  arXiv  Detail & Related papers  (2024-12-05T02:02:42Z)
• Correcting biased noise using Gottesman-Kitaev-Preskill repetition code with noisy ancilla [0.6802401545890963]
  Gottesman-Kitaev-Preskill (GKP) code is proposed to correct small displacement error in phase space. If noise in phase space is biased, square-lattice GKP code can be ancillaryd with XZZX surface code or repetition code. We study the performance of GKP repetition codes with physical ancillary GKP qubits in correcting biased noise.
  arXiv  Detail & Related papers  (2023-08-03T06:14:43Z)
• Holographic Codes from Hyperinvariant Tensor Networks [70.31754291849292]
  We show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states.
  arXiv  Detail & Related papers  (2023-04-05T20:28:04Z)
• Biased Gottesman-Kitaev-Preskill repetition code [0.0]
  Continuous-variable quantum computing architectures based upon the Gottesmann-Kitaev-Preskill (GKP) encoding have emerged as a promising candidate. We study the code-capacity behaviour of a rectangular-lattice GKP encoding with a repetition code under an isotropic Gaussian displacement channel.
  arXiv  Detail & Related papers  (2022-12-21T22:56:05Z)
• Tailoring three-dimensional topological codes for biased noise [2.362412515574206]
  topological stabilizer codes in two dimensions have been shown to exhibit high storage threshold error rates and improved biased Pauli noise. We present Clifford deformations of various 3D topological codes, such that they exhibit a threshold error rate of $50%$ under infinitely biased Pauli noise.
  arXiv  Detail & Related papers  (2022-11-03T19:40:57Z)
• Bayes risk CTC: Controllable CTC alignment in Sequence-to-Sequence tasks [63.189632935619535]
  Bayes risk CTC (BRCTC) is proposed to enforce the desired characteristics of the predicted alignment. By using BRCTC with another preference for early emissions, we obtain an improved performance-latency trade-off for online models.
  arXiv  Detail & Related papers  (2022-10-14T03:55:36Z)
• Tailored XZZX codes for biased noise [60.12487959001671]
  We study a family of codes having XZZX-type stabilizer generators. We show that these XZZX codes are highly qubit efficient if tailored to biased noise.
  arXiv  Detail & Related papers  (2022-03-30T17:26:31Z)
• Bias-tailored quantum LDPC codes [3.565124653091339]
  We introduce a bias-tailored lifted product code construction that provides the framework to expand bias-tailoring methods. We show that bias-tailored quantum low density parity check codes can be similarly bias-tailored. Our Monte Carlo simulations, performed under asymmetric noise, show that bias-tailored codes achieve several orders of magnitude improvement in their error suppression.
  arXiv  Detail & Related papers  (2022-02-03T17:11:10Z)
• 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)
• Lattice partition recovery with dyadic CART [79.96359947166592]
  We study piece-wise constant signals corrupted by additive Gaussian noise over a $d$-dimensional lattice. Data of this form naturally arise in a host of applications, and the tasks of signal detection or testing, de-noising and estimation have been studied extensively in the statistical and signal processing literature. In this paper we consider instead the problem of partition recovery, i.e.of estimating the partition of the lattice induced by the constancy regions of the unknown signal. We prove that a DCART-based procedure consistently estimates the underlying partition at a rate of order $sigma2 k*
  arXiv  Detail & Related papers  (2021-05-27T23:41:01Z)
• Enhanced noise resilience of the surface-GKP code via designed bias [0.0]
  We study the code obtained by concatenating the standard single-mode Gottesman-Kitaev-Preskill (GKP) code with the surface code. We show that the noise tolerance of this surface-GKP code with respect to (Gaussian) displacement errors improves when a single-mode squeezing unitary is applied to each mode.
  arXiv  Detail & Related papers  (2020-04-01T16:08:52Z)

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.