Logical coherence in 2D compass codes
- URL: http://arxiv.org/abs/2405.09287v2
- Date: Tue, 11 Feb 2025 23:14:38 GMT
- Title: Logical coherence in 2D compass codes
- Authors: Balint Pato, J. Wilson Staples, Kenneth R. Brown,
- Abstract summary: 2D compass codes are a family of quantum error-correcting codes that contain the Bacon-Shor codes, the $X$-Shor and $Z$-Shor codes, and the rotated surface codes.
Previous results suggest that the surface code has a constant accuracy and coherence threshold under uniform coherent rotation.
It is analytically proven that the toric code can exponentially suppress logical coherence in the code distance $L$.
We show that this lower bound is achievable by the $Z$-Shor code which does not have a threshold under noise.
- Score: 0.4369550829556578
- License:
- Abstract: 2D compass codes are a family of quantum error-correcting codes that contain the Bacon-Shor codes, the $X$-Shor and $Z$-Shor codes, and the rotated surface codes. Previous numerical results suggest that the surface code has a constant accuracy and coherence threshold under uniform coherent rotation. However, having analytical proof supporting a constant threshold is still an open problem. It is analytically proven that the toric code can exponentially suppress logical coherence in the code distance $L$. However, the current analytical lower bound on the threshold for the rotation angle $\theta$ is $|\sin(\theta)| < 1/L$, which linearly vanishes in $L$ instead of being constant. We show that this lower bound is achievable by the $Z$-Shor code which does not have a threshold under stochastic noise. Compass codes provide a promising direction to improve on the previous bounds. We analytically determine thresholds for two new compass code families that provide upper and lower bounds to the rotated surface code's numerically established infidelity threshold. Furthermore, using a Majorana mode-based simulator, we use random families of compass codes to smoothly interpolate between the $Z$-Shor codes and the $X$-Shor codes.
Related papers
- Decoding Quasi-Cyclic Quantum LDPC Codes [23.22566380210149]
Quantum low-density parity-check (qLDPC) codes are an important component in the quest for fault tolerance.
Recent progress on qLDPC codes has led to constructions which are quantumally good, and which admit linear-time decoders to correct errors affecting a constant fraction of codeword qubits.
In practice, the surface/toric codes, which are the product of two repetition codes, are still often the qLDPC codes of choice.
arXiv Detail & Related papers (2024-11-07T06:25:27Z) - Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes [38.729065908701585]
We introduce a new class of qubit codes that we call Evenbly codes.
Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
arXiv Detail & Related papers (2024-07-16T17:18:13Z) - SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes.
Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes.
We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
arXiv Detail & Related papers (2024-07-12T16:50:01Z) - How much entanglement is needed for quantum error correction? [10.61261983484739]
It is commonly believed that logical states of quantum error-correcting codes have to be highly entangled.
Here we show that this belief may or may not be true depending on a particular code.
arXiv Detail & Related papers (2024-05-02T14:35:55Z) - Performance Analysis of Quantum CSS Error-Correcting Codes via
MacWilliams Identities [9.69910104594168]
We analyze the performance of stabilizer codes, one of the most important classes for practical implementations.
We introduce a novel approach that combines the knowledge of WE with a logical operator analysis.
For larger codes our bound provides $rho_mathrmL approx 1215 rho4$ and $rho_mathrmL approx 663 rho5$ for the $[85,1,7]]$ and the $[181,1,10]]$ surface codes.
arXiv Detail & Related papers (2023-05-02T10:19:02Z) - CSS code surgery as a universal construction [51.63482609748332]
We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes.
We describe code surgery between such codes using a specific colimit in the category of chain complexes.
arXiv Detail & Related papers (2023-01-31T16:17:25Z) - Variance-Aware Sparse Linear Bandits [64.70681598741417]
Worst-case minimax regret for sparse linear bandits is $widetildeThetaleft(sqrtdTright)$.
In the benign setting where there is no noise and the action set is the unit sphere, one can use divide-and-conquer to achieve an $widetildemathcal O(1)$ regret.
We develop a general framework that converts any variance-aware linear bandit algorithm to a variance-aware algorithm for sparse linear bandits.
arXiv Detail & Related papers (2022-05-26T15:55:44Z) - The XYZ$^2$ hexagonal stabilizer code [0.0]
The "XYZ$2$" code is a simple realization of a "matching code" discussed by Wootton.
The code possesses distinctive syndrome properties with unidirectional pairs of plaquette defects along the three directions of the triangular lattice.
arXiv Detail & Related papers (2021-12-11T17:47:16Z) - Morphing quantum codes [77.34726150561087]
We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate.
We construct a family of hybrid color-toric codes by morphing the color code.
arXiv Detail & Related papers (2021-12-02T17:43:00Z) - Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits
with Linear Payoff Functions [53.77572276969548]
We show that the C$2$UCB algorithm has the optimal regret bound $tildeO(dsqrtkT + dk)$ for the partition matroid constraints.
For general constraints, we propose an algorithm that modifies the reward estimates of arms in the C$2$UCB algorithm.
arXiv Detail & Related papers (2021-01-20T04:29:18Z) - Naive Exploration is Optimal for Online LQR [49.681825576239355]
We show that the optimal regret scales as $widetildeTheta(sqrtd_mathbfu2 d_mathbfx T)$, where $T$ is the number of time steps, $d_mathbfu$ is the dimension of the input space, and $d_mathbfx$ is the dimension of the system state.
Our lower bounds rule out the possibility of a $mathrmpoly(logT)$-regret algorithm, which had been
arXiv Detail & Related papers (2020-01-27T03:44:54Z)
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.