Logical blocks for fault-tolerant topological quantum computation

• URL: http://arxiv.org/abs/2112.12160v2
• Date: Thu, 13 Apr 2023 06:44:35 GMT
• Title: Logical blocks for fault-tolerant topological quantum computation
• Authors: Hector Bombin, Chris Dawson, Ryan V. Mishmash, Naomi Nickerson, Fernando Pastawski, Sam Roberts
• Abstract summary: 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.
• Score: 55.41644538483948
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Logical gates constitute the building blocks of fault-tolerant quantum computation. While quantum error-corrected memories have been extensively studied in the literature, explicit constructions and detailed analyses of thresholds and resource overheads of universal logical gate sets have so far been limited. In this paper, we present a comprehensive framework for universal fault-tolerant logic motivated by the combined need for platform-independent logical gate definitions, flexible and scalable tools for numerical analysis, and exploration of novel schemes for universal logic that improve resource overheads. Central to our framework is the description of logical gates holistically in a way which treats space and time on a similar footing. Focusing on schemes based on surface codes, we introduce explicit, but platform-independent representations of topological logic gates -- called logical blocks -- and generate new, overhead-efficient methods for universal quantum computation. As a specific example, we propose fault-tolerant schemes based on surface codes concatenated with more general low-density parity check (LDPC) codes. The logical blocks framework enables a convenient mapping from an abstract description of the logical gate to a precise set of physical instructions for both circuit-based and fusion-based quantum computation (FBQC). Using this, we numerically simulate a surface-code-based universal gate set implemented with FBQC, and verify that their thresholds are consistent with the bulk memory threshold. We find that boundaries, defects, and twists can significantly impact the logical error rate scaling, with periodic boundary conditions potentially halving the resource requirements. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme based on the teleportation of twists that may offer further resource reductions.

Related papers

• Integrating Window-Based Correlated Decoding with Constant-Time Logical Gates for Large-Scale Quantum Computation [11.657137510701165]
  One crucial issue of fault-tolerant quantum computing is reducing the overhead of implementing gates. Recently proposed correlated decoding and algorithmic fault tolerance" achieve fast universality gates. This approach is incompatible with window-based decoding, which is a natural requirement for handling large-scale circuits.
  arXiv  Detail & Related papers  (2024-10-22T12:44:41Z)
• Demonstrating a universal logical gate set on a superconducting quantum processor [13.391691829693226]
  Fault-tolerant quantum computing (FTQC) is essential for achieving large-scale practical quantum computation. Here, we experimentally implement logical CNOT gate as well as arbitrary single-qubit rotation gates on distance-2 surface codes using the superconducting quantum processor Wutextkong. In the experiment, we design encoding circuits to prepare the required logical states, where fidelities of the fault-tolerantly prepared logical states surpass those of the physical states.
  arXiv  Detail & Related papers  (2024-05-15T02:04:34Z)
• Modeling Hierarchical Reasoning Chains by Linking Discourse Units and Key Phrases for Reading Comprehension [80.99865844249106]
  We propose a holistic graph network (HGN) which deals with context at both discourse level and word level, as the basis for logical reasoning. Specifically, node-level and type-level relations, which can be interpreted as bridges in the reasoning process, are modeled by a hierarchical interaction mechanism.
  arXiv  Detail & Related papers  (2023-06-21T07:34:27Z)
• Strategies for practical advantage of fault-tolerant circuit design in noisy trapped-ion quantum computers [1.3974342259149322]
  We describe the recent demonstration of a fault-tolerant universal gate set in a trapped-ion quantum computer. We show that various criteria to assess the break-even point for fault-tolerant quantum operations are within reach for the ion trap quantum computing architecture.
  arXiv  Detail & Related papers  (2023-01-24T14:01:48Z)
• A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
  Faults are by nature while most man-made systems, and especially computers, work deterministically. This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
  arXiv  Detail & Related papers  (2022-09-08T17:55:30Z)
• Discourse-Aware Graph Networks for Textual Logical Reasoning [142.0097357999134]
  Passage-level logical relations represent entailment or contradiction between propositional units (e.g., a concluding sentence) We propose logic structural-constraint modeling to solve the logical reasoning QA and introduce discourse-aware graph networks (DAGNs) The networks first construct logic graphs leveraging in-line discourse connectives and generic logic theories, then learn logic representations by end-to-end evolving the logic relations with an edge-reasoning mechanism and updating the graph features.
  arXiv  Detail & Related papers  (2022-07-04T14:38:49Z)
• Partitioning qubits in hypergraph product codes to implement logical gates [0.0]
  Transversal gates are the simplest type of fault-tolerant logical gates. We show that gates can be used as the basis for universal quantum computing on LDPC codes.
  arXiv  Detail & Related papers  (2022-04-22T16:45:19Z)
• Relaxation times do not capture logical qubit dynamics [50.04886706729045]
  We show that spatial noise correlations can give rise to rich and counter-intuitive dynamical behavior of logical qubits. This work will help to guide and benchmark experimental implementations of logical qubits.
  arXiv  Detail & Related papers  (2020-12-14T19:51:19Z)
• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes [0.0]
  Quantum computers should have both universal and fault-tolerant logic gates. A number of no-go theorems constrain the ways in which a set of fault-tolerant logic gates can be universal. We present a general framework for universal fault-tolerant logic with stabiliser codes. We show how non-unitary implementations of logic gates provide a general approach to circumvent the no-go theorem.
  arXiv  Detail & Related papers  (2020-12-09T19:01:07Z)
• An Integer Linear Programming Framework for Mining Constraints from Data [81.60135973848125]
  We present a general framework for mining constraints from data. In particular, we consider the inference in structured output prediction as an integer linear programming (ILP) problem. We show that our approach can learn to solve 9x9 Sudoku puzzles and minimal spanning tree problems from examples without providing the underlying rules.
  arXiv  Detail & Related papers  (2020-06-18T20:09:53Z)

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.