Exact results on finite size corrections for surface codes tailored to
biased noise
- URL: http://arxiv.org/abs/2401.04008v1
- Date: Mon, 8 Jan 2024 16:38:56 GMT
- Title: Exact results on finite size corrections for surface codes tailored to
biased noise
- Authors: Yinzi Xiao, Basudha Srivastava, and Mats Granath
- Abstract summary: We study the XY and XZZX surface codes under phase-biased noise.
We show that independently estimating thresholds for the $X_L$ (phase-flip), $Y_L$, and $Z_L$ (bit-flip) logical failure rates can give a more confident threshold estimate.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The code-capacity threshold of a scalable quantum error correcting stabilizer
code can be expressed as a thermodynamic phase transition of a corresponding
Ising model with random bond-disorder. Here we study the XY and XZZX surface
codes under phase-biased noise, $p_x=p_y=p_z/(2\eta)$, with $\eta\geq 1/2$, and
total error rate $p=p_x+p_y+p_z$. By appropriately formulating the boundary
conditions, in the rotated code geometry, we find exact solutions at a special
disordered point, $p=\frac{1+\eta^{-1}}{2+\eta^{-1}}\gtrsim 0.5$, for arbitrary
odd code-distance $d$. The total logical failure rate is given by
$P_{f}=\frac{3}{4}-\frac{1}{4}e^{-2d_Z\,\text{artanh}(1/2\eta)}$, where
$d_{Z}=d^2$ and $d$ for the two codes respectively, is the effective code
distance for pure phase-flip noise. The large finite size corrections for
$d_Z<\eta$ make threshold extractions, using the total logical failure rate for
moderate code-distances, unreliable. We show that independently estimating
thresholds for the $X_L$ (phase-flip), $Y_L$, and $Z_L$ (bit-flip) logical
failure rates can give a more confident threshold estimate. Using this method
for the XZZX model with a tensor-network based decoder we find that the
thresholds converge with code distance to a single value at moderate bias
($\eta=30, 100$), corresponding to an error rate above the hashing bound. In
contrast, for larger bias the thresholds do not converge for practically
maximum-likelihood-decodable code distances (up to $d\approx 100$), leaving a
large uncertainty in the precise threshold value.
Related papers
- 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) - Logical Error Rates of XZZX and Rotated Quantum Surface Codes [9.69910104594168]
We present theoretical formulas based on recent advancements in understanding the weight distribution of stabilizer codes.
We observe that the logical error rate approaches $p_mathrmL to 10 p2$ for the rotated $[9,1,3]]$ XZZX code and $p_mathrmL to 18.3 p2$ for the $[13,1,3]]$ surface code.
Our findings demonstrate that implementing both rotation and XZZX modifications simultaneously can lead to suboptimal performance.
arXiv Detail & Related papers (2023-12-28T15:09:48Z) - Near Sample-Optimal Reduction-based Policy Learning for Average Reward
MDP [58.13930707612128]
This work considers the sample complexity of obtaining an $varepsilon$-optimal policy in an average reward Markov Decision Process (AMDP)
We prove an upper bound of $widetilde O(H varepsilon-3 ln frac1delta)$ samples per state-action pair, where $H := sp(h*)$ is the span of bias of any optimal policy, $varepsilon$ is the accuracy and $delta$ is the failure probability.
arXiv Detail & Related papers (2022-12-01T15:57:58Z) - Coherent error threshold for surface codes from Majorana delocalization [0.0]
Existing mappings assume incoherent noise, thus ignoring coherent errors due to spurious gate rotations.
We map the surface code with coherent errors, taken as $X$- or $Z$-rotations (trivial bit or phase), to a two-dimensional (2D) Ising model with complex couplings, and further to a 2D Majorana scattering network.
For both, the error-correcting phase maps explicitly show by linking 2D networks to 1D fermions, to a $mathbbZ$-trivial 2D insulator.
arXiv Detail & Related papers (2022-11-01T18:00:01Z) - Best Policy Identification in Linear MDPs [70.57916977441262]
We investigate the problem of best identification in discounted linear Markov+Delta Decision in the fixed confidence setting under a generative model.
The lower bound as the solution of an intricate non- optimization program can be used as the starting point to devise such algorithms.
arXiv Detail & Related papers (2022-08-11T04:12:50Z) - 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) - Random quantum circuits transform local noise into global white noise [118.18170052022323]
We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime.
For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially.
If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
arXiv Detail & Related papers (2021-11-29T19:26:28Z) - Optimal Robust Linear Regression in Nearly Linear Time [97.11565882347772]
We study the problem of high-dimensional robust linear regression where a learner is given access to $n$ samples from the generative model $Y = langle X,w* rangle + epsilon$
We propose estimators for this problem under two settings: (i) $X$ is L4-L2 hypercontractive, $mathbbE [XXtop]$ has bounded condition number and $epsilon$ has bounded variance and (ii) $X$ is sub-Gaussian with identity second moment and $epsilon$ is
arXiv Detail & Related papers (2020-07-16T06:44:44Z) - Maximizing Determinants under Matroid Constraints [69.25768526213689]
We study the problem of finding a basis $S$ of $M$ such that $det(sum_i in Sv_i v_i v_itop)$ is maximized.
This problem appears in a diverse set of areas such as experimental design, fair allocation of goods, network design, and machine learning.
arXiv Detail & Related papers (2020-04-16T19:16:38Z) - Curse of Dimensionality on Randomized Smoothing for Certifiable
Robustness [151.67113334248464]
We show that extending the smoothing technique to defend against other attack models can be challenging.
We present experimental results on CIFAR to validate our theory.
arXiv Detail & Related papers (2020-02-08T22:02:14Z)
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.