
2
then apply our framework to homodyning of the vacuum
in an optical setup and demonstrate this scheme in an
experiment.
The method is illustrated in the upper panel of Fig. 1.
A measurement device – initially an uncharacterised
black box – is probed using a (small) set of known quan-
tum states {ρ0, . . . , ρn−1}, and the distributions p(k|ρi)
of outcomes are recorded. The entropy produced by
measurements on a fixed state ρ0can be bounded via
semidefinite programming using the observed data as
constraints, without further assumptions about the be-
haviour or noise affecting the measurement device. This
approach is general and applies to any prepare-and-
measure scenario in which some input states may be
trusted.
In the case of homodyne measurements of the vac-
uum, the fixed input is the vacuum state, and we take
the remaining states to be coherent states with varying
amplitude. The (untrusted) measurement is detection
of a fixed quadrature, discretised by analogue-to-digital
conversion to a finite number of outcomes. We show
that significant min-entropy can be produced using just
a few probe states, in the presence of both Gaussian and
non-Gaussian noise. We note that the scheme operates
far from the regime of detector tomography and already
with the vacuum and a single coherent state, randomness
can be extracted. Experimentally, we demonstrate our
scheme in a simple optical setup with up to four probe
states. In the following, we first describe the protocol
and then our experimental implementation.
In general, the randomness relative to an adversary
(Eve) can be quantified by how well Eve is able to predict
the outcomes in generation rounds, i.e. by the guessing
probability pgthat she correctly predicts the output k
when the input is ρ0. By the left-over hash lemma, the
asymptotic number of extractable random bits per round
is then given by the min-entropy Hmin =−log2pg. We
now show how pgmay be upper bounded (and hence
Hmin lower bounded) by a semidefinite program (SDP).
The measurement device implements some unknown,
noisy measurement. While the user observes only the
average behaviour, we assume Eve has perfect knowl-
edge of these measurements, which we associate with
ad-outcome positive-operator-valued measure (POVM)
ˆ
Πλ
k. Here, λlabels the measurement strategies, which
occur with distribution qλ. For a particular POVM, the
probability that Eve guesses correctly is determined by
the most likely outcome pg= max
kTrhρ0ˆ
Πλ
ki. An upper
bound on pgis then found by optimising over POVMs
ˆ
Πλ
kand probability distributions qλ, given the average
observed behaviour
pg≤min
{qλ,ˆ
Πλ
k}
qλmax
kTr hρ0ˆ
Πλ
ki
s.t.X
λ
qλTrhρiˆ
Πλ
ki=p(k|ρi)∀i, k.
(1)
This optimisation is not yet an SDP as it is nonlin-
ear in ˆ
Πλ
kand qλand contains the maximisation over
k. The latter issue can be resolved by observing that,
while the number of strategies available to Eve is a pri-
ori unlimited, following the logic of Ref. [36], all strate-
gies for which the most likely kin (1) is the same can
be grouped together. Thus we need only consider ddif-
ferent POVMs, and we can let λlabel the optimal k,
i.e. max
kTrhρ0ˆ
Πλ
ki= Trhρ0ˆ
Πλ
λi. The problem can now
be linearised by introducing new variables ˆ
Mλ
k=qλˆ
Πλ
k.
We obtain
pg= max
{ˆ
Mλ
k}
d
X
λ=1
Tr hρ0ˆ
Mλ
λi
s.t.ˆ
Mλ
k≥0∀k, λ
d
X
k=1
ˆ
Mλ
k=1
DTr "X
k
ˆ
Mλ
k#I∀λ
d
X
λ=1
Trhρiˆ
Mλ
ki=p(k|ρi)∀i, k
(2)
which is an SDP. Here, Dis the dimension of the POVM
elements, and the first two constraints ensure that the
ˆ
Mλ
kform a valid POVM and the qλa valid probability
distribution. Note while ideally we do not want to con-
strain the dimension, when implementing the SDP, D
must be finite. Dshould thus be chosen sufficiently large
to not affect the optimum. Also note that in practice, it
is often more useful to work with the dual SDP, in which
the observed data enters in the objective function and
not in the constraints. We derive the dual in App. A.
Next, we apply our scheme to the particular case of ho-
modyning the vacuum and probing with coherent states.
We will model both additive Gaussian noise in the mea-
surement and non-Gaussian noise from the analogue-to-
digital converter (ADC), in order to compute how much
randomness one may expect to extract from such a pro-
tocol. We stress, however, that in bounding the entropy,
no assumptions are made about the particular form of
the noise or the measurement.
The setup is illustrated in the lower panel of Fig. 1.
The trusted input states are ρ0=|0ih0|and ρi=|αiihαi|,
with αireal, i.e. along the X-quadrature. We take
the untrusted measurement to be of the X-quadrature,
binned by a ∆-bit ADC to give d= 2∆outcomes. In the
absence of imperfections, the measurement before bin-
ning is a projection |xihx|onto quadrature eigenstates.
To include noise, we consider a Gaussian distribution of
variance σ2
nand mean xthat converts the projector |xihx|
into a POVM element
ˆ
Σx=Z∞
−∞ |yihy|exp −(y−x)2/2σ2
n
√2πσn
dy. (3)
The noise strength is thus determined by σnand can be
stated in terms of the signal-to-noise ratio (SNR) σ2
v/σ2
n,
where σ2
vis the vacuum variance. The noise is additive