53 citations
- Institut national de recherche en sciences et technologies du numériqueFR6 papers
- Centre Inria de SaclayFR3 papers
- Microsoft (United States)US3 papers
- Equipes Traitement de l'Information et SystèmesFR2 papers
- PROSECCO: Programming securely with cryptographyFR2 papers
- Alexandru Ioan Cuza UniversityRO1 paper
- Centre Inria de l'Université de LorraineFR1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- COSMIQ: Cryptologie symétrique, cryptologie fondée sur les codes et information quantiqueFR1 paper
- CY Cergy Paris UniversitéFR1 paper
- École Normale Supérieure de LyonFR1 paper
- École Normale Supérieure - PSLFR1 paper
14 papers
Fault-tolerant transformations of spacetime codes
Arthur Pesah, Austin K. Daniel, Ilan Tzitrin +1
Recent advances in quantum error-correction (QEC) have shown that it is often beneficial to understand fault-tolerance as a dynamical process, a circuit with redundant measurements…
Quantum Key Distribution with Efficient Post-Quantum Cryptography-Secured Trusted Node on a Quantum Network
Yoann Piétri, Pierre-Enguerrand Verdier, Baptiste Lacour +13
Quantum Key Distribution (QKD) enables two distant users to exchange a secret key with information-theoretic security, based on the fundamental laws of quantum physics. While it is…
Additivity and chain rules for quantum entropies via multi-index Schatten norms
Omar Fawzi, Jan Kochanowski, Cambyse Rouzé +1
The primary entropic measures for quantum states are additive under the tensor product. In the analysis of quantum information processing tasks, the minimum entropy of a set of sta…
Fast and Accurate Homomorphic Softmax Evaluation
Wonhee Cho, Guillaume Hanrot, Taeseong Kim +2
Homomorphic encryption is one of the main solutions for building secure and privacy-preserving solutions for Machine Learning as a Service. This motivates the development of homomo…
LDPC-cat codes for low-overhead quantum computing in 2D
Diego Ruiz, Jérémie Guillaud, Anthony Leverrier +2
Quantum low-density parity-check (qLDPC) codes are a promising construction for drastically reducing the overhead of fault-tolerant quantum computing (FTQC) architectures. However,…
Projective Space Stern Decoding and Application to SDitH
Kevin Carrier, Valérian Hatey, Jean-Pierre Tillich
We show that here standard decoding algorithms for generic linear codes over a finite field can speeded up by a factor which is essentially the size of the finite field by reducing…