mikevasmer / sweep-decoder-boundaries

C++ implementation of the sweep rule decoder for topological quantum codes with boundaries.

Sweep-Decoder-Boundaries

C++ implementation of the sweep decoder for topological quantum codes with and without boundaries. See https://arxiv.org/abs/2004.07247 and https://arxiv.org/abs/1809.10145.

Build instructions

Use CMake to build. During the build process CMake will automatically download googletest and pcg-cpp. Tested on Linux (Ubuntu 16.04 & 18.04) and macOS.

Step-by-step instructions

• mkdir build && cd build
• cmake -DCMAKE_BUILD_TYPE=Release ../
• make

To run the tests

• mkdir build && cd build
• cmake -DCMAKE_BUILD_TYPE=Debug ../
• make
• make test

Usage

• The python script data_generator.py is the entry_point
• Run python data_generator.py --help for information
• See example_script.py for an example of a bigger run

Lattice models

• Interactive models of the L=3 cubic and rhombic-dodecahedral lattices are included in the models directory
• To open the files, use vZome

sweep-decoder-boundaries's Issues

Improve output from python script

Current output is clunky and contains lots of unnecessary information

Fix cubic toric

Output for p=q=0.01 N=1024 should be basically no logical error, that isn't what is currently happening.
Threshold with direction change should be ~1.7%.

Simplify process of finding sweep edges for cubic surface code

• The rule is symmetric wrt the three edges, so the decoder doesn't need to know what the edge types (i.e. 'x', 'y', '-z' etc.) are.
• All we need are the indices of the edges that need to be checked for that vertex.

Store error as vector<int>?

• Maybe this would be faster than using a set