resetting uncontrolled quantum systems

167
Resetting uncontrolled quantum systems Institute for Quantum Optics and Quantum Information (IQOQI), Vienna Miguel NavascuΓ©s MN, arXiv:1710.02470

Upload: others

Post on 26-Jan-2022

13 views

Category:

Documents


0 download

TRANSCRIPT

Resetting uncontrolled quantum systems

Institute for Quantum Optics and Quantum Information (IQOQI), Vienna

Miguel NavascuΓ©s

MN, arXiv:1710.02470

I invented a time-warping device,

ask me how!

Institute for Quantum Optics and Quantum Information (IQOQI), Vienna

Miguel NavascuΓ©s

MN, arXiv:1710.02470

Definition of TIME-WARP

noun | \ ˈtīm ˈwȯrp \

Time-warp

1. an anomaly, discontinuity, or suspension held to occur in the progress of time

𝑑 = 0

𝑑 = 1 hour

𝑑 = 2 hours

𝑑 = 0

𝑑 = 0

Time warp for two hours

𝑑 = 2 hours

What should we find in the box if we are to claim a time warp experience?

Not expected

𝑑 = 2 hours

𝑑 = 2 hours

Not expected

𝑑 = 2 hours

Not expected

𝑑 = 2 hours, no intervention

Expected

𝑑 = 2 hours

Not expected

𝑑 = 2 hours, no intervention

Expected

𝑑 = 2 hours

Not expected

𝑑 = 2 hours, no intervention

𝑑 = 2 hours

ExpectedNot expected

𝑑 = 2 hours, no intervention

{πœ“ 𝑑 : 𝑑}

Time warp: operational definition

{πœ“ 𝑑 : 𝑑}

πœ“ 0

πœ“ 1πœ“ 2

Time warp: operational definition

Time warp protocol for t ∈ [0, 𝜏]

Time warp: operational definition

πœ“ πœβ€²

πœβ€² β‰  𝜏

Time warp: operational definition

{πœ“ 𝑑 : 𝑑}

πœ“ 0Time warpfor t ∈ [0, 𝜏]

A brief history of time warp

King Raivata and princess Revati

(400BC?)

Peter Damian(1007-1072)

(first edition in 1895)

Warping time physically

πœ“ πœβ€²

0 < πœβ€² < 𝜏

Time warp in special relativity

{πœ“ 𝑑 : 𝑑}

πœ“ 0Time warpfor t ∈ [0, 𝜏]

GΓΆdel spacetime

M. Buser, E. Kajari and W. P. Schleich, New J. Phys. 15 013063 (2013).

K. GΓΆdel, Rev. Mod. Phys. 21 447 (1949).

Time travelwith

wormholes

K. Thorne, Black Holes and Time Warps: Einstein'sOutrageous Legacy, Commonwealth Fund Book Program(1994).

πœ“ πœβ€²

πœβ€² β‰  𝜏

Time warp with time machines

{πœ“ 𝑑 : 𝑑}

πœ“ 0Time warpfor t ∈ [0, 𝜏]

Y. Aharonov, J. Anandan, S. Popescu and L. Vaidman Phys. Rev. Lett. 64, 2965 (1990).

The time translator

ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

Evolution after time T

𝑆

|πœ“(0)

Y. Aharonov, J. Anandan, S. Popescu and L. Vaidman Phys. Rev. Lett. 64, 2965 (1990).

The time translator

𝑆

𝑅

𝑀

ΰ΅Ώπ‘’βˆ’π‘–π»0𝛾𝑅𝑇|πœ“(0) |𝑅

Evolution after time T

|πœ‘ = |𝑅

|πœ“(0)

ΰ΅Ώπ‘’βˆ’π‘–π»0𝛾𝑅𝑇|πœ“(0) |𝑅

Y. Aharonov, J. Anandan, S. Popescu and L. Vaidman Phys. Rev. Lett. 64, 2965 (1990).

The time translator

𝑆

𝑅

𝑀

Evolution after time T

𝛾𝑅 = 1 βˆ’2𝐺𝑀

𝑅𝑐2

|πœ“(0)

Y. Aharonov, J. Anandan, S. Popescu and L. Vaidman Phys. Rev. Lett. 64, 2965 (1990).

The time translator

𝑆

𝑀

𝑅

𝑐𝑅 π‘’βˆ’π‘–π»0𝛾𝑅𝑇 |πœ“(0) |𝑅

Evolution after time T

|πœ‘ =

𝑅

𝑐𝑅 |𝑅

Y. Aharonov, J. Anandan, S. Popescu and L. Vaidman Phys. Rev. Lett. 64, 2965 (1990).

The time translator

𝑆

𝑀

Evolution after time T

|πœ‘ =

𝑅

𝑐𝑅 |𝑅

Measurement

𝑅

|𝑅

𝑅

𝑐𝑅 π‘’βˆ’π‘–π»0𝛾𝑅𝑇 |πœ“(0) |𝑅

Y. Aharonov, J. Anandan, S. Popescu and L. Vaidman Phys. Rev. Lett. 64, 2965 (1990).

The time translator

𝑆

𝑀

𝑅

𝑐𝑅 π‘’βˆ’π‘–π»0𝛾𝑅𝑇 |πœ“(0)

Evolution after time T

Y. Aharonov, J. Anandan, S. Popescu and L. Vaidman Phys. Rev. Lett. 64, 2965 (1990).

The time translator

𝑆

𝑀

𝑅

𝑐𝑅 π‘’βˆ’π‘–π»0𝛾𝑅𝑇 |πœ“(0) β‰ˆ π‘’βˆ’π‘–π»0𝛼𝑇 |πœ“(0)

Evolution after time T β‰ͺ 1

Y. Aharonov, J. Anandan, S. Popescu and L. Vaidman Phys. Rev. Lett. 64, 2965 (1990).

The time translator

𝑆

𝑀

𝑅

𝑐𝑅 π‘’βˆ’π‘–π»0𝛾𝑅𝑇 |πœ“(0) β‰ˆ π‘’βˆ’π‘–π»0𝛼𝑇 |πœ“(0)

Evolution after time T β‰ͺ 1

𝛼 ≫ 1

𝛼 ≀ 0Interesting cases

πœ“ πœβ€²

πœβ€² β‰  𝜏

Time warp with the time translator

{πœ“ 𝑑 : 𝑑}

πœ“ 0Time warpfor t ∈ [0, 𝜏]

Y. Aharonov, J. Anandan, S. Popescu and L. Vaidman Phys. Rev. Lett. 64, 2965 (1990).

The time translator

𝑆

𝑀

|πœ‘ =

𝑅

𝑐𝑅 |𝑅

Measurement

𝑅

|𝑅

Problem: astronomicallysmall probability of

postselection

𝑅

𝑐𝑅 π‘’βˆ’π‘–π»0𝛾𝑅𝑇 |πœ“(0) β‰ˆ π‘’βˆ’π‘–π»0𝛼𝑇 |πœ“(0)

β€œThe time translator has the same chances of succeeding as I have of delocalizing and

relocalizing somewhere else”

L. Vaidman

Time warp, the lame way

πœ“ 0

πœ“ 0

Time warp, the lame way

πœ“ 0

Time warp, the lame way

πœ“ 0

(0.3,0.2,0.9),(0.4,0.7,0.1),(0.5,0.6,0.3),

Time warp, the lame way

πœ“ 0

Time warp, the lame way

πœ“ βˆ’5732

Time warp, the lame way

𝑆

𝑀

|πœ‘ =

𝑅

𝑐𝑅 |𝑅

These proposals do not require control or knowledge of the physical system that we influence

𝑆

𝑀

|πœ‘ =

𝑅

𝑐𝑅 |𝑅

All interesting proposals to achieve time warp rely on special or general relativity

πœ“ πœβ€²

πœβ€² < 0

Main result

πœ“ 0Time warpfor t ∈ [0, 𝜏]

Uncontrolled system

Non-relativisticquantum physics

πœ“ πœβ€²

πœβ€² < 0

Main result

πœ“ 0Time warpfor t ∈ [0, 𝜏]

Uncontrolled system

Non-relativisticquantum physics

πœ“ πœβ€²

πœβ€² < 0

Main result

πœ“ 0Time warpfor t ∈ [0, 𝜏]

Uncontrolled system

Non-relativisticquantum physics

reasonable probability of success

Scenario

Goal

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇 > 0

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

Obvious solution

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

|πœ“(0) = ࡿ𝑒+𝑖𝐻0𝑇|πœ“(𝑇)

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

|πœ“(0) = ࡿ𝑒+𝑖𝐻0𝑇|πœ“(𝑇)

Obvious solution

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

S, uncontrolled

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝐻0?S, uncontrolled𝑆 𝑆

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝐻0?S, uncontrolled

𝑆 𝑃

𝑆 𝑆

𝐻𝑆𝑃(π‘Ÿ)?𝑆 𝑃

π‘Ÿ π‘Ÿ

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝐻0?S, uncontrolled

𝑆 𝑃

𝑆 𝑆

𝐻𝑆𝑃(π‘Ÿ)?𝑆 𝑃

π‘Ÿ π‘Ÿ

|πœ“(0) = ࡿ𝑒+𝑖𝐻0𝑇|πœ“(𝑇) ?

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝐻0?S, uncontrolled

𝑆 𝑃

𝑆 𝑆

𝐻𝑆𝑃(π‘Ÿ)?𝑆 𝑃

π‘Ÿ π‘Ÿ

|πœ“(0) = ࡿ𝑒+𝑖𝐻0𝑇|πœ“(𝑇) ?

We don’t know 𝐻0.

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝐻0?S, uncontrolled

𝑆 𝑃

𝑆 𝑆

𝐻𝑆𝑃(π‘Ÿ)?𝑆 𝑃

π‘Ÿ π‘Ÿ

Even if we knew 𝐻0, we wouldn’t know how to

implement π‘’βˆ’π‘–π»0𝑇 on S.

We don’t know 𝐻0.

|πœ“(0) = ࡿ𝑒+𝑖𝐻0𝑇|πœ“(𝑇) ?

𝑆

Controlled lab

S, uncontrolled

Resetting

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

MN, arXiv:1710.02470

Resetting

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

MN, arXiv:1710.02470

Exact past state

Resetting

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

We ignore how S evolves (unitarily) by itself and with other quantum systems

MN, arXiv:1710.02470

We know 𝑑𝑆 = dim(𝐻𝑠)

Resetting

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

We ignore how S evolves (unitarily) by itself and with other quantum systems

MN, arXiv:1710.02470

We know 𝑑𝑆 = dim(𝐻𝑠)

Imposible if we drop anyof the two assumptions

Sketch of a quantum resetting protocol

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)LAB

𝑑 = 𝑇

Initial conditions

(a) Probe interaction

𝑆

LAB

𝑑 ∈ (𝑇, 𝑇 + 𝛿)

𝑃

𝑆

LAB

𝑑 = 𝑇 + 𝛿

𝑃

(a) Probe interaction

𝑆

LAB

𝑑 ∈ (𝑇 + 𝛿, 2𝑇 + 𝛿)

𝑃

(b) Rest

𝑆

LAB

𝑑 ∈ (2𝑇 + 𝛿, 2 𝑇 + 2𝛿)

𝑃

(a) Probe interaction

𝑆

LAB

𝑑 = 2(𝑇 + 𝛿)

𝑃

𝑃′

(a) Probe interaction

𝑆

LAB

𝑑 ∈ (2𝑇 + 2𝛿, 3𝑇 + 2𝛿)

(b) Rest

𝑆

LAB

𝑑 = 𝑛(𝑇 + 𝛿)

𝑛 returned probes

(a) Probe interaction

Heralding measurement

𝑆

|πœ“(0)LAB

𝑑 = 𝑛(𝑇 + 𝛿)

(c) Probe processing

In the language of process diagrams

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)LAB

𝑑 = 𝑇

Initial conditions

𝑉 = π‘’βˆ’π‘–π»0𝑇 𝑆

𝑉

(a) Probe interaction

𝑉 = π‘’βˆ’π‘–π»0𝑇

𝑆

LAB

𝑑 ∈ (𝑇, 𝑇 + 𝛿)

𝑃 Unitary interaction

𝑆

π‘Š

𝑉 𝑃

(b) Rest

𝑉 = π‘’βˆ’π‘–π»0𝑇

𝑆

LAB

𝑑 ∈ (𝑇 + 𝛿, 2𝑇 + 𝛿)𝑃

𝑆

π‘Š

𝑉 𝑃

𝑉

𝑉 = π‘’βˆ’π‘–π»0𝑇 𝑆

π‘Š

𝑉 𝑃

𝑉

(a) Probe interaction

π‘Š

𝑉

π‘Š

𝑆

LAB

𝑑 = 𝑛(𝑇 + 𝛿)

𝑛returned probes

𝑉 = π‘’βˆ’π‘–π»0𝑇

(c) Probe processing

𝑆

|πœ“(0)LAB

𝑑 = 𝑛(𝑇 + 𝛿)

𝑆

π‘Š

𝑉 𝑃

𝑉

π‘Š

𝑉

π‘Š

𝑆

π‘₯ = 0

𝑆

π‘Š

𝑉 𝑃

𝑉

π‘Š

𝑉

π‘Š

𝑆

𝑉,π‘Š unknown

π‘₯ = 0

𝑆

π‘Š

𝑉 𝑃

𝑉

π‘Š

𝑉

π‘Š

𝑆

𝑆

π‘Š

𝑉 𝑃 𝑆

π‘ˆπ‘ƒ

𝑉,π‘Š unknown

π‘₯ = 0

(βˆ€π‘ˆ)

𝑆𝑆

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑛Quantum resetting

protocol

π‘₯ = 0

(βˆ€π‘ˆ)

𝑆𝑆

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑛Quantum resetting

protocol

π‘₯ = 0

Desideratum: 𝑃(π‘₯ = 0|π‘ˆ) β‰  0, for all π‘ˆ

𝑆

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

π‘›π‘ˆ = 𝑉𝑆⨂𝑉𝑃

𝑆

𝑉𝑆

𝑉𝑆

𝑉𝑆

π‘₯ = 0

π‘ˆ = 𝑉𝑆⨂𝑉𝑃 Resetting protocol will fail with probability 1

(βˆ€π‘ˆ)

𝑆𝑆

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑛Quantum resetting

protocol

π‘₯ = 0

Desideratum: 𝑃(π‘₯ = 0|π‘ˆ) β‰  0, for all π‘ˆ

𝑆

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

π‘₯ = 0

(βˆ€π‘ˆ)

𝑆

𝑛Quantum resetting

protocol

𝑃(π‘₯ = 0|π‘ˆ) β‰  0, except for a subset of unitaries of zero measure

Do quantum resetting protocols exist?

𝑆

LAB

Scenario

𝑑𝑆 = 2

𝑑𝑃 = 2

𝑆

LAB

𝑑 = 4(𝑇 + 𝛿)

4 returned probes

Scenario

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

Singlet state preparation

|πœ“βˆ’ =1

2( |01 βˆ’ |10 )

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

Projection onto the spacespanned by

π‘₯ = 0

Why does this work?

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

Projection onto the spacespanned by

π‘₯ = 0

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

|πœ“βˆ’

|πœ“βˆ’

|0 |0 |0 |0ΰ΅Ώ|πœ“(𝑑𝑓)

|πœ“(0)

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

|πœ“βˆ’

|πœ“βˆ’

|0 |0 |0 |0

ΰ΅Ώ|πœ“(𝑑𝑓) =1

2[π‘ˆ0,0, π‘ˆ0,1]

2 |πœ“(0)

ΰ΅Ώ|πœ“(𝑑𝑓)

|πœ“(0)

π‘ˆπ‘–π‘— = (𝕀𝑆⨂ۦ𝑖|𝑃)π‘ˆ(𝕀𝑆⨂| 𝑗 𝑃)

2x2 complex matrices

𝐴, 𝐡, 2 Γ— 2 matrices

𝐴, 𝐡 =

𝑖=0,1,2,3

π‘π‘–πœŽπ‘–

πœŽπ‘–, Pauli matrices

𝐴, 𝐡, 2 Γ— 2 matrices

𝐴, 𝐡 =

𝑖=0,1,2,3

π‘π‘–πœŽπ‘–

πœŽπ‘–, Pauli matrices

𝐴, 𝐡, 2 Γ— 2 matrices

𝑐0 = 0Tr( 𝐴, 𝐡 ) = 0

𝐴, 𝐡 =

𝑖=1,2,3

π‘π‘–πœŽπ‘–

πœŽπ‘–, Pauli matrices

𝐴, 𝐡, 2 Γ— 2 matrices

𝐴, 𝐡 2 =

𝑖=1,2,3

π‘π‘–πœŽπ‘–

2

=

𝑖=1,2,3

𝑐𝑖2 𝕀

πœŽπ‘–, Pauli matrices

𝐴, 𝐡, 2 Γ— 2 matrices

𝐴, 𝐡 2 =

𝑖=1,2,3

π‘π‘–πœŽπ‘–

2

=

𝑖=1,2,3

𝑐𝑖2 𝕀

πœŽπ‘–, Pauli matrices

𝐴, 𝐡, 2 Γ— 2 matricesCentral polynomial for dimension 2

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

|πœ“βˆ’

|πœ“βˆ’

|0 |0 |0 |0

ΰ΅Ώ|πœ“(𝑑𝑓) =1

2[π‘ˆ0,0, π‘ˆ0,1]

2 |πœ“(0)

ΰ΅Ώ|πœ“(𝑑𝑓)

|πœ“(0)

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

|πœ“βˆ’

|πœ“βˆ’

|0 |0 |0 |0

ΰ΅Ώ|πœ“(𝑑𝑓) =1

2[π‘ˆ0,0, π‘ˆ0,1]

2 |πœ“(0) ∝ |πœ“(0)

ΰ΅Ώ|πœ“(𝑑𝑓)

|πœ“(0)

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

|πœ“βˆ’

|πœ“βˆ’

ΰ΅Ώ|πœ“(𝑑𝑓) ∝ |πœ“(0)

ΰ΅Ώ|πœ“(𝑑𝑓)

|πœ“(0)

Similarly,

|π‘šπ‘–

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

𝑃 π‘₯ = 0 π‘ˆ ∈ [0, 1]

π‘₯ = 0

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

𝑃 π‘₯ = 0 π‘ˆ ∈ [0, 1]

π‘₯ = 0

E.g.: π‘ˆ = 𝑉𝑆⨂𝑉𝑃

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

𝑃 π‘₯ = 0 π‘ˆ ∈ [0, 1]

π‘₯ = 0

E.g.: π‘ˆ =𝜎π‘₯β¨‚πœŽπ‘§+π‘–πœŽπ‘¦β¨‚πœŽπ‘₯

2

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

ΰΆ±π‘‘π‘ˆπ‘ƒ π‘₯ = 0 π‘ˆ β‰ˆ 0.2170

Average probability of success for completey unknown π‘ˆ

π‘₯ = 0

Generalization

𝑆

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

(βˆ€π‘ˆ)

𝑆

n = O 𝑑𝑆3

[O 𝑑𝑆2 log 𝑑𝑆 ]

For all 𝑑𝑆

π‘₯ = 0

𝑃(π‘₯ = 0|π‘ˆ) β‰  0, except for a subset of unitaries of zero measure

𝑑𝑃 = 2

MN, arXiv:1710.02470

Characterization of all quantum resetting protocols (practical for n=4)

MN, arXiv:1710.02470

Heuristics to identify optimal strategies for high numbers of probes

𝒲8, ෩𝒲8,

𝒲9

𝑛 = 8, 𝑑𝑆 = 2

𝑛 = 9, 𝑑𝑆 = 3

MN, arXiv:1710.02470

What if the protocol fails?

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆ

𝑃

𝑄

|πœ“βˆ’

|πœ“βˆ’

π‘₯ = 0

𝑆

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆ

𝑃

𝑄

|πœ“βˆ’

|πœ“βˆ’

π‘₯ = 1

𝑆

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆ

𝑃

𝑄

|πœ“βˆ’

|πœ“βˆ’

π‘₯ = 1

𝑆

Suppose that thelast measurement

is a non-demolition one 𝐴

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆ

𝑃

𝑄

|πœ“βˆ’

|πœ“βˆ’

|πœ“βˆ’

π‘₯ = 1

𝑦 = 0

𝑆

π‘ˆ

π‘ˆ

𝑄′

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆ

𝑃

𝑄

|πœ“βˆ’

|πœ“βˆ’

π‘₯ = 1

|πœ” 𝑆𝐴 =

𝑖

𝑓𝑖(π‘ˆ) |πœ“ 𝑆 |𝑖 𝐴

𝑓𝑖 π‘ˆ , non-central matrix polynomialsof degree 4 on the variables

π‘ˆπ‘–π‘— = (𝕀𝑆⨂ۦ𝑖|𝑃)π‘ˆ(𝕀𝑆⨂| 𝑗 𝑃)

𝐴

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆ

𝑃

𝑄

|πœ“βˆ’

|πœ“βˆ’

|πœ“βˆ’

π‘₯ = 1

𝑦 = 0

π‘ˆ

π‘ˆ

𝑄′

ΰ΅Ώ|πœ“(𝑑𝑓) 𝑆=

𝑖

𝑔𝑖(π‘ˆ)𝑓𝑖(π‘ˆ) |πœ“(0) 𝑆

𝑔𝑖 π‘ˆ , matrix polynomials of degree2, such that σ𝑖 𝑔𝑖(π‘ˆ)𝑓𝑖(π‘ˆ) is a central

polynomial

ΰ΅Ώ|πœ“(𝑑𝑓)

|πœ“(0)

ΰΆ±π‘‘π‘ˆπ‘ƒ π‘₯ = 0 π‘ˆ β‰ˆ 0.6585

Average probability of success for completey unknown π‘ˆ

Undoing six possible failures

Experimental implementation?

IBM Q Experience

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

π‘₯ = 0 Experimental implementation: Prototype II

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

π‘₯ = 0 Experimental implementation: Prototype II

Implementation with single-qubit gates and CNOTS?

𝑄

π‘Š

π‘Š

π‘Š

π‘Š

π‘…πœ‹

2

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

π‘₯ = 0 Experimental implementation: Prototype II

𝑄

π‘Š

π‘Š

π‘Š

π‘Š

π‘…πœ‹

2

𝑅 βˆ’πœ‹

2

π‘Š

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

π‘₯ = 0 Experimental implementation: Prototype II

𝑅(πœƒ) 𝑅(βˆ’πœƒ)𝑅(βˆ’2πœƒ)

𝑄

π‘Š

π‘Š

π‘Š

π‘Š

π‘…πœ‹

2

𝑅 βˆ’πœ‹

2

π‘Š

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

π‘₯ = 0 Experimental implementation: Prototype II

𝑅(πœƒ) 𝑅(βˆ’πœƒ)

𝑋

𝑅(βˆ’2πœƒ) 𝑋

𝑋

𝑅(πœƒ) 𝑅(βˆ’πœƒ)𝑅(βˆ’2πœƒ)

𝑄

π‘Š

π‘Š

π‘Š

π‘Š

π‘…πœ‹

2

𝑅 βˆ’πœ‹

2

π‘Š

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

𝑄

|πœ“βˆ’

|πœ“βˆ’

π‘₯ = 0 Experimental implementation: Prototype II

𝑅(πœƒ) 𝑅(βˆ’πœƒ)

𝑋

𝑅(βˆ’2πœƒ) 𝑋

𝑋

𝑅(πœƒ) 𝑅(βˆ’πœƒ)𝑅(βˆ’2πœƒ)

𝑅 βˆ’πœ‹

2𝑅

πœ‹

2

𝑅 βˆ’πœ‹

2 π‘…πœ‹

2

𝑋

IBM QX4: Raven

Largest circuit depth allowed!

IBM QX4: Raven

Target system

π‘ˆ

Preparation of | πœ“+ ⨂2

Theoretical simulation

IBM QX4: Raven

Successful post-selection codes

IBM QX4: Raven

Theoretical simulation

| 0 |0Ϋ¦ 𝜌 πœŽπ‘§ {0,1}

Measurement resultson target qubit

IBM QX4: Raven

Theoretical simulation

IBM QX4: Raven

Crude reality

𝑆

π‘ˆ

π‘ˆ

π‘ˆ

π‘ˆπ‘ƒ

|πœ“βˆ’

|πœ“βˆ’

|π‘Ž |π‘Ž |π‘Ž |π‘Žΰ΅Ώ|πœ“(𝑑𝑓)

|πœ“(0)

Experimental implementation: Prototype II

IBM QX2: Sparrow

IBM QX2: Sparrow

Target system

Successful post-selection codes

IBM QX2: Sparrow

Theoretical simulation

IBM QX2: Sparrow

Measurement resultson target qubit

| 0 |0Ϋ¦ 𝜌 πœŽπ‘§ {0,1}

Theoretical simulation

IBM QX2: Sparrow

Crude reality

IBM QX2: Sparrow

Conclusion

Do there exist protocols with average probability of success (withprior π‘‘π‘ˆ) arbitrarily close to 1?

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

Can we shorten resetting protocols?

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

Ξ” β‰₯ 3𝑇

Can we shorten resetting protocols?

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

Ξ” β‰ͺ 𝑇?

Can we shorten resetting protocols?

Can we fast-forward?

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = Ξ”

𝑆

|πœ“(0)

𝑑 = 0

Ξ” β‰ͺ 𝑇?

LAB

𝑆

Can we shorten resetting protocols?/Can we fast-forward?

Hint: use which-path superpositions.

Simple experimental implementation?

Refocusing

I. S. B. Sardharwalla, T. S. Cubitt, A, W. Harrow, N. Linden, arXiv:1602.07963

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

We ignore 𝐻0, but any operation on S is allowed

(βˆ€π‘‰)

𝑆

𝑉

𝑉

𝑉

β‰ˆ

unitaries

𝑆

I. S. B. Sardharwalla, T. S. Cubitt, A, W. Harrow, N. Linden, arXiv:1602.07963

𝑉 = π‘’βˆ’π‘–π»0𝑇

Refocusing (obvious solution)

𝑆

𝑉

𝑉 = π‘’βˆ’π‘–π»0𝑇𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

I. S. B. Sardharwalla, T. S. Cubitt, A, W. Harrow, N. Linden, arXiv:1602.07963

Refocusing (obvious solution)

𝑆

𝑉

𝐴𝑉 = π‘’βˆ’π‘–π»0𝑇𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

I. S. B. Sardharwalla, T. S. Cubitt, A, W. Harrow, N. Linden, arXiv:1602.07963

𝑆

𝑆

𝑉

𝑉

𝑉

I. S. B. Sardharwalla, T. S. Cubitt, A, W. Harrow, N. Linden, arXiv:1602.07963

𝑉

𝑉

Channel tomography

𝐴

Refocusing (obvious solution)

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

𝑆

𝑆

𝑉

𝑉

𝑉

π‘‰βˆ’1

𝑉

𝑉

Channel tomography

𝐴

Refocusing (obvious solution)

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

I. S. B. Sardharwalla, T. S. Cubitt, A, W. Harrow, N. Linden, arXiv:1602.07963

𝑆

𝑆

𝑉

𝑉

𝑉

π‘‰βˆ’1

𝑉

𝑉

Channel tomography

(βˆ€π‘‰)

𝑆

β‰ˆ

𝐴

Refocusing (obvious solution)

|πœ“(0)

|πœ“(0)

𝑆

|πœ“(𝑇) = ΰ΅Ώπ‘’βˆ’π‘–π»0𝑇|πœ“(0)

𝑑 = 𝑇

𝑆

|πœ“(0)

𝑑 = 𝑇 + Ξ”

I. S. B. Sardharwalla, T. S. Cubitt, A, W. Harrow, N. Linden, arXiv:1602.07963