Homomorphic Logical Measurements

• URL: http://arxiv.org/abs/2211.03625v2
• Date: Tue, 8 Nov 2022 03:25:32 GMT
• Title: Homomorphic Logical Measurements
• Authors: Shilin Huang, Tomas Jochym-O'Connor, Theodore J. Yoder
• Abstract summary: We use the theory of covering spaces to construct homomorphic measurement protocols for arbitrary $X$- or $Z$-type logical Pauli operators. For any Calderbank-Shor-Steane (CSS) code with the appropriate ancilla code, one can avoid repetitive measurements or complicated ancilla state preparation procedures.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Shor and Steane ancilla are two well-known methods for fault-tolerant logical measurements, which are successful on small codes and their concatenations. On large quantum low-density-parity-check (LDPC) codes, however, Shor and Steane measurements have impractical time and space overhead respectively. In this work, we widen the choice of ancilla codes by unifying Shor and Steane measurements into a single framework, called homomorphic measurements. For any Calderbank-Shor-Steane (CSS) code with the appropriate ancilla code, one can avoid repetitive measurements or complicated ancilla state preparation procedures such as distillation, which overcomes the difficulties of both Shor and Steane methods. As an example, we utilize the theory of covering spaces to construct homomorphic measurement protocols for arbitrary $X$- or $Z$-type logical Pauli operators on surface codes in general, including the toric code and hyperbolic surface codes. Conventional surface code decoders, such as minimum-weight perfect matching, can be directly applied to our constructions.

Related papers

• Entangling logical qubits without physical operations [32.39799715470528]
  We introduce phantom codes-quantum error-correcting codes that realize entangling gates between all logical qubits in a code block purely through relabelling of physical qubits during compilation.<n>Our work establishes phantom codes as a viable architectural route to fault-tolerant quantum computation with scalable benefits for workloads with dense local entangling structure.
  arXiv  Detail & Related papers  (2026-01-28T19:00:00Z)
• Is Compression Really Linear with Code Intelligence? [60.123628177110206]
  textitFormat Annealing is a lightweight, transparent training methodology designed to assess the intrinsic capabilities of pre-trained models equitably.<n>Our empirical results reveal a fundamental logarithmic relationship between measured code intelligence and bits-per-character (BPC)<n>Our work provides a more nuanced understanding of compression's role in developing code intelligence and contributes a robust evaluation framework in the code domain.
  arXiv  Detail & Related papers  (2025-05-16T16:59:14Z)
• Cylindrical and Möbius Quantum Codes for Asymmetric Pauli Errors [8.62986288837424]
  In quantum information systems, one type of Pauli error, such as phase-flip errors, may occur more frequently than others, like bit-flip errors. For this reason, quantum error-correcting codes that handle asymmetric errors are critical to mitigating the impact of such impairments. These include variants of surface codes like the XZZX and ZZZY surface codes, tailored to preserve quantum information in the presence of error asymmetries.
  arXiv  Detail & Related papers  (2025-02-26T12:34:33Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Fault-tolerant logical measurements via homological measurement [0.14999444543328289]
  homological measurement is a framework for measuring the logical Pauli operators encoded in CSS stabilizer codes. We develop a specific protocol for fault-tolerant measurement of arbitrary logical Pauli operators of general qLDPC codes.
  arXiv  Detail & Related papers  (2024-10-03T17:58:20Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory [0.6144680854063939]
  We present a new family of quantum low-density parity-check codes, which we call radial codes. In simulations of circuit-level noise, we observe comparable error suppression to surface codes of similar distance. Their error correction capabilities, tunable parameters and small size make them promising candidates for implementation on near-term quantum devices.
  arXiv  Detail & Related papers  (2024-06-20T16:08:06Z)
• The Physics of (good) LDPC Codes I. Gauging and dualities [0.03922370499388702]
  Low-depth parity check (LDPC) codes are a paradigm of error correction that allow for spatially non-local interactions between (qu)bits. These codes can give rise to good codes'' that combine a finite encoding rate with an optimal scaling of the code distance. We show that all known examples of good quantum LDPC codes are obtained by gauging locally testable classical codes.
  arXiv  Detail & Related papers  (2023-10-24T17:47:06Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code. We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• CSS code surgery as a universal construction [51.63482609748332]
  We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes. We describe code surgery between such codes using a specific colimit in the category of chain complexes.
  arXiv  Detail & Related papers  (2023-01-31T16:17:25Z)
• Quantum error correction with higher Gottesman-Kitaev-Preskill codes: minimal measurements and linear optics [0.0]
  We propose two schemes to obtain Gottesman-Kitaev-Preskill (GKP) error syndromes by means of linear optical operations, homodyne measurements and GKP ancillae. For a concatenation of GKP codes with a stabilizer code only $2n$ measurements are needed in order to obtain the complete syndrome information.
  arXiv  Detail & Related papers  (2021-10-11T14:35:07Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Between Shor and Steane: A unifying construction for measuring error syndromes [0.913755431537592]
  We find a unifying construction that generates a family of ancilla blocks that interpolate between Shor and Steane. This family increases the complexity of ancilla construction in exchange for reducing the rounds of measurement required to fault-tolerantly measure the error. Our method can be applied to any Calderbank-Shor-Steane codes and presents a new direction for optimizing fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2020-12-31T02:30:25Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)

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.