Statistical mechanical mapping and maximum-likelihood thresholds for the surface code under generic single-qubit coherent errors

• URL: http://arxiv.org/abs/2410.22436v1
• Date: Tue, 29 Oct 2024 18:23:23 GMT
• Title: Statistical mechanical mapping and maximum-likelihood thresholds for the surface code under generic single-qubit coherent errors
• Authors: Jan Behrends, Benjamin Béri,
• Abstract summary: 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.
• Score: 0.0
• License:
• Abstract: The surface code, one of the leading candidates for quantum error correction, is known to protect encoded quantum information against stochastic, i.e., incoherent errors. The protection against coherent errors, such as from unwanted gate rotations, is however understood only for special cases, such as rotations about the $X$ or $Z$ axes. Here we consider generic single-qubit coherent errors in the surface code, i.e., rotations by angle $\alpha$ about an axis that can be chosen arbitrarily. We develop a statistical mechanical mapping for such errors and perform entanglement analysis in transfer matrix space to 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 $\alpha_\text{th}$. The classical statistical mechanics model we derive is a random-bond Ising model with complex couplings and four-spin interactions (i.e., a complex-coupled Ashkin-Teller model). The error correcting phase, $\alpha<\alpha_\text{th}$, where the logical error rate decreases exponentially with code distance, is shown to correspond in transfer matrix space to a gapped one-dimensional quantum Hamiltonian exhibiting spontaneous breaking of a $\mathbb{Z}_2$ symmetry. Our numerical results rest on two key ingredients: (i) we show that the state evolution under the transfer matrix -- a non-unitary (1+1)-dimensional quantum circuit -- can be efficiently numerically simulated using matrix product states. Based on this approach, (ii) we also develop an algorithm to (approximately) sample syndromes based on their Born probability. The $\alpha_\text{th}$ values we find show that the maximum likelihood thresholds for coherent errors are larger than those for the corresponding incoherent errors (from the Pauli twirl), and significantly exceed the values found using minimum weight perfect matching.

Related papers

• Stability and Loop Models from Decohering Non-Abelian Topological Order [0.0]
  We identify relevant statistical mechanical models for decohering non-Abelian TO. We find a remarkable stability to quantum channels which proliferate non-Abelian anyons with large quantum dimension. Our work opens up the possibility of non-Abelian TO being robust against maximally proliferating certain anyons.
  arXiv  Detail & Related papers  (2024-09-18T18:00:01Z)
• Tapestry of dualities in decohered quantum error correction codes [1.0301458191595498]
  Quantum error correction (QEC) codes protect quantum information from errors due to decoherence. Many of them also serve as prototypical models for exotic topological quantum matters. Investigating the behavior of the QEC codes under decoherence sheds light on not only the codes' robustness against errors but also new out-of-equilibrium quantum phases driven by decoherence.
  arXiv  Detail & Related papers  (2024-01-30T19:00:02Z)
• 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)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• Optimal Thresholds for Fracton Codes and Random Spin Models with Subsystem Symmetry [10.029027477019984]
  We calculate optimal error thresholds for quantum error correcting codes based on fracton models. By mapping the error-correction process for bit-flip and phase-flip noises into novel statistical models, we obtain models that exhibit an unconventional subsystem symmetry.
  arXiv  Detail & Related papers  (2021-12-09T18:56:42Z)
• Hamiltonian simulation with random inputs [74.82351543483588]
  Theory of average-case performance of Hamiltonian simulation with random initial states. Numerical evidence suggests that this theory accurately characterizes the average error for concrete models.
  arXiv  Detail & Related papers  (2021-11-08T19:08:42Z)
• Perturbative readout error mitigation for near term quantum computers [0.5156484100374058]
  Readout errors on near-term quantum computers can introduce significant error to the empirical probability distribution sampled from the output of a quantum circuit. We modify standard matrix techniques using two perturbative approximations with significantly reduced complexity and bounded error. These approximate techniques for readout error correction may greatly accelerate near term quantum computing applications.
  arXiv  Detail & Related papers  (2021-05-17T21:01:31Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• A Random Matrix Analysis of Random Fourier Features: Beyond the Gaussian Kernel, a Precise Phase Transition, and the Corresponding Double Descent [85.77233010209368]
  This article characterizes the exacts of random Fourier feature (RFF) regression, in the realistic setting where the number of data samples $n$ is all large and comparable. This analysis also provides accurate estimates of training and test regression errors for large $n,p,N$.
  arXiv  Detail & Related papers  (2020-06-09T02:05:40Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.