Related papers: Planar Floquet Codes

Planar Floquet Codes

URL: http://arxiv.org/abs/2110.05348v2
Date: Tue, 14 Dec 2021 13:06:35 GMT
Title: Planar Floquet Codes
Authors: Christophe Vuillot
Abstract summary: The honeycomb code is a subsystem code based on the honeycomb lattice with zero logical qubits. In this work we show a way to introduce boundaries to the system which curiously presents a rotating dynamics but has constant distance and is therefore not fault-tolerant.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: A protocol called the "honeycomb code", or generically a "Floquet code", was introduced by Hastings and Haah in \cite{hastings_dynamically_2021}. The honeycomb code is a subsystem code based on the honeycomb lattice with zero logical qubits but such that there exists a schedule for measuring two-body gauge checks leaving enough room at all times for two protected logical qubits. In this work we show a way to introduce boundaries to the system which curiously presents a rotating dynamics but has constant distance and is therefore not fault-tolerant.

Related papers

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)
Accommodating Fabrication Defects on Floquet Codes with Minimal Hardware Requirements [44.99833362998488]
Floquet codes provide good fault-tolerant characteristics while benefiting from reduced connectivity requirements in hardware. This is an under-studied issue of crucial importance for running such codes on realistic hardware. We introduce a new method of accommodating defective qubits on a wide range of two-dimensional Floquet codes.
arXiv Detail & Related papers (2024-05-24T18:00:05Z)
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)
Dynamical Logical Qubits in the Bacon-Shor Code [0.0]
Bacon-Shor code is a quantum error correcting subsystem code composed of weight 2 check operators. We show that when viewed as a Floquet code, it can additionally host several dynamical logical qubits.
arXiv Detail & Related papers (2024-03-05T19:47:02Z)
Cross-cap defects and fault-tolerant logical gates in the surface code and the honeycomb Floquet code [0.0]
Non-orientable geometry provides a new way the emergent symmetry acts on the code space. We find that the dynamics of the honeycomb Floquet code is precisely described by a condensation operator of the $mathbbZ$ gauge theory.
arXiv Detail & Related papers (2023-10-10T18:12:56Z)
Homological Quantum Rotor Codes: Logical Qubits from Torsion [47.52324012811181]
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 spherical codes [55.33545082776197]
We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
arXiv Detail & Related papers (2023-02-22T19:00:11Z)
Floquet codes without parent subsystem codes [0.0]
We propose a new class of error-correcting dynamic codes in two and three dimensions that has no explicit connection to any parent subsystem code. Unlike the honeycomb code it possesses an explicit CSS structure and its gauge checks do not form a subsystem code. We show that our dynamic protocol conserves logical information and possesses a threshold for error correction.
arXiv Detail & Related papers (2022-10-05T18:00:02Z)
Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
arXiv Detail & Related papers (2021-09-26T07:29:54Z)
Dynamically Generated Logical Qubits [0.30458514384586394]
We present a quantum error correcting code with dynamically generated logical qubits. Our measurement patterns generate logical qubits, allowing the code to act as a fault-tolerant quantum memory.
arXiv Detail & Related papers (2021-07-05T18:00:15Z)
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.