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
- Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.
We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.
In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
arXiv Detail & Related papers (2024-12-19T18:55:44Z) - Measurement-free code-switching for low overhead quantum computation using permutation invariant codes [6.281229317487581]
We present a measurement-free code-switching protocol for universal quantum computation.
The novel non-Clifford gates enabled by this code-switching protocol enable implementation of a universal gate set more efficient than the Clifford$+T$ gate set.
arXiv Detail & Related papers (2024-11-20T09:16:07Z) - 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) - Error Correction in Dynamical Codes [1.6317061277457001]
We ask what is the general framework for a quantum error correcting code that is defined by a sequence of measurements.
We develop an algorithm that tracks information about the error syndromes through the protocol and put that together to determine the distance of a dynamical code.
arXiv Detail & Related papers (2024-03-07T02:47:21Z) - 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) - Transversal Injection: A method for direct encoding of ancilla states
for non-Clifford gates using stabiliser codes [55.90903601048249]
We introduce a protocol to potentially reduce this overhead for non-Clifford gates.
Preliminary results hint at high quality fidelities at larger distances.
arXiv Detail & Related papers (2022-11-18T06:03:10Z) - 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.