2023 Newman Honeycomb Jr Rumble Seat Music This is a follow up to a previous video, where i hacked together code for estimating the threshold of the honeycomb code. this time i've polished the code and am explaining and discussing it. Our results cement the honeycomb code as a promising candidate for two dimensional qubit architectures with sparse connectivity.
Honeycomb Jr Newman We made multiple changes that affect performance, and are comparing the planar honeycomb code after these changes to the periodic honeycomb code before these changes. This shows the honeycomb code is a viable error correcting code candidate for large scale quantum computer architectures, even ones that place qubits on a flat surface. Craig gidney's computer science blog by: craig gidney more: all posts, posts feed meta: about the author blog. Our results cement the honeycomb code as a promising candidate for two dimensional qubit architectures with sparse connectivity.
2023 Newman Honeycomb Jr Natural Guitars Electric Solid Body Rumble Craig gidney's computer science blog by: craig gidney more: all posts, posts feed meta: about the author blog. Our results cement the honeycomb code as a promising candidate for two dimensional qubit architectures with sparse connectivity. This paper presents improvements to the planar honeycomb code, optimizing qubit patch shapes and defining boundaries that require no additional connectivity. Contains the python code used to create the honeycomb circuits, the circuits that were generated, and the sample statistics collected from those circuits. We improve the planar honeycomb code by describing boundaries that need no additional physical connectivity, and by optimizing the shape of the qubit patch. Our results cement the honeycomb code as a promising candidate for two dimensional qubit architectures with sparse connectivity.
Honeycomb Jr Newman This paper presents improvements to the planar honeycomb code, optimizing qubit patch shapes and defining boundaries that require no additional connectivity. Contains the python code used to create the honeycomb circuits, the circuits that were generated, and the sample statistics collected from those circuits. We improve the planar honeycomb code by describing boundaries that need no additional physical connectivity, and by optimizing the shape of the qubit patch. Our results cement the honeycomb code as a promising candidate for two dimensional qubit architectures with sparse connectivity.
Comments are closed.