1. Area law and Quantum Information José Ignacio Latorre Universitat de Barcelona Cosmocaixa, July 2006

2. Bekenstein-Hawking black hole entropy Entanglement entropy A B

3. Entropy sets the limit for the simulation of QM Goal of the talk Area law in QFT PEPS in QI

4. Schmidt decomposition A B  =min(dim H A, dim H B ) is the Schmidt number Some basics

5. The Schmidt number measures entanglement Let’s compute the von Neumann entropy of the reduced density matrix  =1 corresponds to a product state Large  implies large number of superposed states A B Srednicki ’93:

6. Maximally entangled states (EPR states) Each party is maximally surprised when ignoring the other one 1 ebit Ebits are needed for e.g. teleportation (Hence, proliferation of protocoles of distillation)

7. Maximum Entropy for N-qubits Strong subadditivity implies concavity

8. U entanglement preparation evolution measurement quantum computer simulation Quantum computation How accurately can we simulate entanglement ?

9. Exponential growth of Hilbert space Classical representation requires d n complex coefficients n A random state carries maximum entropy

10. Efficient description for slightly entangled states A B  = min(dim H A, dim H B ) Schmidt number Back to Schmidt decomposition A product state corresponds to

11. Slight entanglement iff  poly(n)<< d n Representation is efficient Single qubit gates involve only local update Two-qubit gates reduces to local updating Vidal: Iterate this process A product state iff efficient simulation

12. Small entanglement can be simulated efficiently quantum computer more efficient than classical computer if large entanglement

13. Matrix Product States i α Approximate physical states with a finite  MPS canonical form

14. Graphic representation of a MPS Efficient computation of scalar products operations

15. Intelligent way to represent entanglement!! Ex: retain 2,3,7,8 instead of 6,14,16,21,24,56 Efficient representation Efficient preparation Efficient processing Efficient readout

16. Matrix Product States for continuous variables Harmonic chains MPS handles entanglementProduct basis Truncate  tr d tr Iblisdir, Orús, JIL

17. Nearest neighbour interaction Minimize by sweeps (periodic DMRG, Cirac-Verstraete) Choose Hermite polynomials for local basis optimize over a

18. Results for n=100 harmonic coupled oscillators (lattice regularization of a quantum field theory) d tr =3  tr =3 d tr =4  tr =4 d tr =5  tr =5 d tr =6  tr =6 Newton-raphson on a

19. Quantum rotor (limit Bose-Hubbard) Eigenvalue distribution for half of the infinite system

20. Simulation of Laughlin wave function Local basis: a=0,..,n-1 Analytic expression for the reduced entropy Dimension of the Hilbert space

21. Exact MPS representation of Laughlin wave function Clifford algebra Optimal solution! (all matrices equal but the last)

22. m=2

23. Spin-off? Problem: exponential growth of a direct product Hilbert space Computational basis MPS Neural network i1i1 i2i2 inin

24. MPS Product states H NN Non-critical 1D systems ?

25. i 1 =1 i 1 =2 i 1 =3 i 1 =4 | i 1  i 2 =1 i 2 =2 i 2 =3 i 2 =4 | i 2 i 1  105| 2,1  Spin-off 1: Image compression pixel addresslevel of grey RG addressing

26. QPEG Read image by blocks Fourier transform RG address and fill Set compression level:  Find optimal gzip (lossless, entropic compression) of (define discretize Γ’s to improve gzip) diagonal organize the frequencies and use 1d RG work with diferences to a prefixed table Low frequencies high frequencies

27.  = 1 PSNR=17  = 4 PSNR=25  = 8 PSNR=31 Max  = 81

28. Spin-off 2: Differential equations Good if slight correlations between variables

29. Limit of MPS 1D chains, at the quantum phase transition point : scaling Quantum Ising, XY c=1/2 XX, Heisenberg c=1 Universality Away from criticality: saturation MPS are a faithful representation for non-critical 1D systems but deteriorate at quantum phase transitions Vidal, Rico, Kitaev, JIL Callan, Wilczeck

30. Exact coarse graining of MPS Optimal choice! VCLRW  remains the same and locks the physical index! After L spins are sequentially blocked Entropy is bounded Exact description of non-critical systems Local basis

31. Area law for bosonic field theory Geometric entropy Fine grained entropy Entanglement entropy QFT geometry

32. Radial discretization Srednicki ‘93

33. + lots of algebra

34. Area Law for arbitrary dimensional bosonic theory Riera, JIL Vacuum order: majorization of renduced density matrix Eigenvalues of  Majorization in L: area law Majorization along RG flows

35. Majorization theory Entropy provides a modest sense of ordering among probability distributions Muirhead (1903), Hardy, Littlewood, Pólya,…, Dalton Consider such that p are probabilities, P permutations d cumulants are ordered D is a doubly stochastic matrix LL  L t  L t’ t t’ RG Vacuum reordering

36. Area law and gravitational anomalies c 1 is an anomaly!!!! Von Neumann entropy captures a most elementary counting of degrees of freedom Trace anomalies Kabat – Strassler

37. Is entropy coefficient scheme dependent is d>1+1? Yes No c 1 =1/6 bosons c 1 =1/12 fermionic component

38. A B S A = S B → Area Law Entanglement bonds Contour (Area) law S ~ n (d-1)/d Can we represent an Area law? Locality symmetry

39. Efficient singular value decomposition BUT ever growing Area Law and RG of PEPS P rojected E ntangled P air PEPS can support area law!!

40. Can we handle quantum algorithms?

41. Adiabatic quantum evolution Farhi-Goldstone-Gutmann H(s(t)) = (1-s(t)) H 0 + s(t) H p Inicial hamiltonianProblem hamiltonian s(0)=0 s(T)=1 t Adiabatic theorem: if E1E1 E0E0 E t g min

42. 3-SAT –3-SAT 3-SAT is NP-complete K-SAT is hard for k > 2.41 3-SAT with m clauses: easy-hard-easy around m=4.2 –Exact Cover A clause is accepted if 001 or 010 or 100 Exact Cover is NP-complete 0 1 1 0 For every clause, one out of eight options is rejected instance

43. Beyond area law scaling! n=6-20 qubits 300 instances n/2 partition S ~.1 n Orús-JIL entropy s

44. n=80 m=68  =10 T=600 Max solved n=100 chi=16 T=5000

45. New class of classical algorithms: Simulate quantum algorithms with MPS Shor’s uses maximum entropy with equidistribution of eigenvalues Adiabatic evolution solved a n=100 Exact Cover! 1 solution among 10 30

46. Non-critical spin chainsS ~ ct Critical spin chainsS ~ log 2 n Spin chains in d-dimensions (QFT) S ~ n (d-1)/d Violation of area law!! (some 2D fermionic models) S ~ n 1/2 log 2 n NP-complete problemsS ~.1 n Shor FactorizationS ~ r ~ n Summary

47. Beyond area law? VIDAL: Entanglement RG Multiscale Entanglement Renormalization group Ansatz

48. Simulability of quantum systems QPT MERA? PEPS finite  Physics ? QMA ? Area law MPS

49. Quantum Mechanics Classical Physics + classification of QMA problems!!!