interaction distance patterns in entanglement
play

Interaction distance: patterns in entanglement Christopher J. Turner - PowerPoint PPT Presentation

Interaction distance: patterns in entanglement Christopher J. Turner , Konstantinos Meichanetzidis, Zlatko Papic, Jiannis K. Pachos School of Physics and Astronomy, University of Leeds 6 th November 2017 Verona, QTML 2017 Nat. Commun. 8. 14926


  1. Interaction distance: patterns in entanglement Christopher J. Turner , Konstantinos Meichanetzidis, Zlatko Papic, Jiannis K. Pachos School of Physics and Astronomy, University of Leeds 6 th November 2017 Verona, QTML 2017 Nat. Commun. 8. 14926 (2017) arXiv:1705.09983

  2. Motivation Many-body physics is hard... ◮ How distinct are the ground states of interacting systems of fermions from non-interacting systems? ◮ How good are non-interacting and mean field approximations to interacting physics? ◮ Can new perspectives be drawn from quantum information theory? ◮ Can we do all this more efficiently using some ideas from machine learning ?

  3. Outline Free fermions and interaction distance Example: Ising model in a magnetic field Interaction distance and supervised learning Conclusions

  4. Entanglement spectrum We partition our system and its Hilbert space H into two subsystems A and it’s complement B . A B The reduced density matrix for the pure state | ψ � in subsystem A is the partial trace ρ A = tr B | ψ � � ψ | (1) and the corresponding entanglement Hamiltonian H E = − ln ρ A (2) has eigenvalues ξ k , known as the entanglement spectrum 1 . What information can be found in the entanglement spectrum? 1 Li and Haldane 2008.

  5. Entanglement spectrum of non-interacting fermions The entanglement spectrum f for an eigenstate of a system of free fermions is built from a set { ε } of single particle entanglement energies 2 by � � � f ( σ ) = eig ( − log σ ) = z + n r ε r ∀ σ ∈ F r n r =0 , 1 This structure is intuitively similar to the many-body energy spectrum where the spectrum is built out of populating independent modes. 2 Peschel 2003.

  6. Interaction distance In order to quantify the dissimilarity of an interacting system to the class of free fermion systems we introduce the interaction distance 3 D F ( ρ ) = min σ ∈F D ( ρ, σ ) � where D ( ρ, σ ) = 1 ( ρ − σ ) 2 } is the trace distance. 2 tr { ρ D F σ F 3 Turner et al. 2017.

  7. Properties of D F It has an operational interpretation as measuring the distinguishabil- ity of the state from an eigenstate of a non-interacting Hamiltonian with an optimal measurement local to the reduced system 4 . D ( ρ, σ ) = max tr P ( ρ − σ ) (3) P In density functional theory (DFT) a free description is found which reproduces the expectation values of functions of density operators, D F bounds the accuracy for other observables [Patrick et al. incom- ing preprint]. 4 Englert 1996.

  8. Unitary orbits The manifold F contains all unitary orbits because each sigma is unitarily diagonalisable � ε r c † σ = exp { z + r c r } (4) r effecting a transformation c r �→ Uc r U † which preserves the CAR algebra. Notice however that the trace distance is minimised within a unitary orbit when σ and ρ are simultaneously diagonal and in rank-order 5 . This simplifies D F to depend only on the spectrum 6 1 � � e − ξ k − e − f k ( m ) � � � � D F ( { ξ } ) = min � 2 { m } k 5 Markham et al. 2008. 6 Turner et al. 2017.

  9. Ising model L � ( ± σ x j σ x j +1 + h z σ z h x σ x H ± = − + ) (5) j j � �� � ���� j =1 free interaction Figure: D F for the ferromagnetic (left) and antiferromagnetic (right) Ising model. L = 16 and periodic boundary conditions. 8 7 Turner et al. 2017.

  10. D F as an inverse problem Free fermion structure is characterised by a function > → R 2 N expand : R N (7) > between spectra (multisets). A method of solution for the problem of finding D F and σ is a weak inverse form expand , which minimises D F for input outside the image of expand . expand ◦ factor ◦ expand = expand (8) factor ◦ expand ◦ factor = factor (9) expand factor expand expand R 2 N − R 2 N > = R 2 N − R N − R N − R N ← − − − ← − − ← − − − ← − − − (10) > > > > >

  11. A linear approximation If we ignore the distinction between vectors and multisets then expand becomes a linear map E expand ∼ E : R N → R 2 N . (11) As a matrix   1 0 0 . . . 0 1 0 . . .     E = (12) 1 1 0  . . .    . . . ... . . . . . . containing all bitstrings as rows. It has linear weak inverses (i.e. Moore-Penrose pseudoinverse).

  12. Results from linear regression Least squares δ 2 solution for the linear system ε = F ξ + δ (13) 10 − 1 10 − 2 δD est . F 10 − 3 Old initial guess Linear regression 0 . 02 0 . 04 0 . 06 0 . 08 D F

  13. Future directions ◮ Least-squares cost function is not appropriate, it favours getting high energy structure right although it’s Boltzmann factor is negligible. ◮ A linear model can’t capture the ordering structure – this will also be replaced by something more sophisticated. ◮ Could this be done with unsupervised learning?

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend