1
program role
2
organizing roles
1
leadership role
65
collaborators
2006–2026
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
10 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Experimental Private Quantum Sensing | QCRYPT 2025 | regular | Nicolas Laurent-Puig, Laura Dos Santos Martins, Luis Bugalho, Santiago Scheiner, Majid Hassani, Sean Moore, Eleni Diamanti |
Quantum sensors are powerful tools for measuring physical quantities with high sensitivity, enabling, for instance, the mapping of Earth’s gravitational field , detecting very small changes of magnetic fields, or the passage of time. The underlying principle is to use a quantum state as a probe that interacts with the physical quantity of interest, thereby encoding relevant information into the state. Although individual quantum sensors may exhibit remarkable sensitivity, the precision of a certain measurement can be significantly enhanced when multiple probes are entangled. Distributed quantum sensing extends this further and leverages entanglement among spatially separated sensors, allowing them to function as a single, coherent system. This approach enables measurements across extended spatial regions, while surpassing the precision achievable by independent sensors. However, a significant challenge in a network setting is ensuring that sensors deployed across different parties serve as the necessary resources for the correct functioning of the target sensing task. This challenge has motivated the combination of quantum cryptography with quantum sensing. In this context, Shettell et al. introduced the notion of privacy for sensor networks, ensuring that, beyond the metrological advantage of cooperative estimation of a global function, parties can also maintain the privacy of their local information and control what data is accessible to others. In this work, we adopt this protocol and focus on a multi-user quantum sensor network framework to analyze the privacy aspects of this parameter estimation task, leveraging a high-quality four-party GHZ state source. |
|||
| All graph state verification protocols are composably secure | QCRYPT 2024 | regular | Léo Colisson, Raja Yehia |
Graph state verification protocols allow multiple parties to share a graph state while checking that the state is honestly prepared, even in the presence of malicious parties. Since graph states are the starting point of numerous quantum protocols, it is crucial to ensure that graph state verification protocols can safely be composed with other protocols, this property being known as composable security. Previous works conjectured that such a property could not be proven within the abstract cryptography framework: we disprove this conjecture by showing that all graph state verification protocols can be turned into a composably secure protocol with respect to the natural functionality for graph state preparation. Moreover, we show that any unchanged graph state verification protocol can also be considered as composably secure for a slightly different, yet useful, functionality. Finally, we show that these two results are optimal, in the sense that any such generic result, considering arbitrary black-box protocols, must either modify the protocol or consider a different functionality. Along the way, we show a protocol to generalize entanglement swapping to arbitrary graph states that might be of independent interest. |
|||
| Experimental Sample-Efficient Device-Independent Verification and Certification of a 4-qubit GHZ state | QCRYPT 2024 | regular | Laura Dos Santos Martins, Nicolas Laurent-Puig, Ivan Supic, Pascal Lefebvre, Eleni Diamanti |
Authentication of quantum resources is a critical tool in the development of quantum information processing protocols. In particular, the verification of quantum states is often used as a building block for communication tasks, determining whether the communicating parties can trust the resources at hand to exchange information or whether the protocol should be aborted. Self-testing methods have been used to tackle such verification tasks in a device-independent (DI) scenario. However, these approaches commonly consider the limit of large, identically and independently distributed (IID) samples, which weakens the DI claim and poses serious challenges to their experimental implementation. To address these issues, Gocanin et al. [1] developed a protocol to certify quantum states in the few-copies and non-IID regime. In this work, we adopt their protocol to experimentally demonstrate the device-independent verification of a four-photon GHZ state, produced with our compact and high-fidelity multipartite entangled photon source. |
|||
| Experimental Certification of Quantum Transmission via Bell's Theorem | QCRYPT 2023 | regular | ▸Simon Neves, Laura Dos Santos Martins, Verena Yacoub, Pascal Lefebvre, Ivan Supic, Eleni Diamanti |
Quantum transmission links are central elements in essentially all implementations of quantum information protocols. Emerging progress in quantum technologies involving such links needs to be accompanied by appropriate certification tools. In adversarial scenarios, a certification method can be vulnerable to attacks if too much trust is placed on the underlying system. Here, we propose a protocol in a device independent framework, which allows for the certification of practical quantum transmission links in scenarios where minimal assumptions are made about the functioning of the certification setup. We take in particular unavoidable transmission losses into account by modeling the link as a completely-positive trace-decreasing map. We also crucially remove the assumption of independent and identically distributed samples, which is known to be incompatible with adversarial settings. Finally, in view of the use of the certified transmitted states for follow-up applications, our protocol allows to estimate the quality of the state and does not certify the channel only. To illustrate the practical relevance and the feasibility of our protocol with currently available technology we provide an experimental implementation based on a state-of-the-art polarization entangled photon pair source in a Sagnac configuration and analyse its robustness for realistic losses and errors. |
|||
| Efficient verification of Boson Sampling | TQC 2021 | regular | ▸Ulysse Chabaud, Frédéric Grosshans, Elham Kashefi |
| Building trust for continuous variable quantum states | TQC 2020 | regular | ▸Ulysse Chabaud, Tom Douce, Frédéric Grosshans, Elham Kashefi |
In this work we develop new methods for the characterisation of continuous variable quantum states using heterodyne measurement in both the trusted and untrusted settings. First, building on quantum state tomography with heterodyne detection, we introduce a reliable method for continuous variable quantum state certication, which directly yields the elements of the density matrix of the state considered and analytical condence intervals. This method neither needs mathematical reconstruction of the data, nor discrete binning of the sample space, and uses a single Gaussian measurement setting. Second, beyond quantum state tomography and without its identical copies assumption, we promote our reliable tomography method to a general efficient protocol for verifying continuous variable pure quantum states with Gaussian measurements against fully malicious adversaries, i.e. making no assumptions whatsoever on the state generated by the adversary. These results are obtained using a new analytical estimator for the expected value of any operator acting on a continuous variable quantum state with bounded support over the Fock basis, computed with samples from heterodyne detection of the state. |
|||
| Experimental verification of multipartite entanglement in the presence of dishonest parties | QCRYPT 2015 | regular | Will McCutcheon, Anna Pappa, Bryn Bell, Alex McMillan, Andre Chailloux, Thomas Lawson, Mhlambululi Mafu, Eleni Diamanti, Iordanis Kerenidis, John Rarity, Mark Tame |
| Access Structure in Graphs in High Dimension and Application to Secret Sharing | TQC 2013 | regular | Anne Marin, Simon Perdrix |
| Geometric Entanglement of Symmetric States and the Majorana Representation | TQC 2010 | regular | Martin Aulbach, Mio Murao |
| Bounds on Classical Capacity of LOCC Quantum Channels | TQC 2006 | invited ▸ presenter | — |
30 Posters
| Title | Conference | Co-authors |
|---|---|---|
| Anonymous and private parameter estimation in networks of quantum sensors | QIP 2026 | Jarn de Jong, Santiago Scheiner, ▸Naomi Solomons, Ziad Chaoui, Anna Pappa |
| Anonymous and private parameter estimation in quantum networks | QCRYPT 2025 | Naomi Solomons, Santiago Scheiner, Jarn de Jong, Ziad Chaoui, Anna Pappa |
Quantum networks have recently generated significant interest due to enhanced functionalities and security, including offering the capability to securely calculate a linear function of several parameters which themselves remain private. This allows joint estimation of a parameter using the precision advantage of quantum sensing. In this work, we extend the functionality of previously considered schemes to allow for some subset of the network, without sharing their own private network, to carry out parameter estimation together without revealing the identities of participants, either to each other or to the rest of the network, while being guaranteed that only the relevant parties have inputted their parameter. |
||
| The power of shallow-depth Toffoli and qudit quantum circuits | TQC 2024 | Alex Bredariol Grilo, Elham Kashefi, Michael de Oliveira |
| Quantum bounds for compiled XOR games and d-outcome CHSH games | TQC 2024 | Matilde Baroni, Quoc-Huy Vu, Boris Bourdoncle, Eleni Diamanti, Ivan Supic |
| On fault-tolerant constant depth computations: generalisations and applications | TQC 2024 | Grégoire Gliniasty, Rawad Mezher |
| All graph state verification protocols are composably secure | TQC 2024 | Léo Colisson, Raja Yehia |
| Adaptivity as a key ingredient for fault-tolerant non-Clifford gates | TQC 2023 | Grégoire Gliniasty, Rawad Mezher |
| Quantum Cryptography for Quantum Metrology | QCRYPT 2022 | Nathan Shettell |
| A Cryptographic approach to Quantum Metrology | QCRYPT 2021 | Nathan Shettell, Elham Kashefi |
We derive a general framework for a quantum metrology scheme where the quantum probes are exchanged via an unsecured quantum channel. We construct two protocols for this task which offer a trade-off between difficulty of implementation and efficiency. We show that, for both protocols, a malicious eavesdropper cannot access any information regarding the unknown parameter. We further derive general inequalities regarding how the uncertainty in a resource state for quantum metrology can bias the estimate and the precision. From this, we link the effectiveness of the cryptographic part of the protocol to the effectiveness of the metrology scheme with a (potentially) malicious probe resource state. |
||
| Robust quantum metrology with explicit symmetric states | QIP 2020 | Yingkai Ouyang, Nathan Shettell |
| Quantum steering using optical hybrid continuous- and discrete-variable entanglement | QCRYPT 2019 | Adrien Cavaillès, Hanna Le Jeannic, Jeremy Raskop, Tom Darras, Giovanni Guccione, Eleni Diamanti, Julien Laurat |
| Anonymity for practical quantum networks | QCRYPT 2019 | Anupama Unnikrishnan, Ian MacFarlane, Richard Yi, Eleni Diamanti, Iordanis Kerenidis |
| Distributing Graph States Over Arbitrary Quantum Networks | TQC 2019 | Clément Meignant, Frédéric Grosshans |
| Authenticated teleportation under different trust settings | QCRYPT 2018 | Anu Unnikrishnan |
| A simple protocol for certifying graph states and applications in quantum networks | QCRYPT 2018 | Alexandra Krause |
| Continuous-Variable Sampling from Photon-Added or Photon-Subtracted Squeezed States | QIP 2018 | Ulysse Chabaud, Tom Douce, Peter Van Loock, Elham Kashefi, Giulia Ferrini |
| Efficient quantum pseudorandomness with simple graph states | QIP 2018 | Rawad Mezher, Joe Ghalbouni, Joseph Dgheim |
| Measurement based 2-qubit approximate t-designs via brickwork state quantum computation | TQC 2017 | Rawad Mezher |
| Derandomizing quantum circuits with measurement based unitary designs | QIP 2016 | Peter Turner |
| Derandomizing quantum circuits with measurement based unitary designs | TQC 2016 | Peter Turner |
| Continuous-variable instantaneous quantum computing is hard to sample | TQC 2016 | Tom Douce, Elham Kashefi, Eleni Diamanti, Thomas Coudreau, Pérola Milman, Peter Van Loock, Giulia Ferrini |
| Sharing quantum secrets over untrusted channels | QCRYPT 2014 | Anne Marin |
| Adiabatic graph-state quantum computation | QIP 2014 | Bobby Antonio, Janet Anders |
| Adversarial entanglement verification without shared reference frames. | QIP 2013 | Thomas Lawson, Anna Pappa, Iordanis Kerenidis, Eleni Diamanti |
| Sharing quantum and classical secrets | QIP 2013 | Anne Marin |
| Sharing quantum and classical secret | QCRYPT 2012 | Anne Marin |
| Reed Solomon Codes for Quantum Secret Sharing Protocols | QCRYPT 2011 | Anne Marin |
| Visual characterization of symmetric state entanglement | QIP 2011 | Martin Aulbach, Mio Murao |
| Information Flow in Secret Sharing Protocols | QIP 2010 | Elham Kashefi, Mehdi Mhalla, Simon Perdrix |
| Entanglement bounds on multiparty LOCC accessible information | QIP 2006 | — |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| QIP 2025 | program | member | — |
| TQC 2017 | organizing | chair | — |
| QCRYPT 2014 | organizing | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Eleni Diamanti | 9 |
| Elham Kashefi | 7 |
| Anne Marin | 5 |
| Anna Pappa | 4 |
| Rawad Mezher | 4 |
| Frédéric Grosshans | 3 |
| Iordanis Kerenidis | 3 |
| Ivan Supic | 3 |
| Laura Dos Santos Martins | 3 |
| Nathan Shettell | 3 |
| Santiago Scheiner | 3 |
| Tom Douce | 3 |
| Ulysse Chabaud | 3 |
| Giulia Ferrini | 2 |
| Grégoire Gliniasty | 2 |
| Jarn de Jong | 2 |
| Léo Colisson | 2 |
| Martin Aulbach | 2 |
| Mio Murao | 2 |
| Naomi Solomons | 2 |