https://mikevasmer.github.io/
🗣️ David Aasen (Microsoft)
📜 A Topologically Fault-Tolerant Quantum Computer with Four Dimensional Geometric Codes
⏰ Weds 5 November 5pm (Paris)
Mailing list
sympa.inria.fr/sympa/subscr...
🗣️ David Aasen (Microsoft)
📜 A Topologically Fault-Tolerant Quantum Computer with Four Dimensional Geometric Codes
⏰ Weds 5 November 5pm (Paris)
Mailing list
sympa.inria.fr/sympa/subscr...
🗣️ Guanyu Zhu (IBM)
📜 Topology for qLDPC: Transversal non-Clifford gates and magic state fountain on homological product codes
⏰ Weds 22 October 5pm (Paris)
Mailing list
sympa.inria.fr/sympa/subscr...
🗣️ Guanyu Zhu (IBM)
📜 Topology for qLDPC: Transversal non-Clifford gates and magic state fountain on homological product codes
⏰ Weds 22 October 5pm (Paris)
Mailing list
sympa.inria.fr/sympa/subscr...
Are you interested in hosting a future QEC conf?
We are looking for detailed bids for QEC27 over the next month (provisional deadline 21st November). For more info: DM or email me.
QEC26 will be in Santa Barbara
Are you interested in hosting a future QEC conf?
We are looking for detailed bids for QEC27 over the next month (provisional deadline 21st November). For more info: DM or email me.
QEC26 will be in Santa Barbara
big thanks to Larry and Nouedyn, who led this cool project ❄️
we have also written a short blogpost about it www.iceberg-quantum.com/blog/fast-su...
comments welcome 🧊
big thanks to Larry and Nouedyn, who led this cool project ❄️
we have also written a short blogpost about it www.iceberg-quantum.com/blog/fast-su...
comments welcome 🧊
arxiv.org/abs/2509.19441
Our new quantum algorithm solves a structured state discrimination problem which is central for quantum algorithm based on Regev's reduction (like DQI).
1/3
arxiv.org/abs/2509.19441
Our new quantum algorithm solves a structured state discrimination problem which is central for quantum algorithm based on Regev's reduction (like DQI).
1/3
An example about quantum Tanner codes #qLDPC
Working with qudits (d=5) lets you use nice local codes [4,2,3]_5. Then the idea is simply to enumerate small groups and (1/4)
An example about quantum Tanner codes #qLDPC
Working with qudits (d=5) lets you use nice local codes [4,2,3]_5. Then the idea is simply to enumerate small groups and (1/4)
Fault-tolerant Transformation of Spacetime Codes, a collaboration w/ @vasmer.bsky.social, Austin Daniel & Ilan Tzitrin, which started during my internship @xanaduai.bsky.social
scirate.com/arxiv/2509.0...
Let's now see if I can summarize 101 pages (🙈) in a few tweets (and memes!)
Fault-tolerant Transformation of Spacetime Codes, a collaboration w/ @vasmer.bsky.social, Austin Daniel & Ilan Tzitrin, which started during my internship @xanaduai.bsky.social
scirate.com/arxiv/2509.0...
Let's now see if I can summarize 101 pages (🙈) in a few tweets (and memes!)
Join me and the QAT team at ENS & INRIA Paris — flexible start date.
Details here 👉 recrutement.inria.fr/public/class... or feel free to reach out!
Join me and the QAT team at ENS & INRIA Paris — flexible start date.
Details here 👉 recrutement.inria.fr/public/class... or feel free to reach out!
qec25.yalepages.org
qec25.yalepages.org
The team @qip2025.bsky.social has uploaded the QIPv2025 talks
www.youtube.com/@QIP2025
Enjoy rewatching your favorites!
The team @qip2025.bsky.social has uploaded the QIPv2025 talks
www.youtube.com/@QIP2025
Enjoy rewatching your favorites!
arxiv.org/abs/2507.11536
arxiv.org/abs/2507.11536
uwaterloo.ca/institute-fo...
But the Fock space is huge, esp. if you consider multimode encodings, and there are many great codes waiting to be found (1/4)
But the Fock space is huge, esp. if you consider multimode encodings, and there are many great codes waiting to be found (1/4)
arxiv.org/abs/2504.19966
a thread:
arxiv.org/abs/2504.19966
a thread:
@snf-fns-ch.bsky.social
(4/4)
arxiv.org/abs/2503.21773
It's about quasiprobabilistic algorithms to simulate quantum circuits - not just on classical computers, but also on restricted quantum computers.
(1/4)
arxiv.org/abs/2503.21773
It's about quasiprobabilistic algorithms to simulate quantum circuits - not just on classical computers, but also on restricted quantum computers.
(1/4)