Fault-tolerant logical gates in holographic stabilizer codes are severely restricted

• URL: http://arxiv.org/abs/2103.13404v1
• Date: Wed, 24 Mar 2021 18:00:05 GMT
• Title: Fault-tolerant logical gates in holographic stabilizer codes are severely restricted
• Authors: Sam Cree, Kfir Dolev, Vladimir Calvera, and Dominic J. Williamson
• Abstract summary: We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We show that the set of stabilizerly implementable logical operations is contained in the Clifford group for sufficiently localized logical subsystems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We treat them as subsystem codes and show that the set of transversally implementable logical operations is contained in the Clifford group for sufficiently localized logical subsystems. As well as proving this concretely for several specific codes, we argue that this restriction naturally arises in any stabilizer subsystem code that comes close to capturing certain properties of holography. We extend these results to approximate encodings, locality-preserving gates, certain codes whose logical algebras have non-trivial centers, and discuss cases where restrictions can be made to other levels of the Clifford hierarchy. A few auxiliary results may also be of interest, including a general definition of entanglement wedge map for any subsystem code, and a thorough classification of different correctability properties for regions in a subsystem code.

Related papers

• Targeted Clifford logical gates for hypergraph product codes [61.269295538188636]
  We construct explicit targeted logical gates for hypergraph product codes. As a concrete example, we give logical circuits for the $[[18,2,3]]$ toric code.
  arXiv  Detail & Related papers  (2024-11-26T02:32:44Z)
• Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding [62.25533750469467]
  Low-Density Parity-Check (LDPC) codes possess several advantages over other families of codes. The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-09T12:08:56Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• Hierarchical memories: Simulating quantum LDPC codes with local gates [0.05156484100374058]
  Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories. We construct a new family of hierarchical codes, that encode a number of logical qubits K = Omega(N/log(N)2. Under conservative assumptions, we find that the hierarchical code outperforms the basic encoding where all logical qubits are encoded in the surface code.
  arXiv  Detail & Related papers  (2023-03-08T18:48:12Z)
• 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)
• 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)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Variants on Block Design Based Gradient Codes for Adversarial Stragglers [3.5661843925286574]
  gradient coding provides robustness against slow or unresponsive machines, known as stragglers, in distributed machine learning applications. Recently, Kadhe et al. proposed a gradient code based on an incomplete block design, called balanced adversarial block design (BIBD), which is shown to outperform many existing gradient codes in worst-case adversarial straggling scenarios. In this paper, we aim to overcome such limitations and construct gradient codes which exist for a wide range of parameters while retaining the superior performance of BIBD gradient codes.
  arXiv  Detail & Related papers  (2021-05-11T17:49:05Z)
• 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.