Error-mitigated initialization of surface codes with non-Pauli stabilizers

• URL: http://arxiv.org/abs/2411.06407v2
• Date: Sat, 16 Nov 2024 03:23:00 GMT
• Title: Error-mitigated initialization of surface codes with non-Pauli stabilizers
• Authors: Zhi-Cheng He, Zheng-Yuan Xue,
• Abstract summary: We enhance the performance of the conventional surface code by incorporating non-Pauli stabilizers. We demonstrate the ability to entangle logical qubits in non-Pauli and Pauli bases via the lattice surgery technique.
• Score: 1.5688934168773208
• License:
• Abstract: Quantum error correction represents a significant milestone in large-scale quantum computing, with the surface code being a prominent strategy due to its high error threshold and experimental feasibility. However, it is challenging to implement non-Clifford logical gates in a fault-tolerant way with low overhead, through the conventional magic state distillation technique. Here, we enhance the performance of the conventional surface code by incorporating non-Pauli stabilizers and introduce two innovative initialization protocols. Our approach enhances the fidelity of the initialization of non-Clifford logical state by avoiding unprotected operations before the encoding process. This improved fidelity of the initialization of non-Clifford logical states reduces the necessary number of logical qubits for precise state distillation, ultimately decreasing the overall resource overhead. Furthermore, we demonstrate the ability to entangle logical qubits in non-Pauli and Pauli bases via the lattice surgery technique. This integration enables the use of Pauli-based surface codes for computation while non-Pauli codes are employed for auxiliary qubit initialization, thus compatible with the conventional wisdom of logical Clifford operation based on the Pauli-based surface code.

Related papers

• High-fidelity initialization a logical qubit with multiple injections [1.5688934168773208]
  We introduce a continuous fault-tolerant scheme for non-Clifford logical gates via multiple injections. Compared to previous efforts, our protocol significantly alleviates the challenges associated with a large code distance.
  arXiv  Detail & Related papers  (2025-02-05T05:37:57Z)
• Transversal Injection: Using the Surface Code to Prepare Non-Pauli Eigenstates [37.94431794242543]
  Quantum Error Correction (QEC) allows us to use systems with a large number of physical qubits and a favourable logical error rate. Transversal Injection is a new method of preparing logical non-Pauliigen estates that can be used as resource states for quantum computation.
  arXiv  Detail & Related papers  (2023-12-27T03:32:03Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• On Quantum-Assisted LDPC Decoding Augmented with Classical Post-Processing [1.0498337709016812]
  This paper looks into the Quadratic Unconstrained Binary Optimization (QUBO) and utilized D-Wave 2000Q Quantum Annealer to solve it. We evaluated and compared this implementation against the decoding performance obtained using Simulated Annealing (SA) and belief propagation (BP) decoding with classical computers.
  arXiv  Detail & Related papers  (2022-04-21T08:01:39Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• Value-Function-based Sequential Minimization for Bi-level Optimization [52.39882976848064]
  gradient-based Bi-Level Optimization (BLO) methods have been widely applied to handle modern learning tasks. There are almost no gradient-based methods able to solve BLO in challenging scenarios, such as BLO with functional constraints and pessimistic BLO. We provide Bi-level Value-Function-based Sequential Minimization (BVFSM) to address the above issues.
  arXiv  Detail & Related papers  (2021-10-11T03:13:39Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Logical-qubit operations in an error-detecting surface code [0.0]
  We realize a suite of logical operations on a distance-two logical qubit stabilized using repeated error detection cycles. For each type of operation, we observe higher performance for fault-tolerant variants over non-fault-tolerant variants.
  arXiv  Detail & Related papers  (2021-02-25T18:40:02Z)

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.