Learning Quantum Many-Body Systems from a Few Copies

Total Page:16

File Type:pdf, Size:1020Kb

Learning Quantum Many-Body Systems from a Few Copies Learning quantum many-body systems from a few copies Cambyse Rouz´e1, ∗ and Daniel Stilck Fran¸ca2, y 1Department of Mathematics, Technische Universit¨atM¨unchen,85748 Garching, Germany 2QMATH, Department of Mathematical Sciences, University of Copenhagen, Denmark (Dated: August 25, 2021) Estimating physical properties of quantum states from measurements is one of the most funda- mental tasks in quantum science. In this work, we identify conditions on states under which it is possible to infer the expectation values of all quasi-local observables of a given locality up to a relative error from a number of samples that grows polylogarithmically with the system's size and polynomially on the locality of the target observables. This constitutes an exponential improvement over known tomography methods in some regimes. We achieve our results by combining one of the most well-established techniques to learn quantum states, namely the maximum entropy method, with tools from the emerging fields of quantum optimal transport and classical shadows. We conjec- ture that our condition holds for all states exhibiting some form of decay of correlations and establish it for several subsets thereof. These include widely studied classes of states such as one-dimensional thermal and high-temperature Gibbs states of local commuting Hamiltonians on arbitrary hyper- graphs or outputs of shallow circuits. Moreover, we show improvements of the maximum entropy method beyond the sample complexity of independent interest. These include identifying regimes in which it is possible to perform the postprocessing efficiently as well as novel bounds on the condition number of covariance matrices of many-body states. I. INTRODUCTION in learning only physical properties of the state on which tomography is being performed. These are often encoded into the expectation values of The subject of quantum tomography has as quasi-local observables that only depend on re- its goal devising methods for the efficient classi- duced density matrices of subregions of the sys- cal description of a quantum system from access tem. By Helstrom's theorem, obtaining a good to experimental data. However, all tomographic recovery guarantee in trace distance is equivalent methods for general quantum states inevitably to demanding that the expectation value of all require resources that scale exponentially in the bounded observables are close for the two states. size of the system [1, 2], be it in terms of the num- ber of samples required or the post-processing It is in turn desirable to design tomographic needed to perform the task. procedures that can take advantage of the fact that we wish to only approximate quasi-local ob- Fortunately, most of the physically relevant servables, instead of demanding a recovery in quantum systems can be described in terms of trace distance, and some methods in the lit- a (quasi)-local structure. These range from that erature take advantage of that. For instance, of a local interaction Hamiltonian corresponding the overlapping tomography or classical shad- to a finite temperature Gibbs state to that of ows methods of [9{12] allow for approximately a shallow quantum circuit. Hence, locality is a learning all k-local reduced density matrices of physically motivated requirement that brings the an n-qubit state with failure probability δ us- amount of parameters describing the system to a ck −1 −2 arXiv:2107.03333v2 [quant-ph] 24 Aug 2021 ing (e k log(nδ ) ) copies without impos- tractable number. Effective tomographic proce- ingO any assumptions on the underlying state. dures should be able to incorporate this informa- This constitutes an exponential improvement in tion. And, indeed, many protocols in the litera- the system size compared to the previously men- ture achieve a good recovery guarantee in trace tioned many-body setting at the expense of an distance from a number of copies that scales poly- undesirable exponential dependency in the lo- nomially with system size [3{8]. cality of the observables. Unfortunately, with- Furthermore, in many cases one is interested out making any assumptions on the underlying states, this exponential scaling is also unavoid- able [9]. ∗ [email protected] In light of the previous discussion, it is natural y [email protected] 2 to ask if, combining the stronger structural as- chitz observables, transportation cost inequali- sumptions required for many-body tomography ties and the the maximum entropy principle. with techniques like classical shadows, it is pos- sible to obtain the best of the two worlds: a sam- ple complexity that is logarithmic in system size A. Lipschitz observables and polynomial in the locality of the observables we wish to estimate. In the classical setting, given a metric d on In this work, we achieve precisely this demand a sample space , the regularity of a function for a large class of physically motivated states S f : R can be quantified by its Lipschitz by combining recent techniques from quantum constantS![29, Chapter 3] optimal transport [13{18], the well-established maximum entropy method [19] to learn quan- f Lip = sup f(x) f(y) =d(x; y) : (1) tum states and the method of classical shadows. k k x;y2S j − j This results in an exponential improvement over For instance, if we consider functions on the n- known methods of many-body tomography [3{ dimensional hypercube 1; 1 n endowed with 8] and recent shadow tomography or overlapping the Hamming distance,{− the Lipschitzg constant tomography techniques [9{12], as summarized in quantifies by how much a function can change Table I. per flipped spin. It should then be clear that Our revisit of the maximum entropy princi- physical quantities like average magnetization ple is further motivated by recent breakthroughs have a small Lipschitz constant. Some recent in Hamiltonian learning [5, 20], shadow to- works [14, 16] extended this notion to the non- mography [9], the understanding of correlations commutative setting. Although the definition and computational complexity of quantum Gibbs put forth in [14] and the approach in [16] are not states [21{25] and quantum functional inequal- equivalent, they both recover the intuition dis- ities [18, 26] that shed new light on this sea- cussed previously. E.g., for the approach followed soned technique. Examples where we obtain ex- in [16], the Lipschitz constant of an observable on ponential improvements include thermal states of n qudits is defined as [30] 1D systems and high-temperature thermal states of commuting Hamiltonians on arbitrary hyper- O Lip; k k := max max tr [O(ρ σ)] ; graphs and outputs of shallow circuits. Further- pn 1≤i≤n ρ,σ2Ddn − more, based on results by [24], we conjecture that tri[ρ]=tri[σ] our results should hold for any high-temperature (2) Gibbs state, even with long-range interactions, where n denotes the set of n-qudit states. and give evidence in this direction. Dd That is, O Lip; quantifies the amount by which The main ingredient to obtain our improve- the expectationk k value of O changes for states ments are so-called transportation cost (TC) in- that are equal when tracing out one site. It equalities [27]. They allow us to relate by how is clear that O Lip 2pn O 1 always holds much the expectation values of two states on by H¨older'sinequality,k k ≤ butk itk can be the case Lipschitz observables, a concept we will review that O Lip; pn O 1. For instance, con- shortly, differ from their relative entropy. Such siderk fork somek > k0k the n-qubit observable inequalities constitute a powerful tool from the n i+k O = i=1 j=i Zj, where for each site j, Zj de- theory of optimal transport [28] and are tradi- notes the Pauli⊗ observable Z acting on site j and tionally used to prove sharp concentration in- we takeP addition modulo n. It is not difficult equalities [29, Chapter 3]. Moreover, they have to see that O Lip; = 2kpn, while O 1 = n. been recently extended to quantum states [14, We refer tok thek discussion in Fig. 1k fork another 16, 18]. By combining such inequalities with the example. maximum entropy principle, we are able to eas- Moreover, one can show that shallow local ily control the relative entropy between the states circuits or short-time local dynamics satisfying and, thus, the difference of expectation values of a Lieb-Robinson bound cannot substantially in- Lipschitz observables. crease the Lipschitz constant of an observable Before we summarize our contributions in when evolved in the Heisenberg picture. That is, more detail, we first define and revise the main ∗ if we have that Φt is the quantum channel that concepts required for our results, namely Lips- describes some local dynamics at time/depth t 3 Structure Assumptions on State Assumptions on Observable Samples Many-body tomography Many-body none poly(n; −1) [5] Classical Shadows none k-local poly(eck; log(n); −1) [9] This work Many-body+transportation k-local poly(k; log(n); −1) TABLE I. Summary of underlying assumptions and sample complexity of other approaches to perform tomog- raphy on quantum many-body states. in the Heisenberg picture and it satisfies a Lieb- can define a Wasserstein-1 distance on states by Robinson bound, then we have: duality [14, 16]. The latter quantifies how well we can distinguish two states by their action on cer- Φ∗(O) = (evt O ) ; t Lip; Lip; tain regular or local observables and is given k k O k k LΛ where v denotes the Lieb-Robinson velocity. This by result is discussed in more detail in Section B 1 of the supplemental material. Thus, averages W1;Λ(ρ, σ) := sup tr [O(ρ σ)] : (4) O2LΛ − over local observables and short-time evolutions thereof all belong to the class of observables that y Here we will consider Λ = O = O ; O Lip;Λ have a small Lipschitz constant when compared L f k k ≤ 1 for : Lip;Λ : Lip; ; : Lip;r and to generic observables.
Recommended publications
  • Tensor Network Methods in Many-Body Physics Andras Molnar
    Tensor Network Methods in Many-body physics Andras Molnar Ludwig-Maximilians-Universit¨atM¨unchen Max-Planck-Institut f¨urQuanutenoptik M¨unchen2019 Tensor Network Methods in Many-body physics Andras Molnar Dissertation an der Fakult¨atf¨urPhysik der Ludwig{Maximilians{Universit¨at M¨unchen vorgelegt von Andras Molnar aus Budapest M¨unchen, den 25/02/2019 Erstgutachter: Prof. Dr. Jan von Delft Zweitgutachter: Prof. Dr. J. Ignacio Cirac Tag der m¨undlichen Pr¨ufung:3. Mai 2019 Abstract Strongly correlated systems exhibit phenomena { such as high-TC superconductivity or the fractional quantum Hall effect { that are not explicable by classical and semi-classical methods. Moreover, due to the exponential scaling of the associated Hilbert space, solving the proposed model Hamiltonians by brute-force numerical methods is bound to fail. Thus, it is important to develop novel numerical and analytical methods that can explain the physics in this regime. Tensor Network states are quantum many-body states that help to overcome some of these difficulties by defining a family of states that depend only on a small number of parameters. Their use is twofold: they are used as variational ansatzes in numerical algorithms as well as providing a framework to represent a large class of exactly solvable models that are believed to represent all possible phases of matter. The present thesis investigates mathematical properties of these states thus deepening the understanding of how and why Tensor Networks are suitable for the description of quantum many-body systems. It is believed that tensor networks can represent ground states of local Hamiltonians, but how good is this representation? This question is of fundamental importance as variational algorithms based on tensor networks can only perform well if any ground state can be approximated efficiently in such a way.
    [Show full text]
  • Tensor Networks, MERA & 2D MERA ✦ Classify Tensor Network Ansatz According to Its Entanglement Scaling
    Lecture 1: tensor network states (MPS, PEPS & iPEPS, Tree TN, MERA, 2D MERA) Philippe Corboz, Institute for Theoretical Physics, University of Amsterdam i1 i2 i3 i4 i5 i6 i7 i8 i9 i10 i11i12 i13 i14 i15i16 i17 i18 Outline ‣ Lecture 1: tensor network states ✦ Main idea of a tensor network ansatz & area law of the entanglement entropy ✦ MPS, PEPS & iPEPS, Tree tensor networks, MERA & 2D MERA ✦ Classify tensor network ansatz according to its entanglement scaling ‣ Lecture II: tensor network algorithms (iPEPS) ✦ Contraction & Optimization ‣ Lecture III: Fermionic tensor networks ✦ Formalism & applications to the 2D Hubbard model ✦ Other recent progress Motivation: Strongly correlated quantum many-body systems High-Tc Quantum magnetism / Novel phases with superconductivity spin liquids ultra-cold atoms Challenging!tech-faq.com Typically: • No exact analytical solution Accurate and efficient • Mean-field / perturbation theory fails numerical simulations • Exact diagonalization: O(exp(N)) are essential! Quantum Monte Carlo • Main idea: Statistical sampling of the exponentially large configuration space • Computational cost is polynomial in N and not exponential Very powerful for many spin and bosonic systems Quantum Monte Carlo • Main idea: Statistical sampling of the exponentially large configuration space • Computational cost is polynomial in N and not exponential Very powerful for many spin and bosonic systems Example: The Heisenberg model . Sandvik & Evertz, PRB 82 (2010): . H = SiSj system sizes up to 256x256 i,j 65536 ⇥ Hilbert space: 2 Ground state sublattice magn. m =0.30743(1) has Néel order . Quantum Monte Carlo • Main idea: Statistical sampling of the exponentially large configuration space • Computational cost is polynomial in N and not exponential Very powerful for many spin and bosonic systems BUT Quantum Monte Carlo & the negative sign problem Bosons Fermions (e.g.
    [Show full text]
  • Tensor Network State Methods and Applications for Strongly Correlated Quantum Many-Body Systems
    Bildquelle: Universität Innsbruck Tensor Network State Methods and Applications for Strongly Correlated Quantum Many-Body Systems Dissertation zur Erlangung des akademischen Grades Doctor of Philosophy (Ph. D.) eingereicht von Michael Rader, M. Sc. betreut durch Univ.-Prof. Dr. Andreas M. Läuchli an der Fakultät für Mathematik, Informatik und Physik der Universität Innsbruck April 2020 Zusammenfassung Quanten-Vielteilchen-Systeme sind faszinierend: Aufgrund starker Korrelationen, die in die- sen Systemen entstehen können, sind sie für eine Vielzahl an Phänomenen verantwortlich, darunter Hochtemperatur-Supraleitung, den fraktionalen Quanten-Hall-Effekt und Quanten- Spin-Flüssigkeiten. Die numerische Behandlung stark korrelierter Systeme ist aufgrund ih- rer Vielteilchen-Natur und der Hilbertraum-Dimension, die exponentiell mit der Systemgröße wächst, extrem herausfordernd. Tensor-Netzwerk-Zustände sind eine umfangreiche Familie von variationellen Wellenfunktionen, die in der Physik der kondensierten Materie verwendet werden, um dieser Herausforderung zu begegnen. Das allgemeine Ziel dieser Dissertation ist es, Tensor-Netzwerk-Algorithmen auf dem neuesten Stand der Technik für ein- und zweidi- mensionale Systeme zu implementieren, diese sowohl konzeptionell als auch auf technischer Ebene zu verbessern und auf konkrete physikalische Systeme anzuwenden. In dieser Dissertation wird der Tensor-Netzwerk-Formalismus eingeführt und eine ausführ- liche Anleitung zu rechnergestützten Techniken gegeben. Besonderes Augenmerk wird dabei auf die Implementierung
    [Show full text]
  • Continuous Tensor Network States for Quantum Fields
    PHYSICAL REVIEW X 9, 021040 (2019) Featured in Physics Continuous Tensor Network States for Quantum Fields † Antoine Tilloy* and J. Ignacio Cirac Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Straße 1, 85748 Garching, Germany (Received 3 August 2018; revised manuscript received 12 February 2019; published 28 May 2019) We introduce a new class of states for bosonic quantum fields which extend tensor network states to the continuum and generalize continuous matrix product states to spatial dimensions d ≥ 2.By construction, they are Euclidean invariant and are genuine continuum limits of discrete tensor network states. Admitting both a functional integral and an operator representation, they share the important properties of their discrete counterparts: expressiveness, invariance under gauge transformations, simple rescaling flow, and compact expressions for the N-point functions of local observables. While we discuss mostly the continuous tensor network states extending projected entangled-pair states, we propose a generalization bearing similarities with the continuum multiscale entanglement renormal- ization ansatz. DOI: 10.1103/PhysRevX.9.021040 Subject Areas: Particles and Fields, Quantum Physics, Strongly Correlated Materials I. INTRODUCTION and have helped describe and classify their physical proper- ties. By design, their entanglement obeys the area law Tensor network states (TNSs) provide an efficient para- [17–19], which is a fundamental property of low-energy metrization of physically relevant many-body wave func- states of systems with local interactions. They enable a tions on the lattice [1,2]. Obtained from a contraction of succinct classification of symmetry-protected [20–23] and low-rank tensors on so-called virtual indices, they eco- topological phases of matter [24,25].
    [Show full text]
  • Numerical Continuum Tensor Networks in Two Dimensions
    PHYSICAL REVIEW RESEARCH 3, 023057 (2021) Numerical continuum tensor networks in two dimensions Reza Haghshenas ,* Zhi-Hao Cui , and Garnet Kin-Lic Chan† Division of Chemistry and Chemical Engineering, California Institute of Technology, Pasadena, California 91125, USA (Received 31 August 2020; accepted 31 March 2021; published 19 April 2021) We describe the use of tensor networks to numerically determine wave functions of interacting two- dimensional fermionic models in the continuum limit. We use two different tensor network states: one based on the numerical continuum limit of fermionic projected entangled pair states obtained via a tensor network for- mulation of multigrid and another based on the combination of the fermionic projected entangled pair state with layers of isometric coarse-graining transformations. We first benchmark our approach on the two-dimensional free Fermi gas then proceed to study the two-dimensional interacting Fermi gas with an attractive interaction in the unitary limit, using tensor networks on grids with up to 1000 sites. DOI: 10.1103/PhysRevResearch.3.023057 I. INTRODUCTION and there have been many developments to extend the range of the techniques, for example to long-range Hamiltoni- Understanding the collective behavior of quantum many- ans [15–17], thermal states [18], and real-time dynamics [19]. body systems is a central theme in physics. While it is often Also, much work has been devoted to improving the numeri- discussed using lattice models, there are systems where a cal efficiency and stability of PEPS computations [20–24]. continuum description is essential. One such case is found Formulating tensor network states and the associated algo- in superfluids [1], where recent progress in precise experi- rithms in the continuum remains a challenge.
    [Show full text]
  • Simulating Quantum Computation by Contracting Tensor Networks Abstract
    Simulating quantum computation by contracting tensor networks Igor Markov1 and Yaoyun Shi2 Department of Electrical Engineering and Computer Science The University of Michigan 2260 Hayward Street Ann Arbor, MI 48109-2121, USA E-mail: imarkov shiyy @eecs.umich.edu f j g Abstract The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We prove that a quantum circuit with T gates whose underlying graph has treewidth d can be simulated deterministically in T O(1) exp[O(d)] time, which, in particular, is polynomial in T if d = O(logT). Among many implications, we show efficient simulations for quantum formulas, defined and studied by Yao (Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 352–361, 1993), and for log-depth circuits whose gates apply to nearby qubits only, a natural constraint satisfied by most physical implementations. We also show that one-way quantum computation of Raussendorf and Briegel (Physical Review Letters, 86:5188– 5191, 2001), a universal quantum computation scheme with promising physical implementations, can be efficiently simulated by a randomized algorithm if its quantum resource is derived from a small-treewidth graph. Keywords: Quantum computation, computational complexity, treewidth, tensor network, classical simula- tion, one-way quantum computation. 1Supported in part by NSF 0208959, the DARPA QuIST program and the Air Force Research Laboratory. 2Supported in part by NSF 0323555, 0347078 and 0622033. 1 Introduction The recent interest in quantum circuits is motivated by several complementary considerations. Quantum information processing is rapidly becoming a reality as it allows manipulating matter at unprecedented scale.
    [Show full text]
  • Many Electrons and the Photon Field the Many-Body Structure of Nonrelativistic Quantum Electrodynamics
    Many Electrons and the Photon Field The many-body structure of nonrelativistic quantum electrodynamics vorgelegt von M. Sc. Florian Konrad Friedrich Buchholz ORCID: 0000-0002-9410-4892 an der Fakultät II – Mathematik und Naturwissenschaften der Technischen Universität Berlin zur Erlangung des akademischen Grades DOKTOR DER NATURWISSENSCHAFTEN Dr.rer.nat. genehmigte Dissertation PROMOTIONSAUSSCHUSS: Vorsitzende: Prof. Dr. Ulrike Woggon Gutachter: Prof. Dr. Andreas Knorr Gutachter: Dr. Michael Ruggenthaler Gutachter: Prof. Dr. Angel Rubio Gutachter: Prof. Dr. Dieter Bauer Tag der wissenschaftlichen Aussprache: 24. November 2020 Berlin 2021 ACKNOWLEDGEMENTS The here presented work is the result of a long process that naturally involved many different people. They all contributed importantly to it, though in more or less explicit ways. First of all, I want to express my gratitude to Chiara, all my friends and my (German and Italian) family. Thank you for being there! Next, I want to name Michael Ruggenthaler, who did not only supervise me over many years, contribut- ing crucially to the here presented research, but also has become a dear friend. I cannot imagine how my time as a PhD candidate would have been without you! In the same breath, I want to thank Iris Theophilou, who saved me so many times from despair over non-converging codes and other difficult moments. Also without you, my PhD would not have been the same. Then, I thank Angel Rubio for his supervision and for making possible my unforgettable and formative time at the Max-Planck Institute for the Structure and Dynamics of Matter. There are few people who have the gift to make others feel so excited about physics, as Angel does.
    [Show full text]
  • Learning Phase Transition in Ising Model with Tensor-Network Born Machines
    Learning Phase Transition in Ising Model with Tensor-Network Born Machines Ahmadreza Azizi Khadijeh Najafi Department of Physics Department of Physics Virginia Tech Harvard & Caltech Blacksburg, VA Cambridge, MA [email protected] [email protected] Masoud Mohseni Google Ai Venice, CA [email protected] Abstract Learning underlying patterns in unlabeled data with generative models is a chal- lenging task. Inspired by the probabilistic nature of quantum physics, recently, a new generative model known as Born Machine has emerged that represents a joint probability distribution of a given data based on Born probabilities of quantum state. Leveraging on the expressibilty and training power of the tensor networks (TN), we study the capability of Born Machine in learning the patterns in the two- dimensional classical Ising configurations that are obtained from Markov Chain Monte Carlo simulations. The structure of our model is based on Projected Entan- gled Pair State (PEPS) as a two dimensional tensor network. Our results indicate that the Born Machine based on PEPS is capable of learning both magnetization and energy quantities through the phase transitions from disordered into ordered phase in 2D classical Ising model. We also compare learnability of PEPS with another popular tensor network structure Matrix Product State (MPS) and indicate that PEPS model on the 2D Ising configurations significantly outperforms the MPS model. Furthermore, we discuss that PEPS results slightly deviate from the Monte Carlo simulations in the vicinity of the critical point which is due to the emergence of long-range ordering. 1 Introduction In the past years generative models have shown a remarkable progress in learning the probability distribution of the input data and generating new samples accordingly.
    [Show full text]
  • Entanglement and Tensor Network States
    17 Entanglement and Tensor Network States Jens Eisert Freie Universitat¨ Berlin Dahlem Center for Complex Quantum Systems Contents 1 Correlations and entanglement in quantum many-body systems 2 1.1 Quantum many-body systems . 2 1.2 Clustering of correlations . 4 1.3 Entanglement in ground states and area laws . 5 1.4 The notion of the ‘physical corner of Hilbert space’ . 10 2 Matrix product states 11 2.1 Preliminaries . 11 2.2 Definitions and preparations of matrix product states . 13 2.3 Computation of expectation values and numerical techniques . 17 2.4 Parent Hamiltonians, gauge freedom, geometry, and symmetries . 23 2.5 Tools in quantum information theory and quantum state tomography . 27 3 Higher-dimensional tensor network states 29 3.1 Higher-dimensional projected entangled pair states . 29 3.2 Multi-scale entanglement renormalization . 32 4 Fermionic and continuum models 34 4.1 Fermionic models . 34 4.2 Continuum models . 35 E. Pavarini, E. Koch, and U. Schollwock¨ Emergent Phenomena in Correlated Matter Modeling and Simulation Vol. 3 Forschungszentrum Julich,¨ 2013, ISBN 978-3-89336-884-6 http://www.cond-mat.de/events/correl13 17.2 Jens Eisert 1 Correlations and entanglement in quantum many-body systems 1.1 Quantum many-body systems In this chapter we will consider quantum lattice systems as they are ubiquitous in the condensed matter context or in situations that mimic condensed matter systems, as provided, say, by sys- tems of cold atoms in optical lattices. What we mean by a quantum lattice system is that we think that we have an underlying lattice structure given: some lattice that can be captured by a graph.
    [Show full text]
  • Tensor Network States: Algorithms and Applications
    Tensor Network States: Algorithms and Applications 2019-2020 Time Table 12/4 (Wed) 12/5 (Thu) 12/6 (Fri) 09:00—09:30 registration registration registration 09:30—10:30 Naoki Kawashima Tao Xiang Ian McCulloch 10:30—10:50 break break break 10:50—11:30 Pan Zhang Dong-Hee Kim Katharine Hyatt 11:30—12:10 Kouichi Okunishi Tsuyoshi Obuko Ching-Yu Huang 12:10—13:30 lunch lunch lunch 13:30—14:30 Tomotoshi Nishino Chia-Min Chung Stefan Kuhn 14:30—15:10 Kenji Harada Satoshi Morita C.-J. David Lin 15:10—15:30 break break break 15:30—16:10 Poster session discussion Yoshifumi Nakamura Daisuke Kadoh 16:10—16:50 Poster session discussion banquet updated: 2019/12/02 1 Abstracts Day One: 12/4 (Wed) Morning session Chair: Ying-Jer Kao Understanding Kitaev Related Models through Tensor Networks Naoki Kawashima, ISSP, University fo Tokyo I review recent activities related to the Kitaev model and its derivatives. Especially, we devel- oped a new series of tensor network ansatzes that describes the ground state of the Kitaev model with high accuracy. The series of ansatzes suggest the essential similarity between the classical loop gas model and the Kitaev spin liquid. We also use the ansatzes for the initial state for TEBD-type optimization. Approximately contracting arbitrary tensor networks: eicient algorithms and applications in graphical models and quantum circuit simulations Pan Zhang, Institute of Theoretical Physics, Chinese Academy of Sciences Tensor networks are powerful tools in quantum many-body problems, usually defined on lattices where eicient contraction algorithms exist.
    [Show full text]
  • Categorical Tensor Network States
    Categorical Tensor Network States Jacob D. Biamonte,1,2,3,a Stephen R. Clark2,4 and Dieter Jaksch5,4,2 1Oxford University Computing Laboratory, Parks Road Oxford, OX1 3QD, United Kingdom 2Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543, Singapore 3ISI Foundation, Torino Italy 4Keble College, Parks Road, University of Oxford, Oxford OX1 3PG, United Kingdom 5Clarendon Laboratory, Department of Physics, University of Oxford, Oxford OX1 3PU, United Kingdom We examine the use of string diagrams and the mathematics of category theory in the description of quantum states by tensor networks. This approach lead to a unifi- cation of several ideas, as well as several results and methods that have not previously appeared in either side of the literature. Our approach enabled the development of a tensor network framework allowing a solution to the quantum decomposition prob- lem which has several appealing features. Specifically, given an n-body quantum state |ψi, we present a new and general method to factor |ψi into a tensor network of clearly defined building blocks. We use the solution to expose a previously un- known and large class of quantum states which we prove can be sampled efficiently and exactly. This general framework of categorical tensor network states, where a combination of generic and algebraically defined tensors appear, enhances the theory of tensor network states. PACS numbers: 03.65.Fd, 03.65.Ca, 03.65.Aa arXiv:1012.0531v2 [quant-ph] 17 Dec 2011 a [email protected] 2 I. INTRODUCTION Tensor network states have recently emerged from Quantum Information Science as a gen- eral method to simulate quantum systems using classical computers.
    [Show full text]
  • Quantum Quench Dynamics and Entanglement
    © 2018 by Tianci Zhou. All rights reserved. QUANTUM QUENCH DYNAMICS AND ENTANGLEMENT BY TIANCI ZHOU DISSERTATION Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Physics in the Graduate College of the University of Illinois at Urbana-Champaign, 2018 Urbana, Illinois Doctoral Committee: Assistant Professor Thomas Faulkner, Chair Professor Michael Stone, Director of Research Professor Peter Abbamonte Assistant Professor Lucas Wagner Abstract Quantum quench is a non-equilibrium process where the Hamiltonian is suddenly changed during the quan- tum evolution. The change can be made by spatially local perturbations (local quench) or globally switch- ing to a completely different Hamiltonian (global quench). This thesis investigates the post-quench non- equilibrium dynamics with an emphasis on the time dependence of the quantum entanglement. We inspect the scaling of entanglement entropy (EE) to learn how correlation and entanglement built up in a quench. We begin with two local quench examples. In Chap.2, we apply a local operator to the groundstate of the quantum Lifshitz model and monitor the change of the EE. We find that the entanglement grows according to the dynamical exponent z = 2 and then saturates to the scaling dimension of the perturbing operator { a value representing its strength. In Chap.3, we study the evolution after connecting two different one-dimensional critical chains at their ends. The Loschmidt echo which measures the similarity between the evolved state and the initial one decays with a power law, whose exponent is the scaling dimension of the defect (junction). Among other conclusions, we see that the local quench dynamics contain universal information of the (critical) theory.
    [Show full text]