Implementing Logical Operators using Code Rewiring

• URL: http://arxiv.org/abs/2210.14074v2
• Date: Tue, 2 May 2023 11:05:07 GMT
• Title: Implementing Logical Operators using Code Rewiring
• Authors: Darren Banfield, Alastair Kay
• Abstract summary: We describe a method to use measurements and correction operations in order to implement the Clifford group in a stabilizer code. In particular this provides a method to implement a logical Hadamard-type gate within the 15-qubit Reed-Muller quantum code.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We describe a method to use measurements and correction operations in order to implement the Clifford group in a stabilizer code, generalising a result from [Bombin,2011] for topological subsystem colour codes. In subsystem stabilizer codes of distance at least $3$ the process can be implemented fault-tolerantly. In particular this provides a method to implement a logical Hadamard-type gate within the 15-qubit Reed-Muller quantum code by measuring and correcting only three observables. This is an alternative to the method proposed by [Paetznick and Reichardt, 2013] to generate a set of gates which is universal for quantum computing for this code. The construction is inspired by the description of code rewiring from [Colladay and Mueller, 2018].

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)
• Wire Codes [0.0]
  We introduce a recipe to transform any quantum stabilizer code into a subsystem code with related code parameters that has weight and degree three. We call the subsystem codes produced by our recipe "wire codes" Our results constitute a general method to construct low-overhead subsystem codes on general graphs.
  arXiv  Detail & Related papers  (2024-10-14T06:27:09Z)
• 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 One-Bit Addition with the Smallest Interesting Colour Code [2.5553228515450765]
  We implement a small quantum algorithm, one-qubit addition, fault-tolerantly on the Quantinuum H1-1 quantum computer. We observe arithmetic errors with a rate of $sim 1.1 times 10-3$ for the fault-tolerant circuit and $sim 9.5 times 10-3$ for the unencoded circuit.
  arXiv  Detail & Related papers  (2023-09-18T15:56:14Z)
• 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)
• Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors [0.0]
  Top color codes are widely acknowledged as promising candidates for fault-tolerant quantum computing. Top color codes can provide a universal gate set $$H, T, C$$, with the T-gate missing in the T-dimensional and the H-gate in the three-dimensional case. We construct resource-optimized deterministic and non-deterministic code switching protocols for two- and three-dimensional distance-three color codes.
  arXiv  Detail & Related papers  (2023-06-30T14:16:52Z)
• Topological error correcting processes from fixed-point path integrals [0.7873629568804646]
  We analyze and construct topological quantum error correcting codes as dynamical circuits of geometrically local channels and measurements. We derive two new error-correcting codes, namely a Floquet version of the $3+1$-dimensional toric code using only 2-body measurements, and a dynamic code based on the double-semion string-net path integral.
  arXiv  Detail & Related papers  (2023-03-29T02:32:18Z)
• 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)
• Realizing a class of stabilizer quantum error correction codes using a single ancilla and circular connectivity [0.0]
  We show that a class of "neighboring-blocks" stabilizer quantum error correction codes can be implemented in a resource-efficient manner using a single ancilla and circular near-neighbor qubit connectivity. We propose an implementation for syndrome-measurement circuits for codes from the class and illustrate its workings for cases of three-, five-, and nine-qubits stabilizer code schemes.
  arXiv  Detail & Related papers  (2022-07-27T08:25:38Z)
• 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)

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.