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.
Very nice demo and overview of the qLDPC landscape, @obliviateandsurrender !
My main concerns are about being able to understanding the topics in a self-consistent way. Because the demo is covering a wide range of topics, it naturally cannot go into full details. I think sometimes some examples could do wonders though, so suggested to add some here and there.
Qottmann
left a comment
Qottmann
left a comment
There was a problem hiding this comment.
I'm a big fan of this demo, thanks so much @obliviateandsurrender !
Went over the demo again and left some comments and remaining questions.
I'm a bit confused about the part where you first introduce the CSS code, which kinda looks like a hypergraph product code (but I guess its not?)
would be good to clarify if and how they are related and make clear the distinctions
Once addressed, I think this is good for publication
|
I think one crucial point to show / highlight is how the QLDPC codes we construct assume a non-local connectivity. Somehow visualizing this with a graph would be a super nice addition imo (could be done just with an image, or with code) |
daniela-angulo
left a comment
daniela-angulo
left a comment
There was a problem hiding this comment.
Great demo!
The structure flows really well.
I left comments.
Qottmann
left a comment
Qottmann
left a comment
There was a problem hiding this comment.
great demo @obliviateandsurrender !
just some small things left to polish, otherwise seems good to go as my major concerns are all lifted :)
daniela-angulo
left a comment
daniela-angulo
left a comment
There was a problem hiding this comment.
Just a few comments to polish minor things.
This is great work! very informative demo.
| # :math:`T^\dagger_L = T^{\otimes 15}`. | ||
| # | ||
| # However, the `Eastin-Knill theorem <https://en.wikipedia.org/wiki/Eastin%E2%80%93Knill_theorem>`_ | ||
| # restricts the set of the logical unitary product operators that can be applied transversally for |
There was a problem hiding this comment.
| # restricts the set of the logical unitary product operators that can be applied transversally for | |
| # restricts the set of logical unitary product operators that can be applied transversally for |
| # While recent breakthroughs in qLDPC codes, such as lifted product and quantum Tanner codes, | ||
| # have achieved linear distance scaling, their physical construction remains quite involved in | ||
| # practice. Furthermore, other promising candidates for | ||
| # low-overhead quantum memory, like bivariate bicycle codes, still exhibit asymptotic badness, |
There was a problem hiding this comment.
"limitations" instead of "badness"?
| "journal": "Phys. Rev. X 15, 021088", | ||
| "doi": "10.1103/PhysRevX.15.021088", | ||
| "url": "https://arxiv.org/abs/2410.02753" |
4 participants
Title: Quantum low-density parity-check (qLDPC) codes for quantum error correction
Summary: Explain the motivation, construction and decoding of various types of qLDPC codes.
Relevant references: [Will add]
Possible Drawbacks: N/A
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, and 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)