Conversation
|
👋 Hey, looks like you've updated some demos! 🐘 Don't forget to update the Please hide this comment once the field(s) are updated. Thanks! |
Your preview is ready 🎉!You can view your changes here
|
Qottmann
left a comment
Qottmann
left a comment
There was a problem hiding this comment.
Had a brief first read, looks very nice overall!
My main feedback is that while the content itself is great, the start after the abstract is a bit steep, and could potentially could be better motivated by providing some big picture context and anticipate what is going to happen in the demo
@Qottmann Added these to the introduction, along with a figure for surface code, to better help readers visualize the function. |
which function are you referring to? I think it could be nice to anticipate these diagrams and what they mean already in the abstract/intro i.e. creating a hand-drawn mock of them and explaining the different regions and what these diagrams say |
| # Circuit 1: |+...+⟩ -> noise -> measure X-stabs + X-logical (Z-error syndrome) | ||
| # Circuit 2: |0...0⟩ -> noise -> measure Z-stabs + Z-logical (X-error syndrome) | ||
| z_stab_res = np.column_stack(syndrome_circuit(x_meas_ops, x_basis=True)) | ||
| x_stab_res = np.column_stack(syndrome_circuit(z_meas_ops, x_basis=False)) |
There was a problem hiding this comment.
Are these lines consistent?
| # | ||
| # D. Aharonov, M. Ben-Or, | ||
| # "Fault-Tolerant Quantum Computation With Constant Error Rate", | ||
| # `SIAM J. Comput., 38(4), 1207–1282 <https://arxiv.org/abs/quant-ph/9906129>`__, 2008. |
| # | ||
| # A. G. Fowler, M. Mariantoni, J. M. Martinis, A. N. Cleland, | ||
| # "Surface codes: Towards practical large-scale quantum computation", | ||
| # `Phys. Rev. A 86, 032324 <https://arxiv.org/abs/1208.0928>`__, 2012. |
| # | ||
| # O. Higgott, | ||
| # "PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching", | ||
| # `ACM Trans. Quantum Comput. 3(3), 1–16 <https://arxiv.org/abs/2105.13082>`__, 2022. |
3 participants
Title: Understanding Fault-tolerant Threshold Theorem in Practice
Summary: A hands-on guide to understanding the fault-tolerant threshold theorem and simulating surface code pseudo-thresholds.
Relevant references:
Possible Drawbacks:
Related GitHub Issues:
If you are writing a demonstration, please answer these questions to facilitate the marketing process.
GOALS — Why are we working on this now?
Eg. Promote a new PL feature or show a PL implementation of a recent paper.
AUDIENCE — Who is this for?
Eg. Chemistry researchers, PL educators, beginners in quantum computing.
KEYWORDS — What words should be included in the marketing post?
Which of the following types of documentation is most similar to your file?
(more details here)