46
collaborators
2015–2023
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
2 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| The Boundary for Quantum Advantage in Gaussian Boson Sampling | QIP 2022 | regular | Jacob Bulmer, Bryn Bell, Rachel Chadwick, Alex Jones, Diana Moise, Alessandro Rigazzi, Jan Thorbecke, Utz-Uwe Haus, Thomas Van Vaerenbergh, Raj Patel, Anthony Laing |
| Hybrid Quantum Networks | QCRYPT 2017 | invited ▸ presenter | — |
4 Posters
| Title | Conference | Co-authors |
|---|---|---|
| Quantum simulation of thermodynamics in an integrated quantum photonic processor | TQC 2023 | Frank Somhorst, Reinier Meer, Malaquias Correa Anguita, Riko Schadow, Henk Snijders, Michiel Goede, Ben Kassenberg, Pim Venderbosch, Caterina Taballione, Jorn Epping, Hans Vlekkert, Jardi Timmerhuis, Jacob Bulmer, Jasleen Lugani, P.W.H. Pinkse, Jens Eisert, Nathan Walk, Jelmer Renema |
| Certified Quantum Random Numbers from Untrusted Light | QCRYPT 2021 | David Drahi, Nathan Walk, Matty Hoban, Aleksey K Federov, Roman Shakhovoy, Yury Kurochkin, Akky Feimov, W Steven Kolthammer, Joshua Nunn, Jonathan Barrett |
A remarkable aspect of quantum theory is that certain measurement outcomes are entirely unpredictable to all possible observers. Such quantum events can be harnessed to generate numbers whose randomness is asserted based upon the underlying physical processes. We formally introduce, design, and experimentally demonstrate an ultrafast optical quantum random number generator that uses a totally untrusted photonic source. While considering completely general quantum attacks and using dedicated FPGA hardware for post-processing, we certify and generate in real time random numbers at a rate of 8.05 Gb/s with a composable security parameter of 10^{−10}. Composable security is the most stringent and useful security paradigm because any given protocol remains secure even if arbitrarily combined with other instances of the same, or other, protocols, thereby allowing the generated randomness to be utilized for arbitrary applications in cryptography and beyond. This work achieves the fastest generation of composably secure quantum random numbers ever reported. |
||
| Classical multiparty computation using quantum resources | QIP 2018 | Anna Pappa, Marco Clementi, Andreas Eckstein, Elham Kashefi, Stephanie Barz |
| Enhanced delegated computing using coherence | QCRYPT 2015 | Stefanie Barz, Vedran Dunjko, Florian Schlederer, Merritt Moore, Elham Kashefi |
Collaborators
| Co-author | Joint talks |
|---|---|
| Elham Kashefi | 2 |
| Jacob Bulmer | 2 |
| Nathan Walk | 2 |
| Akky Feimov | 1 |
| Aleksey K Federov | 1 |
| Alessandro Rigazzi | 1 |
| Alex Jones | 1 |
| Andreas Eckstein | 1 |
| Anna Pappa | 1 |
| Anthony Laing | 1 |
| Ben Kassenberg | 1 |
| Bryn Bell | 1 |
| Caterina Taballione | 1 |
| David Drahi | 1 |
| Diana Moise | 1 |
| Florian Schlederer | 1 |
| Frank Somhorst | 1 |
| Hans Vlekkert | 1 |
| Henk Snijders | 1 |
| Jan Thorbecke | 1 |