entanglement renormalization and cft: [.2cm] quantum ... · also obtain sub-circuits for majorana...

53
Entanglement renormalization and CFT: Quantum circuits for the Dirac field in 1+1 dimensions Michael Walter It from Qubit workshop, Kyoto, June 2019 with Freek Witteveen, Volkher Scholz, Brian Swingle (1905.08821) 1 / 16

Upload: others

Post on 30-Apr-2020

9 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Entanglement renormalization and CFT:Quantum circuits for the Dirac field in 1+1 dimensions

Michael Walter

It from Qubit workshop, Kyoto, June 2019

with Freek Witteveen, Volkher Scholz, Brian Swingle (1905.08821)

1 / 16

Page 2: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Entanglement renormalization and CFT:Quantum circuits for the Dirac field in 1+1 dimensions

Michael Walter

It from Qubit workshop, Kyoto, June 2019

with Freek Witteveen, Volkher Scholz, Brian Swingle (1905.08821)

1 / 16

Page 3: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Complexity of many-body quantum physics

Many-body states have exponentially large description:|Ψ〉 =

∑i1,...,in

Ψi1,...,in |i1, . . . , in〉

In practice, entanglement local ; compact description:

Start with local entangled pairs. . .

. . . and glue by applying local transformations:

2 / 16

Page 4: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Complexity of many-body quantum physics

Many-body states have exponentially large description:|Ψ〉 =

∑i1,...,in

Ψi1,...,in |i1, . . . , in〉

In practice, entanglement local ; compact description:

Start with local entangled pairs. . .

. . . and glue by applying local transformations:

2 / 16

Page 5: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Tensor networks in practice and theory

Tensor network: many-body statedefined by contracting network of(local) tensors

matrix product state[White, Fannes-Nachtergaele-Werner, Östlund-Rommer]

PEPS [Verstraete-Cirac] MERA [Vidal]

Numerical tool: ansatz classes for many-body statesI geometrize entanglement: area (RT) lawsI some are quantum circuits

Hilbert space

Powerful theoretical formalism that provides ‘dual’ or ‘holographic’descriptions of complex phenomena: topological order, . . .

3 / 16

Page 6: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Tensor networks in practice and theory

Tensor network: many-body statedefined by contracting network of(local) tensors

matrix product state[White, Fannes-Nachtergaele-Werner, Östlund-Rommer]

PEPS [Verstraete-Cirac] MERA [Vidal]

Numerical tool: ansatz classes for many-body statesI geometrize entanglement: area (RT) lawsI some are quantum circuits

Hilbert space

Powerful theoretical formalism that provides ‘dual’ or ‘holographic’descriptions of complex phenomena: topological order, . . .

3 / 16

Page 7: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Tensor networks and quantum field theory

Quantum field theories are defined in the continuum, while tensor networksare discrete and finitary. How to reconcile?

Two successful approaches:I modify ansatz ; continuum tensor networksI relate discrete networks to correlation functions of

continuum theory = unified perspective!

General definition

Given:

Underlying system can be continuous; discreteness is imposed in our choice of how to probe the system

state

operator choice

In either case. . .What do tensor networks capture? Can we identify generalconstruction principles? Why do tensor networks work well?

cf. plethora of rigorous results on gapped lattice systems in 1+1d [Hastings, . . . ]

More generally: How to study QI in QFT?

/ notions like subsystem, entropy,approximation, etc. subtle

, exciting recent progress. large body ofwork in mathematical physics.

c-theorem from subadditivity, Bekenstein bound via relative entropy, renormaliza-tion vs QEC, approximate QEC, . . .

4 / 16

Page 8: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Tensor networks and quantum field theory

Quantum field theories are defined in the continuum, while tensor networksare discrete and finitary. How to reconcile?

Two successful approaches:I modify ansatz ; continuum tensor networksI relate discrete networks to correlation functions of

continuum theory = unified perspective!

General definition

Given:

Underlying system can be continuous; discreteness is imposed in our choice of how to probe the system

state

operator choice

In either case. . .What do tensor networks capture? Can we identify generalconstruction principles? Why do tensor networks work well?

cf. plethora of rigorous results on gapped lattice systems in 1+1d [Hastings, . . . ]

More generally: How to study QI in QFT?

/ notions like subsystem, entropy,approximation, etc. subtle

, exciting recent progress. large body ofwork in mathematical physics.

c-theorem from subadditivity, Bekenstein bound via relative entropy, renormaliza-tion vs QEC, approximate QEC, . . .

4 / 16

Page 9: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Tensor networks and quantum field theory

Quantum field theories are defined in the continuum, while tensor networksare discrete and finitary. How to reconcile?

Two successful approaches:I modify ansatz ; continuum tensor networksI relate discrete networks to correlation functions of

continuum theory = unified perspective!

General definition

Given:

Underlying system can be continuous; discreteness is imposed in our choice of how to probe the system

state

operator choice

In either case. . .What do tensor networks capture? Can we identify generalconstruction principles? Why do tensor networks work well?

cf. plethora of rigorous results on gapped lattice systems in 1+1d [Hastings, . . . ]

More generally: How to study QI in QFT?

/ notions like subsystem, entropy,approximation, etc. subtle

, exciting recent progress. large body ofwork in mathematical physics.

c-theorem from subadditivity, Bekenstein bound via relative entropy, renormaliza-tion vs QEC, approximate QEC, . . .

4 / 16

Page 10: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Tensor networks and quantum field theory

Quantum field theories are defined in the continuum, while tensor networksare discrete and finitary. How to reconcile?

Two successful approaches:I modify ansatz ; continuum tensor networksI relate discrete networks to correlation functions of

continuum theory = unified perspective!

General definition

Given:

Underlying system can be continuous; discreteness is imposed in our choice of how to probe the system

state

operator choice

In either case. . .What do tensor networks capture? Can we identify generalconstruction principles? Why do tensor networks work well?

cf. plethora of rigorous results on gapped lattice systems in 1+1d [Hastings, . . . ]

More generally: How to study QI in QFT?

/ notions like subsystem, entropy,approximation, etc. subtle

, exciting recent progress. large body ofwork in mathematical physics.

c-theorem from subadditivity, Bekenstein bound via relative entropy, renormaliza-tion vs QEC, approximate QEC, . . .

4 / 16

Page 11: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Our contributions

ResultWe construct tensor networks for the Dirac CFT in 1+1 dimensions.

Key features:I explicit construction – no variational optimizationI rigorous approximation of correlation functionsI quantum circuits that renormalize entanglement

We achieve this using tools from signal processing: multiresolution analysisand discrete/continuum duality from wavelet theory.

Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed(branching) MERA for critical free-fermion lattice models.

5 / 16

Page 12: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Our contributions

ResultWe construct tensor networks for the Dirac CFT in 1+1 dimensions.

Key features:I explicit construction – no variational optimizationI rigorous approximation of correlation functionsI quantum circuits that renormalize entanglement

We achieve this using tools from signal processing: multiresolution analysisand discrete/continuum duality from wavelet theory.

Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed(branching) MERA for critical free-fermion lattice models.

5 / 16

Page 13: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Approach: Multi-scale Entanglement Renormalization Ansatz (MERA)

Tensor network ansatz for critical systems: [Vidal]

↓ local quantum circuit thatprepares state from |0〉⊗N

↑ entanglement renormalization

l organize q. information by scale

I introduce entanglement at all scales / disentangle & coarse-grainI noise-resilient on quantum computer [Kim et al]

I reminiscent of holography [Swingle], starting pointfor tensor network models [Qi, HaPPY, Hayden-. . . -W]

Important to understand design principles! Can we bridge numerics and toy models?6 / 16

Page 14: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Approach: Multi-scale Entanglement Renormalization Ansatz (MERA)

Tensor network ansatz for critical systems: [Vidal]

↓ local quantum circuit thatprepares state from |0〉⊗N

↑ entanglement renormalization

l organize q. information by scale

I introduce entanglement at all scales / disentangle & coarse-grainI noise-resilient on quantum computer [Kim et al]

I reminiscent of holography [Swingle], starting pointfor tensor network models [Qi, HaPPY, Hayden-. . . -W]

Important to understand design principles! Can we bridge numerics and toy models?6 / 16

Page 15: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Approach: Multi-scale Entanglement Renormalization Ansatz (MERA)

Tensor network ansatz for critical systems: [Vidal]

↓ local quantum circuit thatprepares state from |0〉⊗N

↑ entanglement renormalization

l organize q. information by scale

I introduce entanglement at all scales / disentangle & coarse-grainI noise-resilient on quantum computer [Kim et al]

I reminiscent of holography [Swingle], starting pointfor tensor network models [Qi, HaPPY, Hayden-. . . -W]

Important to understand design principles! Can we bridge numerics and toy models?6 / 16

Page 16: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Approach: Multi-scale Entanglement Renormalization Ansatz (MERA)

Tensor network ansatz for critical systems: [Vidal]

↓ local quantum circuit thatprepares state from |0〉⊗N

↑ entanglement renormalization

l organize q. information by scale

I introduce entanglement at all scales / disentangle & coarse-grainI noise-resilient on quantum computer [Kim et al]

I reminiscent of holography [Swingle], starting pointfor tensor network models [Qi, HaPPY, Hayden-. . . -W]

Important to understand design principles! Can we bridge numerics and toy models?6 / 16

Page 17: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Approach: Multi-scale Entanglement Renormalization Ansatz (MERA)

Tensor network ansatz for critical systems: [Vidal]

↓ local quantum circuit thatprepares state from |0〉⊗N

↑ entanglement renormalization

l organize q. information by scale

I introduce entanglement at all scales / disentangle & coarse-grainI noise-resilient on quantum computer [Kim et al]

I reminiscent of holography [Swingle], starting pointfor tensor network models [Qi, HaPPY, Hayden-. . . -W]

Important to understand design principles! Can we bridge numerics and toy models?6 / 16

Page 18: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Result: Entanglement renormalization for Dirac CFTMassless Dirac fermion in 1+1d: iγµ∂µψ = 0

We construct MERAs that target vacuum correlationfunctions C =

⟨O1 · · ·On

⟩of smeared observables.

General definition

Given:

Underlying system can be continuous; discreteness is imposed in our choice of how to probe the system

state

operator choice

Result (simplified)

Cexact ≈ CMERA

Goodness depends on smearing, #layers,quality parameter. Comes with ‘dictionary’for mapping observables. Symmetriesapproximately inherited!

First rigorous proof that entanglement renormalization can work for a CFT!

7 / 16

Page 19: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Result: Entanglement renormalization for Dirac CFTMassless Dirac fermion in 1+1d: iγµ∂µψ = 0

We construct MERAs that target vacuum correlationfunctions C =

⟨O1 · · ·On

⟩of smeared observables.

General definition

Given:

Underlying system can be continuous; discreteness is imposed in our choice of how to probe the system

state

operator choice

Result (simplified)

Cexact ≈ CMERA

Goodness depends on smearing, #layers,quality parameter. Comes with ‘dictionary’for mapping observables. Symmetriesapproximately inherited!

First rigorous proof that entanglement renormalization can work for a CFT!

7 / 16

Page 20: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Two-point functions: A-priori error

For different values of quality parameter and number of layers:

10 20 30 40 50number of layers

2

4

6

8

10

qual

ity (d

epth

per

laye

r)

10 3

10 2

10 1

100

101

102

103

Erro

r

Similarly for higher-point functions.

8 / 16

Page 21: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Two-point functions: Numerics

For different values of quality parameter and large number of layers:

〈T (x)T (y)〉

9 / 16

Page 22: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Verifying conformal data

I central charge: S(R) = c3 log R + c ′

0 100 200subsystem size

1.0

1.5

2.0

2.5

entro

py

1.23 log(R) + 0.7

1.03 log(R) + 0.73K = L = 1K = L = 3

I usual procedure: identify fields by searching foroperators that coarse-grain to themselves

; diagonalize ‘scaling superoperator’ [Evenbly-Vidal]

K=L=1 K=L=2∆I 0 0∆η 0.5 0.5∆η̄ 0.5 0.5∆ε 1 1∆σ 0.097 0.131∆µ 0.170 0.120

(for Majorana subtheory)

I not necessary in order to compute correlation functions using ourMERAs – theorem provides dictionary!

10 / 16

Page 23: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Verifying conformal data

I central charge: S(R) = c3 log R + c ′

0 100 200subsystem size

1.0

1.5

2.0

2.5

entro

py

1.23 log(R) + 0.7

1.03 log(R) + 0.73K = L = 1K = L = 3

I usual procedure: identify fields by searching foroperators that coarse-grain to themselves

; diagonalize ‘scaling superoperator’ [Evenbly-Vidal]

K=L=1 K=L=2∆I 0 0∆η 0.5 0.5∆η̄ 0.5 0.5∆ε 1 1∆σ 0.097 0.131∆µ 0.170 0.120

(for Majorana subtheory)

I not necessary in order to compute correlation functions using ourMERAs – theorem provides dictionary!

10 / 16

Page 24: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Verifying conformal data

I central charge: S(R) = c3 log R + c ′

0 100 200subsystem size

1.0

1.5

2.0

2.5

entro

py

1.23 log(R) + 0.7

1.03 log(R) + 0.73K = L = 1K = L = 3

I usual procedure: identify fields by searching foroperators that coarse-grain to themselves

; diagonalize ‘scaling superoperator’ [Evenbly-Vidal]

K=L=1 K=L=2∆I 0 0∆η 0.5 0.5∆η̄ 0.5 0.5∆ε 1 1∆σ 0.097 0.131∆µ 0.170 0.120

(for Majorana subtheory)

I not necessary in order to compute correlation functions using ourMERAs – theorem provides dictionary!

10 / 16

Page 25: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Verifying conformal data

I central charge: S(R) = c3 log R + c ′

0 100 200subsystem size

1.0

1.5

2.0

2.5

entro

py

1.23 log(R) + 0.7

1.03 log(R) + 0.73K = L = 1K = L = 3

I usual procedure: identify fields by searching foroperators that coarse-grain to themselves

; diagonalize ‘scaling superoperator’ [Evenbly-Vidal]

K=L=1 K=L=2∆I 0 0∆η 0.5 0.5∆η̄ 0.5 0.5∆ε 1 1∆σ 0.097 0.131∆µ 0.170 0.120

(for Majorana subtheory)

I not necessary in order to compute correlation functions using ourMERAs – theorem provides dictionary!

10 / 16

Page 26: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

How does it work?

Key technique: Entanglement renormalization using wavelet theory.

Tool from signal processing to resolve signal by scale:

Mathematically, basis transform built from scalingsand translates of single localized ‘wavelet’.

I second quantization: quantum circuit!

We construct wavelets that target Fermi sea ofDirac field using recent signal processing results(Selesnick’s Hilbert pairs).

11 / 16

Page 27: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

How does it work?

Key technique: Entanglement renormalization using wavelet theory.

Tool from signal processing to resolve signal by scale:

Mathematically, basis transform built from scalingsand translates of single localized ‘wavelet’.

I second quantization: quantum circuit!

We construct wavelets that target Fermi sea ofDirac field using recent signal processing results(Selesnick’s Hilbert pairs).

11 / 16

Page 28: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

How does it work?

Key technique: Entanglement renormalization using wavelet theory.

Tool from signal processing to resolve signal by scale:

Mathematically, basis transform built from scalingsand translates of single localized ‘wavelet’.

I second quantization: quantum circuit!

We construct wavelets that target Fermi sea ofDirac field using recent signal processing results(Selesnick’s Hilbert pairs).

11 / 16

Page 29: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

In more detail: Wavelets and MERA

Wavelet bases are built from scalings & translates of single wave packet:

j = −1 j = 0 j = 1

We can recursively resolve signal into different scales (multiresolution analysis):

scaling basis (scale ≥ j) scaling basis (scale ≥ j +1)

wavelet basis (scale = j)

Transform is implemented by circuit on single-particle Hilbert space:

I Discrete circuit resolves continuous signal by scale!I Second quantization yields Gaussian MERA layer. [Evenbly-White]

12 / 16

Page 30: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

In more detail: Wavelets and MERA

Wavelet bases are built from scalings & translates of single wave packet:

j = −1 j = 0 j = 1

We can recursively resolve signal into different scales (multiresolution analysis):

scaling basis (scale ≥ j) scaling basis (scale ≥ j +1)

wavelet basis (scale = j)

Transform is implemented by circuit on single-particle Hilbert space:

I Discrete circuit resolves continuous signal by scale!I Second quantization yields Gaussian MERA layer. [Evenbly-White]

12 / 16

Page 31: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

In more detail: Wavelets and MERA

Wavelet bases are built from scalings & translates of single wave packet:

j = −1 j = 0 j = 1

We can recursively resolve signal into different scales (multiresolution analysis):

scaling basis (scale ≥ j) scaling basis (scale ≥ j +1)

wavelet basis (scale = j)

Transform is implemented by circuit on single-particle Hilbert space:

I Discrete circuit resolves continuous signal by scale!I Second quantization yields Gaussian MERA layer. [Evenbly-White]

12 / 16

Page 32: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

In more detail: Wavelets and MERA

Wavelet bases are built from scalings & translates of single wave packet:

j = −1 j = 0 j = 1

We can recursively resolve signal into different scales (multiresolution analysis):

scaling basis (scale ≥ j) scaling basis (scale ≥ j +1)

wavelet basis (scale = j)

Transform is implemented by circuit on single-particle Hilbert space:

I Discrete circuit resolves continuous signal by scale!I Second quantization yields Gaussian MERA layer. [Evenbly-White]

12 / 16

Page 33: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

In more detail: Wavelets and MERA

Wavelet bases are built from scalings & translates of single wave packet:

j = −1 j = 0 j = 1

We can recursively resolve signal into different scales (multiresolution analysis):

scaling basis (scale ≥ j) scaling basis (scale ≥ j +1)

wavelet basis (scale = j)

Transform is implemented by circuit on single-particle Hilbert space:

I Discrete circuit resolves continuous signal by scale!I Second quantization yields Gaussian MERA layer. [Evenbly-White]

12 / 16

Page 34: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

In more detail: Wavelets and MERA

Wavelet bases are built from scalings & translates of single wave packet:

j = −1 j = 0 j = 1

We can recursively resolve signal into different scales (multiresolution analysis):

scaling basis (scale ≥ j) scaling basis (scale ≥ j +1)

wavelet basis (scale = j)

Transform is implemented by circuit on single-particle Hilbert space:

I Discrete circuit resolves continuous signal by scale!I Second quantization yields Gaussian MERA layer. [Evenbly-White]

12 / 16

Page 35: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

In more detail: Wavelets and MERA

Wavelet bases are built from scalings & translates of single wave packet:

j = −1 j = 0 j = 1

We can recursively resolve signal into different scales (multiresolution analysis):

scaling basis (scale ≥ j) scaling basis (scale ≥ j +1)

wavelet basis (scale = j)

Transform is implemented by circuit on single-particle Hilbert space:

I Discrete circuit resolves continuous signal by scale!I Second quantization yields Gaussian MERA layer. [Evenbly-White]

12 / 16

Page 36: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Wavelets for the Dirac fermion

Massless Dirac equation in 1+1d:[ψ1(x , t)ψ2(x , t)

]=[χ+(x − t) + χ−(x + t)iχ+(x − t)− iχ−(x + t)

]Filled Fermi sea

Need wavelets that target negative/positive momenta. Studied in signalprocessing, motivated by directionality and shift-invariance! [Selesnick]

After second quantizing and careful analysis, obtain tensor network with rigorousapproximation guarantees. . .

13 / 16

Page 37: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Wavelets for the Dirac fermion

Massless Dirac equation in 1+1d:[ψ1(x , t)ψ2(x , t)

]=[χ+(x − t) + χ−(x + t)iχ+(x − t)− iχ−(x + t)

]Filled Fermi sea

Need wavelets that target negative/positive momenta. Studied in signalprocessing, motivated by directionality and shift-invariance! [Selesnick]

After second quantizing and careful analysis, obtain tensor network with rigorousapproximation guarantees. . .

13 / 16

Page 38: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Wavelets for the Dirac fermion

Massless Dirac equation in 1+1d:[ψ1(x , t)ψ2(x , t)

]=[χ+(x − t) + χ−(x + t)iχ+(x − t)− iχ−(x + t)

]Filled Fermi sea

Need wavelets that target negative/positive momenta. Studied in signalprocessing, motivated by directionality and shift-invariance! [Selesnick]

After second quantizing and careful analysis, obtain tensor network with rigorousapproximation guarantees. . .

13 / 16

Page 39: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Technical Result

Parameters:I L – number of layersI ε – accuracy of wavelet pairI Γ – support and smoothness

of smearing functions

Consider correlation function with smeared fields & normal-ordered bilinears:C :=

⟨Ψ†(f1) · · ·Ψ(f2N)O1 · · ·OM

⟩Theorem (simplified)∣∣Cexact − CMERA

∣∣ ≤ Γ max{2−L/3, ε log 1ε}

We provide dictionary for CMERA (discretize smearing functions in scaling basis etc).14 / 16

Page 40: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Technical Result

Parameters:I L – number of layersI ε – accuracy of wavelet pairI Γ – support and smoothness

of smearing functions

Consider correlation function with smeared fields & normal-ordered bilinears:C :=

⟨Ψ†(f1) · · ·Ψ(f2N)O1 · · ·OM

⟩Theorem (simplified)∣∣Cexact − CMERA

∣∣ ≤ Γ max{2−L/3, ε log 1ε}

We provide dictionary for CMERA (discretize smearing functions in scaling basis etc).14 / 16

Page 41: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Technical Result

Parameters:I L – number of layersI ε – accuracy of wavelet pairI Γ – support and smoothness

of smearing functions

Consider correlation function with smeared fields & normal-ordered bilinears:C :=

⟨Ψ†(f1) · · ·Ψ(f2N)O1 · · ·OM

⟩Theorem (simplified)∣∣Cexact − CMERA

∣∣ ≤ Γ max{2−L/3, ε log 1ε}

We provide dictionary for CMERA (discretize smearing functions in scaling basis etc).14 / 16

Page 42: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Technical Result

Parameters:I L – number of layersI ε – accuracy of wavelet pairI Γ – support and smoothness

of smearing functions

Consider correlation function with smeared fields & normal-ordered bilinears:C :=

⟨Ψ†(f1) · · ·Ψ(f2N)O1 · · ·OM

⟩Theorem (simplified)∣∣Cexact − CMERA

∣∣ ≤ Γ max{2−L/3, ε log 1ε}

We provide dictionary for CMERA (discretize smearing functions in scaling basis etc).14 / 16

Page 43: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Technical Result

Parameters:I L – number of layersI ε – accuracy of wavelet pairI Γ – support and smoothness

of smearing functions

Consider correlation function with smeared fields & normal-ordered bilinears:C :=

⟨Ψ†(f1) · · ·Ψ(f2N)O1 · · ·OM

⟩Theorem (simplified)∣∣Cexact − CMERA

∣∣ ≤ Γ max{2−L/3, ε log 1ε}

We provide dictionary for CMERA (discretize smearing functions in scaling basis etc).14 / 16

Page 44: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Technical Result

!" = $%"& ,!& =

%'

( = 1,* = 1

|1⟩|0⟩ |1⟩|0⟩

|1⟩|0⟩ |1⟩|0⟩

|1⟩|0⟩ |1⟩|0⟩

−//4

234

234−//4

−//4 −//4 −//4 −//4

Parameters:I L – number of layersI ε – accuracy of wavelet pairI Γ – support and smoothness

of smearing functions

Consider correlation function with smeared fields & normal-ordered bilinears:C :=

⟨Ψ†(f1) · · ·Ψ(f2N)O1 · · ·OM

⟩Theorem (simplified)∣∣Cexact − CMERA

∣∣ ≤ Γ max{2−L/3, ε log 1ε}

We provide dictionary for CMERA (discretize smearing functions in scaling basis etc).14 / 16

Page 45: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Dirac fermion on circle

Construction can be easily adapted to Dirac fermion on circle:

=

I finite number of layers once UV cut-off fixedI systematic construction by (anti)periodizing wavelets

15 / 16

Page 46: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Summary and outlook

!" = $%"& ,!& =

%'

( = 1,* = 1

|1⟩|0⟩ |1⟩|0⟩

|1⟩|0⟩ |1⟩|0⟩

|1⟩|0⟩ |1⟩|0⟩

−//4

234

234−//4

−//4 −//4 −//4 −//4

I entanglement renormalization quantum circuits for 1+1d Dirac CFTI systematic construction with rigorous guarantees

Outlook:I thermofield double, Dirac cones, . . .I building block for more interesting CFTs? starting point for

perturbation theory or variational optimization?I lift wavelet theory to quantum circuits! tensor network bootstrap?

Thank you for your attention!16 / 16

Page 47: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

How to build an approximate Hilbert pair [Selesnick]

Wavelets are built from filters g [n] that relate functions at different scale:

φj−1(x) =∑n∈Z

g [n]φj(x − 2−jn)

Necessary and sufficient to obtain orthonormal basis (roughly speaking):

|G(θ)|2 + |G(θ + π)|2 = 2, G(0) =√2

Wavelets are related by Hilbert transform iff filters related by half-shift:

G(θ) = H(θ)e−iθ/2

To achieve this, find explicit approximation

e−iθ/2 ≈ e−iLθD(−θ)D(θ) .

Then, H(θ) = Q(θ)D(θ) and G(θ) = Q(θ)e−iLθD(−θ) are approximatelyrelated by half-shift for any choice of Q(θ).

17 / 16

Page 48: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

How to build an approximate Hilbert pair [Selesnick]

Wavelets are built from filters g [n] that relate functions at different scale:

φj−1(x) =∑n∈Z

g [n]φj(x − 2−jn)

Necessary and sufficient to obtain orthonormal basis (roughly speaking):

|G(θ)|2 + |G(θ + π)|2 = 2, G(0) =√2

Wavelets are related by Hilbert transform iff filters related by half-shift:

G(θ) = H(θ)e−iθ/2

To achieve this, find explicit approximation

e−iθ/2 ≈ e−iLθD(−θ)D(θ) .

Then, H(θ) = Q(θ)D(θ) and G(θ) = Q(θ)e−iLθD(−θ) are approximatelyrelated by half-shift for any choice of Q(θ).

17 / 16

Page 49: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

How to build an approximate Hilbert pair [Selesnick]

Wavelets are built from filters g [n] that relate functions at different scale:

φj−1(x) =∑n∈Z

g [n]φj(x − 2−jn)

Necessary and sufficient to obtain orthonormal basis (roughly speaking):

|G(θ)|2 + |G(θ + π)|2 = 2, G(0) =√2

Wavelets are related by Hilbert transform iff filters related by half-shift:

G(θ) = H(θ)e−iθ/2

To achieve this, find explicit approximation

e−iθ/2 ≈ e−iLθD(−θ)D(θ) .

Then, H(θ) = Q(θ)D(θ) and G(θ) = Q(θ)e−iLθD(−θ) are approximatelyrelated by half-shift for any choice of Q(θ).

17 / 16

Page 50: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Non-relativistic 2D fermions – Lattice model

When put on lattice, massless Dirac fermion becomes: (Kogut-Susskind)

H1D ∼= −∑

na†nan+1 + h.c.

Non-relativistic fermions hopping on 2D square lattice at half filling:

H2D = −∑m,n

a†m,nam+1,n + a†m,nam,n+1 + h.c.

Fermi surface:

-3 -2 -1 0 1 2 3

-3

-2

-1

0

1

2

3

I violation of area law: S(R) ∼ R log R (Wolf, Gioev-Klich, Swingle)I Green’s function factorizes w.r.t. rotated axes

18 / 16

Page 51: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Non-relativistic 2D fermions – Lattice model

When put on lattice, massless Dirac fermion becomes: (Kogut-Susskind)

H1D ∼= −∑

na†nan+1 + h.c.

Non-relativistic fermions hopping on 2D square lattice at half filling:

H2D = −∑m,n

a†m,nam+1,n + a†m,nam,n+1 + h.c.

Fermi surface:

-3 -2 -1 0 1 2 3

-3

-2

-1

0

1

2

3

I violation of area law: S(R) ∼ R log R (Wolf, Gioev-Klich, Swingle)I Green’s function factorizes w.r.t. rotated axes

18 / 16

Page 52: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Non-relativistic 2D fermions – Branching MERA

Natural construction – perform wavelet transforms in both directions:

Wψ = ψlow ⊕ ψhigh ; (W ⊗W )ψ = ψll ⊕ ψlh ⊕ ψhl ⊕ ψhh

After second quantization, obtain variant of branching MERA (Evenbly-Vidal):

; approximation theorem (with Haegeman, Swingle, Cotler, Evenbly, Scholz).

19 / 16

Page 53: Entanglement renormalization and CFT: [.2cm] Quantum ... · Also obtain sub-circuits for Majorana and Ising CFT. In prior work, we constructed In prior work, we constructed (branching)

Non-relativistic 2D fermions – Branching MERA

Natural construction – perform wavelet transforms in both directions:

Wψ = ψlow ⊕ ψhigh ; (W ⊗W )ψ = ψll ⊕ ψlh ⊕ ψhl ⊕ ψhh

After second quantization, obtain variant of branching MERA (Evenbly-Vidal):

; approximation theorem (with Haegeman, Swingle, Cotler, Evenbly, Scholz).

19 / 16