25
collaborators
2014–2026
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
1 Talk
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Robust Bell Inequalities from Communication Complexity | TQC 2016 | regular | Sophie Laplante, Mathieu Lauriere, Alexandre Nolin, Jeremie Roland |
11 Posters
| Title | Conference | Co-authors |
|---|---|---|
|
Deterministic randomness extraction for quantum random number generation with partial trust ↗
|
QCRYPT 2026 | Pablo Tikas Pueyo, Tomás Fernández Martos |
It is a well-known fact in classical information theory that no deterministic procedure can extract close-to-ideal randomness from an arbitrary entropy source. On the other hand, if additional knowledge about the source is available—e.g., that it is a sequence of independent Bernoulli trials—then deterministic extractors do exist. For quantum entropy sources, where in addition to classical random variables we consider quantum side information, the use of extra knowledge about their structure was pioneered in a recent publication [C. Foreman and L. Masanes, Quantum 9, 1654 (2025)]. In that work, the authors provide deterministic extractors for device-independent randomness generation with memoryless devices achieving a sufficiently high CHSH score. In this work, we port their construction to the prepare-and-measure scenario. Specifically, we prove that the considered functions are also extractors for memoryless devices in settings with partial trust, either in the state preparation or in the measurement, as well as in a semi-device-independent setting under an overlap assumption on the prepared quantum states. Within this last setting, we simulate the resulting randomness generation protocol on a novel and experimentally relevant family of behaviors, observing positive key rates already for 7x10^3 rounds. |
||
| An SDP formulation for the device-dependent guessing probability | QCRYPT 2026 | Raffaele D'Avino, Aurora Mugnai, Miguel Navascués, Antonio Acin |
In a previous work [Senno et al., Phys. Rev. Lett. 131, 130202 (2023)], we provided a framework to quantify the amount of intrinsic randomness produced by characterized but untrusted prepare-and-measure (P\&M) setups. While the cases of pure state preparations or extremal measurements were shown to be defined by semidefinite programs (SDPs), up until now we were missing computational methods for the general scenario of mixed states and nonextremal measurements. In this work, we present a hierarchy of SDP relaxations to lower bound the device-dependent conditional min-entropy. Benchmarking against known special cases, we find that the first level of the hierarchy already attains the optimal value. We then provide two applications. First, for setups affected by global depolarizing noise, we compute a matching lower bound to the analytical attack derived in [Curran et al., arXiv:2506.22294 (2025)], thus showing its optimality. Finally, we show that restricting the correlations between the P\&M boxes to be classical strictly decreases an adversary's predictive power, already in the most elementary setup of a qubit binary measurement. |
||
| Entanglement in the energy-constrained prepare-and-measure scenario: applications to randomness certification and channel discrimination | TQC 2026 | Raffaele D'Avino, Alimuddin Mir, Antonio Acin |
Quantum information tasks are often analyzed under varying trust assumptions about the devices involved. The semi-device-independent (SDI) framework offers a balance between needed assumptions and experimental feasibility. In this work, we study the energy-constrained SDI scenario, where the only assumption in a prepare-and-measure setup is an upper bound on the energy of the prepared quantum states. In contrast to previous studies that restricted the preparation and measurement devices to be classically correlated, we show that allowing entanglement strictly enlarges the set of achievable correlations. We identify two operational consequences of this result. The first concerns randomness certification, where we show that allowing the adversary to employ entangled strategies may significantly reduce the amount of certifiable randomness. This includes situations where the amount of randomness drops to zero in the presence of entanglement, while it remains positive when entanglement is excluded. Second, for the task of distinguishing an arbitrary quantum channel from the identity, we show that the known dimension-independent bound on the advantage conferred by entanglement is violated under an energy constraint. |
||
| Measurement-device-independent QRNG based on mode-competition in a gain-switched VCSEL | QCRYPT 2024 | Blanca Mir, Tomás Fernández Martos, Miquel Rudé, Domenico Tulli |
In this work, we present a new measurement-device-independent QRNG developed within Quside based on operating a vertical cavity surface emitting laser (VCSEL) in a gain-switching manner. We prove security in the finite-size regime using the EAT and obtain positive rates for as low as 7x10^4 rounds. |
||
| Decrease of certifiable randomness when entanglement is allowed in energy-constrained QRNGs | QCRYPT 2024 | Antonio Acin |
In this work, we study the consequences of entanglement-assistance (EA) for randomness generation in the semi-DI framework based on energy constraints introduced in (van Himbeeck et al., Quantum 1, 33 (2017)). We show that, given an energy bound $\omega$, the minimum min-entropy that non-EA honest devices can certify decreases when entanglement between the prepare and measurement boxes (of the devices prepared by Eve) is allowed. |
||
| Maximal intrinsic randomness of a quantum state | TQC 2024 | Shuyang Meng, Fionnuala Curran, Victoria Wright, Mate Farkas, Valerio Scarani, Antonio Acin |
| Quantifying the intrinsic randomness of quantum measurements | QIP 2023 | Antonio Acin, Thomas Strohm |
| Quantifying the intrinsic randomness of quantum measurements | QCRYPT 2022 | Thomas Strohm, Antonio Acin |
| An algorithm to study the Quantum Marginal Problem | QIP 2021 | Daniel Uzcátegui Contreras, Dardo Goyeneche |
| Robust Bell inequalities from communication complexity | QIP 2017 | Sophie Laplante, Mathieu Lauriere, Alexandre Nolin, Jeremie Roland |
| Distinguishing the undistinguishable | QIP 2014 | Ariel Bendersky, Gonzalo de La Torre, Santiago Figueira, Antonio Acin |
Collaborators
| Co-author | Joint talks |
|---|---|
| Antonio Acin | 7 |
| Alexandre Nolin | 2 |
| Jeremie Roland | 2 |
| Mathieu Lauriere | 2 |
| Raffaele D'Avino | 2 |
| Sophie Laplante | 2 |
| Thomas Strohm | 2 |
| Tomás Fernández Martos | 2 |
| Alimuddin Mir | 1 |
| Ariel Bendersky | 1 |
| Aurora Mugnai | 1 |
| Blanca Mir | 1 |
| Daniel Uzcátegui Contreras | 1 |
| Dardo Goyeneche | 1 |
| Domenico Tulli | 1 |
| Fionnuala Curran | 1 |
| Gonzalo de La Torre | 1 |
| Mate Farkas | 1 |
| Miguel Navascués | 1 |
| Miquel Rudé | 1 |