Timeline for Analytical Approximation of Pseudothreshold for Steane Code
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 13, 2022 at 17:58 | vote | accept | MatthewS1990 | ||
| Feb 11, 2022 at 23:09 | answer | added | Marco Fellous-Asiani | timeline score: 3 | |
| Feb 9, 2022 at 15:54 | comment | added | Marco Fellous-Asiani | Ok I will try to write an answer before Sunday. | |
| Feb 9, 2022 at 15:37 | comment | added | MatthewS1990 | yeah, I'd be interested in hearing such an argument. Thanks! I am not interested in the concatenated part per sé, but this may help me to reconstruct my supervisor's argument. | |
| Feb 9, 2022 at 9:51 | comment | added | Marco Fellous-Asiani | Hey. Are you still interested by an answer on this? I can give you the main idea behind how the threshold comes up in the concatenated implementation of Steane code. I don't know if it is what you have in mind? To some extent it implies the total number of gates used by the code indeed. | |
| Feb 2, 2022 at 16:24 | history | asked | MatthewS1990 | CC BY-SA 4.0 |