activity
20142026
most citedContextual advantage for state-dependent cloning

51 citations · 124 across the 13 of their papers we have counts for

collaborators

13 papers

quant-ph2026

A semi-definite programming formulation of the device-dependent guessing probability

Raffaele D'Avino, Aurora Mugnai, Miguel Navascués +2

In quantum mechanics, a measurement applied to a state in general produces some amount of intrinsic randomness. This is not only a fundamental feature of the theory, but is also at…

quant-ph2025

Deterministic randomness extraction for quantum random number generation with partial trust

Pablo Tikas Pueyo, Tomás Fernández Martos, Gabriel Senno

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, i…

quant-ph2025

Entanglement in the energy-constrained prepare-and-measure scenario: applications to randomness certification and channel discrimination

Raffaele D'Avino, Gabriel Senno, Mir Alimuddin +1

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…

quant-ph2025

Maximal intrinsic randomness of noisy quantum measurements

Fionnuala Curran, Morteza Moradi, Gabriel Senno +2

Quantum physics exhibits an intrinsic and private form of randomness with no classical counterpart. Any setup for quantum randomness generation involves measurements acting on quan…

quant-ph2023★ 2 cited

Maximal intrinsic randomness of a quantum state

Shuyang Meng, Fionnuala Curran, Gabriel Senno +4

One of the most counterintuitive aspects of quantum theory is its claim that there is 'intrinsic' randomness in the physical world. Quantum information science has greatly progress…

quant-ph2022★ 9 cited

Quantifying the intrinsic randomness of quantum measurements

Gabriel Senno, Thomas Strohm, Antonio Acín

Intrinsic quantum randomness is produced when a projective measurement on a given basis is implemented on a pure state that is not an element of the basis. The prepared state and i…

quant-ph2021★ 1 cited

Semi-device-independent full randomness amplification based on energy bounds

Gabriel Senno, Antonio Acín

Quantum Bell nonlocality allows for the design of protocols that amplify the randomness of public and arbitrarily biased Santha-Vazirani sources, a classically impossible task. Inf…

quant-ph2019

Fast and simple quantum state estimation

Daniel Uzcategui Contreras, Gabriel Senno, Dardo Goyeneche

We present an iterative method to solve the multipartite quantum state estimation problem. We demonstrate convergence for any informationally complete set of generalized quantum me…

quant-ph2019★ 51 cited

Contextual advantage for state-dependent cloning

Matteo Lostaglio, Gabriel Senno

A number of noncontextual models exist which reproduce different subsets of quantum theory and admit a no-cloning theorem. Therefore, if one chooses noncontextuality as one's notio…

quant-ph2017

Distinguishing computable mixtures of quantum states

Ignacio H. López Grande, Gabriel Senno, Gonzalo de la Torre +4

In this article we extend results from our previous work [Bendersky, de la Torre, Senno, Figueira and Acín, Phys. Rev. Lett. 116, 230406 (2016)] by providing a protocol to distingu…

quant-ph2016★ 19 cited

Non-signaling deterministic models for non-local correlations have to be uncomputable

Ariel Bendersky, Gabriel Senno, Gonzalo de la Torre +2

Quantum mechanics postulates random outcomes. However, a model making the same output predictions but in a deterministic manner would be, in principle, experimentally indistinguish…

quant-ph2016★ 11 cited

Robust Bell inequalities from communication complexity

Sophie Laplante, Mathieu Laurière, Alexandre Nolin +2

The question of how large Bell inequality violations can be, for quantum distributions, has been the object of much work in the past several years. We say that a Bell inequality is…

quant-ph2014★ 31 cited

Algorithmic Pseudorandomness in Quantum Setups

Ariel Bendersky, Gonzalo de la Torre, Gabriel Senno +2

The Church-Turing thesis is one of the pillars of computer science; it postulates that every classical system has equivalent computability power to the so-called Turing machine. Wh…