Data-Driven Inference and Observationally Complete Devices joint - - PowerPoint PPT Presentation

data driven inference and observationally complete devices
SMART_READER_LITE
LIVE PREVIEW

Data-Driven Inference and Observationally Complete Devices joint - - PowerPoint PPT Presentation

Data-Driven Inference and Observationally Complete Devices joint work with: M. DallArno, A. Bisio, A. Tosini Francesco Buscemi (Nagoya University) 51st Symposium on Mathematical Physics Toru n, Poland, 16 June 2019 An unknown device:


slide-1
SLIDE 1

Data-Driven Inference and Observationally Complete Devices

joint work with: M. Dall’Arno, A. Bisio, A. Tosini

Francesco Buscemi (Nagoya University) 51st Symposium on Mathematical Physics Toru´ n, Poland, 16 June 2019

slide-2
SLIDE 2

An unknown device:

0/14

slide-3
SLIDE 3

An unknown device: how can we infer anything about it?

0/14

slide-4
SLIDE 4

The Starting Point

  • given is a set of data in the form p(j|i), where i ∈ [1, M] labels the

setups (input) and j ∈ [1, N] the outcomes (output) of an experiment

1/14

slide-5
SLIDE 5

The Starting Point

  • given is a set of data in the form p(j|i), where i ∈ [1, M] labels the

setups (input) and j ∈ [1, N] the outcomes (output) of an experiment

  • given is also a hypothesis (prior information) about the structure of the

circuit that generated the data:

1/14

slide-6
SLIDE 6

The Starting Point

  • given is a set of data in the form p(j|i), where i ∈ [1, M] labels the

setups (input) and j ∈ [1, N] the outcomes (output) of an experiment

  • given is also a hypothesis (prior information) about the structure of the

circuit that generated the data:

  • Aim: to construct an inference, consistent with the hypothesis, about

the pieces composing the circuit that generated the dataset

1/14

slide-7
SLIDE 7

The Starting Point

  • given is a set of data in the form p(j|i), where i ∈ [1, M] labels the

setups (input) and j ∈ [1, N] the outcomes (output) of an experiment

  • given is also a hypothesis (prior information) about the structure of the

circuit that generated the data:

  • Aim: to construct an inference, consistent with the hypothesis, about

the pieces composing the circuit that generated the dataset

  • in the negative: if the dataset is incompatible with the hypothesis, the

hypothesis is falsified (like in a Bell test)

1/14

slide-8
SLIDE 8

The Starting Point

  • given is a set of data in the form p(j|i), where i ∈ [1, M] labels the

setups (input) and j ∈ [1, N] the outcomes (output) of an experiment

  • given is also a hypothesis (prior information) about the structure of the

circuit that generated the data:

  • Aim: to construct an inference, consistent with the hypothesis, about

the pieces composing the circuit that generated the dataset

  • in the negative: if the dataset is incompatible with the hypothesis, the

hypothesis is falsified (like in a Bell test)

  • in the positive: the hypothesis is “corroborated,” but also some

information about the device can be inferred (given an inference rule)

1/14

slide-9
SLIDE 9

The Starting Point

  • given is a set of data in the form p(j|i), where i ∈ [1, M] labels the

setups (input) and j ∈ [1, N] the outcomes (output) of an experiment

  • given is also a hypothesis (prior information) about the structure of the

circuit that generated the data:

  • Aim: to construct an inference, consistent with the hypothesis, about

the pieces composing the circuit that generated the dataset

  • in the negative: if the dataset is incompatible with the hypothesis, the

hypothesis is falsified (like in a Bell test)

  • in the positive: the hypothesis is “corroborated,” but also some

information about the device can be inferred (given an inference rule)

  • case-study in this talk: measurement inference

1/14

slide-10
SLIDE 10

Tomography VS Data-Driven Inference

Conventional tomography

  • probe: input states
  • inference target: measurement
  • probe states known

2/14

slide-11
SLIDE 11

Tomography VS Data-Driven Inference

Conventional tomography

  • probe: input states
  • inference target: measurement
  • probe states known

Data-driven inference (this talk)

  • probe: input states
  • inference target: measurement
  • probe states unknown

2/14

slide-12
SLIDE 12

Tomography VS Data-Driven Inference

Conventional tomography

  • probe: input states
  • inference target: measurement
  • probe states known

Data-driven inference (this talk)

  • probe: input states
  • inference target: measurement
  • probe states unknown

Motivation: to break (or at least to loosen) the circular argument on which conventional tomography relies

2/14

slide-13
SLIDE 13

Wigner’s Other Chain

As Wigner put it: [...] the experimentalist uses certain apparatus to measure the position, let us say, or the momentum, or the angular mo-

  • mentum. Now, how does the experimentalist know that this

apparatus will measure for him the position? “Oh,” you say, “he observed the apparatus. He looked at it.” Well that means that he carried out a measurement on it. How did he know that the apparatus with which he carried out that measurement will tell him the properties of the apparatus? Fundamentally, this is again a chain which has no beginning. And at the end we have to say, “We learned that as children how to judge what is around us.” [E.P. Wigner, Lecture at the Conference on the Foundations of Quantum Mechanics, Xavier University, Cincinnati, 1962.]

3/14

slide-14
SLIDE 14

Measurement Representation

  • measurement: linear mapping M from state set S ⊂ Rℓ to

probability distributions in RN

4/14

slide-15
SLIDE 15

Measurement Representation

  • measurement: linear mapping M from state set S ⊂ Rℓ to

probability distributions in RN

  • assumption in this talk: measurements are informationally

complete (otherwise conditions become more technical)

4/14

slide-16
SLIDE 16

Measurement Representation

  • measurement: linear mapping M from state set S ⊂ Rℓ to

probability distributions in RN

  • assumption in this talk: measurements are informationally

complete (otherwise conditions become more technical)

  • measurement range: M(S) {p ∈ RN : p = M(ρ), ρ ∈ S}

4/14

slide-17
SLIDE 17

Measurement Representation

  • measurement: linear mapping M from state set S ⊂ Rℓ to

probability distributions in RN

  • assumption in this talk: measurements are informationally

complete (otherwise conditions become more technical)

  • measurement range: M(S) {p ∈ RN : p = M(ρ), ρ ∈ S}
  • gauge symmetry: any transformation U such that U(S) = S

4/14

slide-18
SLIDE 18

Measurement Representation

  • measurement: linear mapping M from state set S ⊂ Rℓ to

probability distributions in RN

  • assumption in this talk: measurements are informationally

complete (otherwise conditions become more technical)

  • measurement range: M(S) {p ∈ RN : p = M(ρ), ρ ∈ S}
  • gauge symmetry: any transformation U such that U(S) = S
  • Theorem: the range M(S) identifies M up to gauge symmetries

4/14

slide-19
SLIDE 19

Quiz

Figure 1: What do you see?

5/14

slide-20
SLIDE 20

Inferring a Range from the Dataset

  • hypothesis: let us assume a theory (S, E)

6/14

slide-21
SLIDE 21

Inferring a Range from the Dataset

  • hypothesis: let us assume a theory (S, E)
  • this tells us how measurement ranges look like

6/14

slide-22
SLIDE 22

Inferring a Range from the Dataset

  • hypothesis: let us assume a theory (S, E)
  • this tells us how measurement ranges look like
  • Data-Driven Inference (DDI) Rule: in the face of data

D = {px ∈ RN}, infer the range which:

  • 1. contains the convex hull of D and
  • 2. is of minimum euclidean volume

6/14

slide-23
SLIDE 23

Some Comments

  • “minimum volume” in the affine variety spanned by D

7/14

slide-24
SLIDE 24

Some Comments

  • “minimum volume” in the affine variety spanned by D
  • why volume? because in this way the inference does not change

under linear transformations (and these are all that matter for a linear theory)

7/14

slide-25
SLIDE 25

Some Comments

  • “minimum volume” in the affine variety spanned by D
  • why volume? because in this way the inference does not change

under linear transformations (and these are all that matter for a linear theory)

  • why minimum? because we want to infer “as little as possible” in

the face of the data, that is, the least committal inference consistent with the data

7/14

slide-26
SLIDE 26

Some Comments

  • “minimum volume” in the affine variety spanned by D
  • why volume? because in this way the inference does not change

under linear transformations (and these are all that matter for a linear theory)

  • why minimum? because we want to infer “as little as possible” in

the face of the data, that is, the least committal inference consistent with the data

  • the output of DDI may be not unique: the inference rule may

return a set of compatible minimum-volume ranges

7/14

slide-27
SLIDE 27

Some Comments

  • “minimum volume” in the affine variety spanned by D
  • why volume? because in this way the inference does not change

under linear transformations (and these are all that matter for a linear theory)

  • why minimum? because we want to infer “as little as possible” in

the face of the data, that is, the least committal inference consistent with the data

  • the output of DDI may be not unique: the inference rule may

return a set of compatible minimum-volume ranges

  • DDI may fail: for example, if the data are incompatible with the

hypothesis (S, E)

7/14

slide-28
SLIDE 28

Some Comments

  • “minimum volume” in the affine variety spanned by D
  • why volume? because in this way the inference does not change

under linear transformations (and these are all that matter for a linear theory)

  • why minimum? because we want to infer “as little as possible” in

the face of the data, that is, the least committal inference consistent with the data

  • the output of DDI may be not unique: the inference rule may

return a set of compatible minimum-volume ranges

  • DDI may fail: for example, if the data are incompatible with the

hypothesis (S, E)

  • Problem 1: in order to apply DDI, one first needs to know the

shape of S

7/14

slide-29
SLIDE 29

Some Comments

  • “minimum volume” in the affine variety spanned by D
  • why volume? because in this way the inference does not change

under linear transformations (and these are all that matter for a linear theory)

  • why minimum? because we want to infer “as little as possible” in

the face of the data, that is, the least committal inference consistent with the data

  • the output of DDI may be not unique: the inference rule may

return a set of compatible minimum-volume ranges

  • DDI may fail: for example, if the data are incompatible with the

hypothesis (S, E)

  • Problem 1: in order to apply DDI, one first needs to know the

shape of S

  • Problem 2: empirical data are not probability distributions but

finite-statistics frequencies

7/14

slide-30
SLIDE 30

When Is the Inference Correct?

  • assume that there is a “true but unknown” measurement to be

inferred, and that the hypothesis about the underlying theory is “correct”

8/14

slide-31
SLIDE 31

When Is the Inference Correct?

  • assume that there is a “true but unknown” measurement to be

inferred, and that the hypothesis about the underlying theory is “correct”

  • what data are needed so that DDI returns the correct range?

8/14

slide-32
SLIDE 32

When Is the Inference Correct?

  • assume that there is a “true but unknown” measurement to be

inferred, and that the hypothesis about the underlying theory is “correct”

  • what data are needed so that DDI returns the correct range?
  • denote by S ⊆ S the set of probe states {ρi : i ∈ [1, M]} that are

used to generate the statistics (i.i.d. assumptions everywhere)

8/14

slide-33
SLIDE 33

When Is the Inference Correct?

  • assume that there is a “true but unknown” measurement to be

inferred, and that the hypothesis about the underlying theory is “correct”

  • what data are needed so that DDI returns the correct range?
  • denote by S ⊆ S the set of probe states {ρi : i ∈ [1, M]} that are

used to generate the statistics (i.i.d. assumptions everywhere)

  • Observational Completeness: S ⊆ S is observationally complete

for measurement M whenever DDI[M(S)] = M(S)

8/14

slide-34
SLIDE 34

When Is the Inference Correct?

  • assume that there is a “true but unknown” measurement to be

inferred, and that the hypothesis about the underlying theory is “correct”

  • what data are needed so that DDI returns the correct range?
  • denote by S ⊆ S the set of probe states {ρi : i ∈ [1, M]} that are

used to generate the statistics (i.i.d. assumptions everywhere)

  • Observational Completeness: S ⊆ S is observationally complete

for measurement M whenever DDI[M(S)] = M(S)

  • the entire S is obviously observationally complete for any

measurement

8/14

slide-35
SLIDE 35

When Is the Inference Correct?

  • assume that there is a “true but unknown” measurement to be

inferred, and that the hypothesis about the underlying theory is “correct”

  • what data are needed so that DDI returns the correct range?
  • denote by S ⊆ S the set of probe states {ρi : i ∈ [1, M]} that are

used to generate the statistics (i.i.d. assumptions everywhere)

  • Observational Completeness: S ⊆ S is observationally complete

for measurement M whenever DDI[M(S)] = M(S)

  • the entire S is obviously observationally complete for any

measurement

  • Question: are there less demanding OC sets?

8/14

slide-36
SLIDE 36

When Is the Inference Correct?

  • assume that there is a “true but unknown” measurement to be

inferred, and that the hypothesis about the underlying theory is “correct”

  • what data are needed so that DDI returns the correct range?
  • denote by S ⊆ S the set of probe states {ρi : i ∈ [1, M]} that are

used to generate the statistics (i.i.d. assumptions everywhere)

  • Observational Completeness: S ⊆ S is observationally complete

for measurement M whenever DDI[M(S)] = M(S)

  • the entire S is obviously observationally complete for any

measurement

  • Question: are there less demanding OC sets?
  • Theorem: S ⊆ S is observationally complete for any

measurement whenever DDI[S] = S

8/14

slide-37
SLIDE 37

The special case of spherical theories

8/14

slide-38
SLIDE 38

When S Is a Hypersphere...

  • ...any measurement range is an ellipsoid

9/14

slide-39
SLIDE 39

When S Is a Hypersphere...

  • ...any measurement range is an ellipsoid
  • hence, DDI returns the minimum-volume enclosing ellipsoid which

is efficiently computed and always unique for any dataset D (John, 1948)

9/14

slide-40
SLIDE 40

When S Is a Hypersphere...

  • ...any measurement range is an ellipsoid
  • hence, DDI returns the minimum-volume enclosing ellipsoid which

is efficiently computed and always unique for any dataset D (John, 1948)

  • in fact, hyperspherical theories are exactly those that allow a

unique inference for any dataset

9/14

slide-41
SLIDE 41

When S Is a Hypersphere...

  • ...any measurement range is an ellipsoid
  • hence, DDI returns the minimum-volume enclosing ellipsoid which

is efficiently computed and always unique for any dataset D (John, 1948)

  • in fact, hyperspherical theories are exactly those that allow a

unique inference for any dataset

  • DDI may still return an ellipsoid which is not the range of a valid

measurement: in this case a failure is announced

9/14

slide-42
SLIDE 42

The Case of Qubits

  • gauge symmetries are unitary and antiunitary transformations

10/14

slide-43
SLIDE 43

The Case of Qubits

  • gauge symmetries are unitary and antiunitary transformations
  • hence, DDI is able to return a qubit measurement up to unitaries
  • r antiunitaries

10/14

slide-44
SLIDE 44

The Case of Qubits

  • gauge symmetries are unitary and antiunitary transformations
  • hence, DDI is able to return a qubit measurement up to unitaries
  • r antiunitaries
  • moreover, a representative measurement can be explicitly

constructed for any range (closed formula)

10/14

slide-45
SLIDE 45

Observationally Complete Sets for Qubits

  • a set S is OC iff MVVE(S) = S

11/14

slide-46
SLIDE 46

Observationally Complete Sets for Qubits

  • a set S is OC iff MVVE(S) = S
  • Fact: in any real dimension ℓ, the minimum-volume ellipsoid

enclosing ℓ + 1 points is a hypersphere iff the points form a regular simplex

11/14

slide-47
SLIDE 47

Observationally Complete Sets for Qubits

  • a set S is OC iff MVVE(S) = S
  • Fact: in any real dimension ℓ, the minimum-volume ellipsoid

enclosing ℓ + 1 points is a hypersphere iff the points form a regular simplex

  • hence, SIC ensembles are OC

11/14

slide-48
SLIDE 48

Example: Observational VS Informational Completeness

Figure 2: A regular simplex is OC. Figure 3: An irregular simplex is not OC.

12/14

slide-49
SLIDE 49

Example: Observational VS Informational Completeness

Figure 2: A regular simplex is OC. Figure 3: An irregular simplex is not OC.

In particular:

  • a pure SIC ensemble is also OC

12/14

slide-50
SLIDE 50

Example: Observational VS Informational Completeness

Figure 2: A regular simplex is OC. Figure 3: An irregular simplex is not OC.

In particular:

  • a pure SIC ensemble is also OC
  • a depolarized SIC ensemble still is IC and “symmetric” but is not

OC anymore

12/14

slide-51
SLIDE 51

Example: DDI in Action

  • suppose the dataset comprises three probability distributions in

R4, that is D = {p1 = ( 1

2, 0, 1 4, 1 4), p2 = ( 1 8, 3 8, 2+ √ 3 8

, 2−

√ 3 8

), p3 = ( 1

8, 3 8, 2− √ 3 8

, 2+

√ 3 8

)}

13/14

slide-52
SLIDE 52

Example: DDI in Action

  • suppose the dataset comprises three probability distributions in

R4, that is D = {p1 = ( 1

2, 0, 1 4, 1 4), p2 = ( 1 8, 3 8, 2+ √ 3 8

, 2−

√ 3 8

), p3 = ( 1

8, 3 8, 2− √ 3 8

, 2+

√ 3 8

)}

  • suppose that, for the inference, we assume a theory with a

spherical state set: for example, a qubit

13/14

slide-53
SLIDE 53

Example: DDI in Action

  • suppose the dataset comprises three probability distributions in

R4, that is D = {p1 = ( 1

2, 0, 1 4, 1 4), p2 = ( 1 8, 3 8, 2+ √ 3 8

, 2−

√ 3 8

), p3 = ( 1

8, 3 8, 2− √ 3 8

, 2+

√ 3 8

)}

  • suppose that, for the inference, we assume a theory with a

spherical state set: for example, a qubit

  • DDI: the four effects are coplanar and arranged in a square

13/14

slide-54
SLIDE 54

Conclusions

  • inference of quantum devices from classical data
slide-55
SLIDE 55

Conclusions

  • inference of quantum devices from classical data
  • inference based on idea of self-consistent minimality
slide-56
SLIDE 56

Conclusions

  • inference of quantum devices from classical data
  • inference based on idea of self-consistent minimality
  • observationally complete sets allow correct inference
slide-57
SLIDE 57

Conclusions

  • inference of quantum devices from classical data
  • inference based on idea of self-consistent minimality
  • observationally complete sets allow correct inference
  • emergence of SIC qubit measurements as the minimal OC qubit

measurements

slide-58
SLIDE 58

Conclusions

  • inference of quantum devices from classical data
  • inference based on idea of self-consistent minimality
  • observationally complete sets allow correct inference
  • emergence of SIC qubit measurements as the minimal OC qubit

measurements

  • are there finite minimal OC sets for all dimensions? would these

always be SIC?

slide-59
SLIDE 59

Conclusions

  • inference of quantum devices from classical data
  • inference based on idea of self-consistent minimality
  • observationally complete sets allow correct inference
  • emergence of SIC qubit measurements as the minimal OC qubit

measurements

  • are there finite minimal OC sets for all dimensions? would these

always be SIC?

  • OC-ness does not need the Hilbert space structure
slide-60
SLIDE 60

Conclusions

  • inference of quantum devices from classical data
  • inference based on idea of self-consistent minimality
  • observationally complete sets allow correct inference
  • emergence of SIC qubit measurements as the minimal OC qubit

measurements

  • are there finite minimal OC sets for all dimensions? would these

always be SIC?

  • OC-ness does not need the Hilbert space structure

References:

  • initial idea (case of qubit channels): F.B. and M. Dall’Arno.

arXiv:1805.01159

  • experiment: I. Agresti, D. Poderini, G. Carvacho, L. Serra, R. Chaves, F.B., M.

Dall’Arno, F. Sciarrino. arXiv:1806.00380

  • this talk: M. Dall’Arno, F.B., A. Bisio, A. Tosini. arXiv:1812.08470
  • M. Dall’Arno, A. Ho, F.B., V. Scarani. arXiv:1905.04895
slide-61
SLIDE 61

Conclusions

  • inference of quantum devices from classical data
  • inference based on idea of self-consistent minimality
  • observationally complete sets allow correct inference
  • emergence of SIC qubit measurements as the minimal OC qubit

measurements

  • are there finite minimal OC sets for all dimensions? would these

always be SIC?

  • OC-ness does not need the Hilbert space structure

References:

  • initial idea (case of qubit channels): F.B. and M. Dall’Arno.

arXiv:1805.01159

  • experiment: I. Agresti, D. Poderini, G. Carvacho, L. Serra, R. Chaves, F.B., M.

Dall’Arno, F. Sciarrino. arXiv:1806.00380

  • this talk: M. Dall’Arno, F.B., A. Bisio, A. Tosini. arXiv:1812.08470
  • M. Dall’Arno, A. Ho, F.B., V. Scarani. arXiv:1905.04895

thank you