Non-Pauli errors can be efficiently sampled in qudit surface codes

• URL: http://arxiv.org/abs/2303.16837v1
• Date: Wed, 29 Mar 2023 16:33:06 GMT
• Title: Non-Pauli errors can be efficiently sampled in qudit surface codes
• Authors: Yue Ma, Michael Hanks, M. S. Kim
• Abstract summary: We quantify remaining correlations after syndrome measurement for a qudit 2D surface code subject to non-Pauli errors. We relate correlations to loops on the lattice using belief propagation and percolation theory.
• Score: 0.8443359047390766
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Surface codes are the most promising candidates for fault-tolerant quantum computation. Single qudit errors are typically modelled as Pauli operators, to which general errors are converted via randomizing methods. In this Letter, we quantify remaining correlations after syndrome measurement for a qudit 2D surface code subject to non-Pauli errors. Using belief propagation and percolation theory, we relate correlations to loops on the lattice. Below the error correction threshold, remaining correlations are sparse and locally constrained. Syndromes for qudit surface codes are therefore efficiently samplable for non-Pauli errors, independent of the exact forms of the error and decoder.

Related papers

• Randomized compiling in fault-tolerant quantum computation [0.0]
  We present an algorithm projecting the state of the system onto a logical state with a well-defined error. The algorithm does not significantly increase the depth of the logical circuit.
  arXiv  Detail & Related papers  (2023-06-23T19:17:34Z)
• Coherent errors and readout errors in the surface code [0.0]
  We consider the combined effect of readout errors and coherent errors on the surface code. We find a threshold for this combination of errors, with an error rate close to the threshold of the corresponding incoherent error channel.
  arXiv  Detail & Related papers  (2023-03-08T15:50:44Z)
• Concepts and conditions for error suppression through randomized compiling [0.0]
  We show that randomized compiling alters errors in three distinct helpful ways. It prevents the coherent accumulation of errors across gate cycles by destroying intercycle coherent correlations. It converts individual gate cycle errors into Pauli noise.
  arXiv  Detail & Related papers  (2022-12-14T20:45:28Z)
• Correcting non-independent and non-identically distributed errors with surface codes [0.8039067099377079]
  We develop and investigate the properties of topological surface codes adapted to a known noise structure by Clifford conjugations. We show that the surface code locally tailored to non-uniform single-qubit noise in conjunction with a scalable matching decoder yields an increase in error thresholds and exponential suppression of sub-threshold failure rates.
  arXiv  Detail & Related papers  (2022-08-03T16:21:44Z)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)
• 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)
• Efficient diagnostics for quantum error correction [0.0]
  We present a scalable experimental approach based on Pauli error reconstruction to predict the performance of codes. Numerical evidence demonstrates that our method significantly outperforms predictions based on standard error metrics for various error models.
  arXiv  Detail & Related papers  (2021-08-24T16:28:29Z)
• Tail-to-Tail Non-Autoregressive Sequence Prediction for Chinese Grammatical Error Correction [49.25830718574892]
  We present a new framework named Tail-to-Tail (textbfTtT) non-autoregressive sequence prediction. Considering that most tokens are correct and can be conveyed directly from source to target, and the error positions can be estimated and corrected. Experimental results on standard datasets, especially on the variable-length datasets, demonstrate the effectiveness of TtT in terms of sentence-level Accuracy, Precision, Recall, and F1-Measure.
  arXiv  Detail & Related papers  (2021-06-03T05:56:57Z)
• Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions [62.997667081978825]
  We present a study of crosstalk errors in a quantum-computing architecture based on a single string of ions confined by a radio-frequency trap, and manipulated by individually-addressed laser beams. This type of errors affects spectator qubits that, ideally, should remain unaltered during the application of single- and two-qubit quantum gates addressed at a different set of active qubits. We microscopically model crosstalk errors from first principles and present a detailed study showing the importance of using a coherent vs incoherent error modelling and, moreover, discuss strategies to actively suppress this crosstalk at the gate level.
  arXiv  Detail & Related papers  (2020-12-21T14:20:40Z)
• The Role of Mutual Information in Variational Classifiers [47.10478919049443]
  We study the generalization error of classifiers relying on encodings trained on the cross-entropy loss. We derive bounds to the generalization error showing that there exists a regime where the generalization error is bounded by the mutual information.
  arXiv  Detail & Related papers  (2020-10-22T12:27:57Z)
• Quantum Communication Complexity of Distribution Testing [114.31181206328276]
  Two players each receive $t$ samples from one distribution over $[n]$. The goal is to decide whether their two distributions are equal, or are $epsilon$-far apart. We show that the quantum communication complexity of this problem is $tildeO$(tepsilon2))$ qubits when distributions have low $l$-norm.
  arXiv  Detail & Related papers  (2020-06-26T09:05:58Z)

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.