Introduction to Tensor Network States Sukhwinder Singh Macquarie

  • Slides: 58
Download presentation
Introduction to Tensor Network States Sukhwinder Singh Macquarie University (Sydney)

Introduction to Tensor Network States Sukhwinder Singh Macquarie University (Sydney)

Contents • The quantum many body problem. • Diagrammatic Notation • What is a

Contents • The quantum many body problem. • Diagrammatic Notation • What is a tensor network? • Example 1 : MPS • Example 2 : MERA

Quantum many body system in 1 -D

Quantum many body system in 1 -D

How many qubits can we represent with 1 GB of memory? Here, D =

How many qubits can we represent with 1 GB of memory? Here, D = 2. To add one more qubit double the memory.

But usually, we are not interested in arbitrary states in the Hilbert space. Typical

But usually, we are not interested in arbitrary states in the Hilbert space. Typical problem : To find the ground state of a local Hamiltonian H,

Ground states of local Hamiltonians are special

Ground states of local Hamiltonians are special

Properties of ground states in 1 -D 1) Gapped Hamiltonian 2) Critical Hamiltonian

Properties of ground states in 1 -D 1) Gapped Hamiltonian 2) Critical Hamiltonian

We can exploit these properties to represent ground states more efficiently using tensor networks.

We can exploit these properties to represent ground states more efficiently using tensor networks.

Ground states of local Hamiltonians

Ground states of local Hamiltonians

Contents • The quantum many body problem. • Diagrammatic Notation • What is a

Contents • The quantum many body problem. • Diagrammatic Notation • What is a tensor network? • Example 1 : MPS • Example 2 : MERA

Tensors Multidimensional array of complex numbers

Tensors Multidimensional array of complex numbers

Contraction =

Contraction =

Contraction =

Contraction =

Contraction =

Contraction =

Trace = =

Trace = =

Tensor product

Tensor product

Decomposition = = =

Decomposition = = =

Decomposing tensors can be useful = Rank(M) = Number of components in M =

Decomposing tensors can be useful = Rank(M) = Number of components in M = Number of components in P and Q =

Contents • The quantum many body problem. • Diagrammatic Notation • What is a

Contents • The quantum many body problem. • Diagrammatic Notation • What is a tensor network? • Example 1 : MPS • Example 2 : MERA

Many-body state as a tensor

Many-body state as a tensor

Expectation values

Expectation values

Correlators

Correlators

Reduced density operators

Reduced density operators

Tensor network decomposition of a state

Tensor network decomposition of a state

Essential features of a tensor network 1) Can efficiently store the TN in memory

Essential features of a tensor network 1) Can efficiently store the TN in memory Total number of components = O(poly(N)) 2) Can efficiently extract expectation values of local observables from TN Computational cost = O(poly(N))

Number of tensors in TN = O(poly(N)) is independent of N

Number of tensors in TN = O(poly(N)) is independent of N

Contents • The quantum many body problem. • Diagrammatic Notation • What is a

Contents • The quantum many body problem. • Diagrammatic Notation • What is a tensor network? • Example 1 : MPS • Example 2 : MERA

Matrix Product States

Matrix Product States

Recall!

Recall!

Expectation values

Expectation values

Expectation values

Expectation values

Expectation values

Expectation values

Expectation values

Expectation values

Expectation values

Expectation values

But is the MPS good for representing ground states?

But is the MPS good for representing ground states?

But is the MPS good for representing ground states? Claim: Yes! Naturally suited for

But is the MPS good for representing ground states? Claim: Yes! Naturally suited for gapped systems.

Recall! 1) Gapped Hamiltonian 2) Critical Hamiltonian

Recall! 1) Gapped Hamiltonian 2) Critical Hamiltonian

In any MPS Correlations decay exponentially Entropy saturates to a constant

In any MPS Correlations decay exponentially Entropy saturates to a constant

Recall!

Recall!

Correlations in a MPS

Correlations in a MPS

Correlations in a MPS

Correlations in a MPS

Correlations in a MPS

Correlations in a MPS

Correlations in a MPS

Correlations in a MPS

Correlations in a MPS

Correlations in a MPS

Correlations in a MPS

Correlations in a MPS

Entanglement entropy in a MPS

Entanglement entropy in a MPS

Entanglement entropy in a MPS

Entanglement entropy in a MPS

Entanglement entropy in a MPS

Entanglement entropy in a MPS

Entanglement entropy in a MPS

Entanglement entropy in a MPS

Entanglement entropy in a MPS

Entanglement entropy in a MPS

Entanglement entropy in a MPS

Entanglement entropy in a MPS

MPS as an ansatz for ground states 1. Variational optimization by minimizing energy 2.

MPS as an ansatz for ground states 1. Variational optimization by minimizing energy 2. Imaginary time evolution

Contents • The quantum many body problem. • Diagrammatic Notation • What is a

Contents • The quantum many body problem. • Diagrammatic Notation • What is a tensor network? • Example 1 : MPS • Example 2 : MERA

Summary • The quantum many body problem. • Diagrammatic Notation • What is a

Summary • The quantum many body problem. • Diagrammatic Notation • What is a tensor network? • Example 1 : MPS • Example 2 : MERA

Thanks !

Thanks !