Correlated decoding of logical algorithms with transversal gates

• URL: http://arxiv.org/abs/2403.03272v1
• Date: Tue, 5 Mar 2024 19:13:32 GMT
• Title: Correlated decoding of logical algorithms with transversal gates
• Authors: Madelyn Cain, Chen Zhao, Hengyun Zhou, Nadine Meister, J. Pablo Bonilla Ataides, Arthur Jaffe, Dolev Bluvstein, Mikhail D. Lukin
• Abstract summary: We show that logical algorithms can be substantially improved by decoding qubits jointly to account for physical error propagation during entangling gates. By considering deep logical Clifford circuits, we find that correlated decoding can significantly improve the space-time cost by reducing the number of rounds of noisy syndrome extraction per gate.
• Score: 3.8093449003779667
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation of logical qubits using transversal gates (Bluvstein et al., Nature 626, 58-65 (2024)), we show that the performance of logical algorithms can be substantially improved by decoding the qubits jointly to account for physical error propagation during transversal entangling gates. We find that such correlated decoding improves the performance of both Clifford and non-Clifford transversal entangling gates, and explore two decoders offering different computational runtimes and accuracies. By considering deep logical Clifford circuits, we find that correlated decoding can significantly improve the space-time cost by reducing the number of rounds of noisy syndrome extraction per gate. These results demonstrate that correlated decoding provides a major advantage in early fault-tolerant computation, and indicate it has considerable potential to reduce the space-time cost in large-scale logical algorithms.

Related papers

• Ion-Trap Chip Architecture Optimized for Implementation of Quantum Error-Correcting Code [5.89889361990138]
  We propose a new ion-trap optimized architecture for the efficient execution of both gate and non-transversal operations. By differentiating the regions for gates from those for non-transversal gates and syndrome extraction, our chip layout minimizes ion shuttling and simplifies physical implementations.
  arXiv  Detail & Related papers  (2025-01-25T12:49:07Z)
• Scalable Constant-Time Logical Gates for Large-Scale Quantum Computation Using Window-Based Correlated Decoding [11.657137510701165]
  A crucial challenge of fault-tolerant quantum computing is reducing the overhead of implementing logical gates. We propose an architecture that employs delayed fixup circuits and window-based correlated decoding. This design significantly reduces both the frequency and duration of decoding, while maintaining support for constant-time and universal logical gates.
  arXiv  Detail & Related papers  (2024-10-22T12:44:41Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• High Precision Fault-Tolerant Quantum Circuit Synthesis by Diagonalization using Reinforcement Learning [0.8341988468339112]
  Empirical search-based synthesis methods can generate good implementations for a more extensive set of unitaries. We leverage search-based methods to reduce the general unitary synthesis problem to one of diagonal unitaries. On a subset of algorithms of interest for future term applications, diagonalization can reduce T gate counts by up to 16.8%.
  arXiv  Detail & Related papers  (2024-08-31T12:10:32Z)
• Error correction of transversal CNOT gates for scalable surface code computation [0.37282630026096597]
  A controlled-NOT (tCNOT) gate introduces correlated errors across the code blocks. We examine and benchmark the performance of three different decoding strategies for the tC for scalable, fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2024-08-02T17:09:08Z)
• Algorithmic Fault Tolerance for Fast Quantum Computing [37.448838730002905]
  We show that fault-tolerant logical operations can be performed with constant time overhead for a broad class of quantum codes. We prove that the deviation from the ideal measurement result distribution can be made exponentially small in the code distance. Our work sheds new light on the theory of fault tolerance, potentially reducing the space-time cost of practical fault-tolerant quantum computation by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-25T15:43:25Z)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• 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)
• 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)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.