Error-correcting codes for fermionic quantum simulation

• URL: http://arxiv.org/abs/2210.08411v5
• Date: Fri, 29 Dec 2023 18:31:09 GMT
• Title: Error-correcting codes for fermionic quantum simulation
• Authors: Yu-An Chen, Alexey V. Gorshkov, and Yijia Xu
• Abstract summary: We present methodologies for fermions via qubit systems on a two-dimensional lattice algorithm. We identify a family of stabilizer codes suitable for fermion simulation. Our method can increase the code distances without decreasing the (fermionic) code rate.
• Score: 4.199246521960609
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Utilizing the framework of $\mathbb{Z}_2$ lattice gauge theories in the context of Pauli stabilizer codes, we present methodologies for simulating fermions via qubit systems on a two-dimensional square lattice. We investigate the symplectic automorphisms of the Pauli module over the Laurent polynomial ring. This enables us to systematically increase the code distances of stabilizer codes while fixing the rate between encoded logical fermions and physical qubits. We identify a family of stabilizer codes suitable for fermion simulation, achieving code distances of $d=2,3,4,5,6,7$, allowing correction of any $\lfloor \frac{d-1}{2} \rfloor$-qubit error. In contrast to the traditional code concatenation approach, our method can increase the code distances without decreasing the (fermionic) code rate. In particular, we explicitly show all stabilizers and logical operators for codes with code distances of $d=3,4,5$. We provide syndromes for all Pauli errors and invent a syndrome-matching algorithm to compute code distances numerically.

Related papers

• 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)
• Encoding Majorana codes [0.0]
  Majorana codes are special since any gates that transform such codes must preserve fermionic parity. We present an algorithm that uses the stabilizer matrix to compute unitary encoding circuits for Majorana codes.
  arXiv  Detail & Related papers  (2024-02-12T17:35:57Z)
• Extracting topological orders of generalized Pauli stabilizer codes in two dimensions [5.593891873998947]
  We introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems. The algorithm applies to $mathbbZ_d$ qudits, including instances where $d$ is a nonprime number.
  arXiv  Detail & Related papers  (2023-12-18T13:18:19Z)
• 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)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• 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)
• Avoiding coherent errors with rotated concatenated stabilizer codes [6.85316573653194]
  We integrate stabilizer codes with constant-excitation codes by code concatenation. We analyze this code's potential as a quantum memory.
  arXiv  Detail & Related papers  (2020-10-01T16:39:21Z)
• Decoding Holographic Codes with an Integer Optimisation Decoder [0.0]
  We develop a most likely error Pauli error decoding algorithm for stabiliser codes based on general purpose integer optimisation. We analyse the performance of holographic codes against Pauli errors and find numerical evidence for thresholds against Pauli errors for bulk qubits.
  arXiv  Detail & Related papers  (2020-08-24T06:04:48Z)

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.