Coherent error threshold for surface codes from Majorana delocalization

• URL: http://arxiv.org/abs/2211.00655v2
• Date: Thu, 29 Jun 2023 17:57:59 GMT
• Title: Coherent error threshold for surface codes from Majorana delocalization
• Authors: Florian Venn, Jan Behrends, Benjamin B\'eri
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Statistical mechanics mappings provide key insights on quantum error correction. However, existing mappings assume incoherent noise, thus ignoring coherent errors due to, e.g., spurious gate rotations. We map the surface code with coherent errors, taken as $X$- or $Z$-rotations (replacing bit or phase flips), to a two-dimensional (2D) Ising model with complex couplings, and further to a 2D Majorana scattering network. Our mappings reveal both commonalities and qualitative differences in correcting coherent and incoherent errors. For both, the error-correcting phase maps, as we explicitly show by linking 2D networks to 1D fermions, to a $\mathbb{Z}_2$-nontrivial 2D insulator. However, beyond a rotation angle $\phi_\text{th}$, instead of a $\mathbb{Z}_2$-trivial insulator as for incoherent errors, coherent errors map to a Majorana metal. This $\phi_\text{th}$ is the theoretically achievable storage threshold. We numerically find $\phi_\text{th}\approx0.14\pi$. The corresponding bit-flip rate $\sin^2(\phi_\text{th})\approx 0.18$ exceeds the known incoherent threshold $p_\text{th}\approx0.11$.

Related papers

• Dimension-free Private Mean Estimation for Anisotropic Distributions [55.86374912608193]
  Previous private estimators on distributions over $mathRd suffer from a curse of dimensionality. We present an algorithm whose sample complexity has improved dependence on dimension.
  arXiv  Detail & Related papers  (2024-11-01T17:59:53Z)
• Statistical mechanical mapping and maximum-likelihood thresholds for the surface code under generic single-qubit coherent errors [0.0]
  We consider single-qubit coherent errors in the surface code, i.e., rotations by angle $alpha$ about an axis that can be chosen arbitrarily. We numerically establish the existence of an error-correcting phase, which we chart in a subspace of rotation axes to estimate the corresponding maximum-likelihood thresholds.
  arXiv  Detail & Related papers  (2024-10-29T18:23:23Z)
• Measuring quantum relative entropy with finite-size effect [53.64687146666141]
  We study the estimation of relative entropy $D(rho|sigma)$ when $sigma$ is known. Our estimator attains the Cram'er-Rao type bound when the dimension $d$ is fixed.
  arXiv  Detail & Related papers  (2024-06-25T06:07:20Z)
• Provably learning a multi-head attention layer [55.2904547651831]
  Multi-head attention layer is one of the key components of the transformer architecture that sets it apart from traditional feed-forward models. In this work, we initiate the study of provably learning a multi-head attention layer from random examples. We prove computational lower bounds showing that in the worst case, exponential dependence on $m$ is unavoidable.
  arXiv  Detail & Related papers  (2024-02-06T15:39:09Z)
• Exact results on finite size corrections for surface codes tailored to biased noise [0.0]
  We study the XY and XZZX surface codes under phase-biased noise. We find exact solutions at a special disordered point. We show that calculating thresholds based not only on the total logical failure rate, but also independently on the phase- and bit-flip logical failure rates, gives a more confident estimate.
  arXiv  Detail & Related papers  (2024-01-08T16:38:56Z)
• Precision of quantum simulation of all-to-all coupling in a local architecture [0.0]
  We find an analytic relation between the values $J_ij$ of the desired interaction and the parameters of the 2d circuit. For the relative error to be a constant $epsilon$, one requires an energy scale growing as $n6$ in the number of qubits. Our proof is based on the Schrieffer-Wolff transformation and generalizes to any hardware.
  arXiv  Detail & Related papers  (2023-02-05T18:54:28Z)
• Surface codes, quantum circuits, and entanglement phases [0.0]
  We map 2D surface codes under a class of incoherent or coherent errors. We find a topologically non-trivial threshold for incoherent errors and logarithmic coherent error. Results can be generalized to other fermionic circuits and may be independent interest.
  arXiv  Detail & Related papers  (2022-12-15T19:00:02Z)
• Cryptographic Hardness of Learning Halfspaces with Massart Noise [59.8587499110224]
  We study the complexity of PAC learning halfspaces in the presence of Massart noise. We show that no-time Massart halfspace learners can achieve error better than $Omega(eta)$, even if the optimal 0-1 error is small.
  arXiv  Detail & Related papers  (2022-07-28T17:50:53Z)
• Mean Estimation in High-Dimensional Binary Markov Gaussian Mixture Models [12.746888269949407]
  We consider a high-dimensional mean estimation problem over a binary hidden Markov model. We establish a nearly minimax optimal (up to logarithmic factors) estimation error rate, as a function of $|theta_*|,delta,d,n$.
  arXiv  Detail & Related papers  (2022-06-06T09:34:04Z)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• Hardness of Learning Halfspaces with Massart Noise [56.98280399449707]
  We study the complexity of PAC learning halfspaces in the presence of Massart (bounded) noise. We show that there an exponential gap between the information-theoretically optimal error and the best error that can be achieved by a SQ algorithm.
  arXiv  Detail & Related papers  (2020-12-17T16:43:11Z)

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.