123 citations
- École Normale Supérieure de LyonFR63 papers
- Centre National de la Recherche ScientifiqueFR34 papers
- Institut national de recherche en sciences et technologies du numériqueFR34 papers
- Lyon 1 UniversitéFR22 papers
- Laboratoire d’informatique Parallélisme Réseaux Algorithmes DistribuésFR8 papers
- Université Paris CitéFR6 papers
- École PolytechniqueFR5 papers
- Institut de Recherche en Informatique FondamentaleFR5 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR5 papers
- Laboratoire d'Informatique de GrenobleFR5 papers
- LIP6FR5 papers
- Université de Versailles Saint-Quentin-en-YvelinesFR4 papers
9 papers · 1 filter
Fault-tolerant quantum computation with constant overhead for general noise
Matthias Christandl, Omar Fawzi, Ashutosh Goswami
Fault-tolerant quantum computation traditionally incurs substantial resource overhead, with both qubit and time overheads scaling polylogarithmically with the size of the computati…
Learning and certification of local time-dependent quantum dynamics and noise
Daniel Stilck França, Tim Möbus, Cambyse Rouzé +1
Hamiltonian learning protocols are essential tools to benchmark quantum computers and simulators. Yet rigorous methods for time-dependent Hamiltonians and Lindbladians remain scarc…
Certifying and learning quantum Ising Hamiltonians
Andreas Bluhm, Matthias C. Caro, Francisco Escudero Gutiérrez +2
In this work, we study the problems of certifying and learning quantum Ising Hamiltonians. Our main contributions are as follows: Certification of Ising Hamiltonians. We show that…
A Unified Toolbox for Multipartite Entanglement Certification
Ye-Chao Liu, Jannis Halbey, Sebastian Pokutta +1
We present a unified framework for multipartite entanglement characterization based on the conditional gradient (CG) method, incorporating both fast heuristic detection and rigorou…
Cryptography from Lossy Reductions: Towards OWFs from ETH, and Beyond
Pouria Fallahpour, Alex B. Grilo, Garazi Muguruza +1
One-way functions (OWFs) form the foundation of modern cryptography, yet their unconditional existence remains a major open question. In this work, we study this question by explor…
Proof Assistants for Teaching: a Survey
Frédéric Tran Minh, Laure Gonnord, Julien Narboux
In parallel to the ever-growing usage of mechanized proofs in diverse areas of mathematics and computer science, proof assistants are used more and more for education. This paper s…