-
Notifications
You must be signed in to change notification settings - Fork 3
This is a simulation of optimal decoder for Kitaev's Toric Codes, written in C++. The optimal toric decoder has a theoretical threshold of 11%. Through this simulation, I have successfully verified the threshold of 11%. This was done as a part of my MTech thesis at IIT Madras.
amitanilkulkarni/kitaev-toric-decoder
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
---------------------------------------------------------------------- CSS SURFACE CODES : DECODER SIMULATION FOR SQUARE LATTICE ---------------------------------------------------------------------- AMIT A KULKARNI (EE11B069) DEPARTMENT OF ELECTRICAL ENGG IIT MADRAS, CHENNAI ---------------------------------------------------------------------- 1) REQUIRED PACKAGES AND SYSTEM To compile the code, the following packages must be installed: gcc Version should support C++11 (tested on v5.3) openmp LLVM OpenMP Runtime Library (tested on v3.7) boost For boost graph libraries (tested on v1.60) gsl GNU Scientific Library (tested on v2.1) BLOSSOM-V Check README_FIRST.txt in ./blossom/ 2) COMPILATION For toric decoder simulation : make decoder For square octagonal decoder : make sqoct To clean the compiled files : make clean Before building the code, it is recommended to clean the present object files using 'make clean'. 3) USAGE A) Toric code decoder simulation: ./surface_decoder [L] [P_START] [P_END] [P_STEP] [NUM_THREADS] Example: ./surface_decoder 8 0.05 0.18 0.02 12 Where, L = Dimension of the square lattice (LxL) P_START = Starting point of error probability P_END = End point of error probability P_STEP = Step between values of error probability NUM_THREADS = Number of process threads. Optimal is $(nproc). B) Square octagonal decoder simulation: ./square_octagonal
About
This is a simulation of optimal decoder for Kitaev's Toric Codes, written in C++. The optimal toric decoder has a theoretical threshold of 11%. Through this simulation, I have successfully verified the threshold of 11%. This was done as a part of my MTech thesis at IIT Madras.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published