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 unification 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 problem which has several appealing features. Specifically, given an n-body quantum state |ψ〉, we present a new and general method to factor |ψ〉 into a tensor network of clearly defined building blocks. We use the solution to expose a previously unknown 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.
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 unification 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 problem which has several appealing features. Specifically, given an n-body quantum state |ψ〉, we present a new and general method to factor |ψ〉 into a tensor network of clearly defined building blocks. We use the solution to expose a previously unknown 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.
In this paper, we extend previous work carried out on the application of the mathematics of category theory to quantum information science.Specifically, we present a realization of a dagger-compact category that can model finitedimensional quantum systems and explicitly allows for the interaction of systems of arbitrary, possibly unequal, dimensions.Hence, our framework can handle generic tensor network states, including matrix product states.Our categorical model subsumes the traditional quantum circuit model while remaining directly and easily applicable to problems stated in the language of quantum information science.The circuit diagrams themselves now become morphisms in a category, making quantum circuits a special case of a much more general mathematical framework.We introduce the key algebraic properties of our tensor calculus diagrammatically and show how they can be applied to solve problems in the field of quantum information.
Tensor network theory and quantum simulation are, respectively, the key classical and quantum computing methods in understanding quantum many-body physics. Here, we introduce the framework of hybrid tensor networks with building blocks consisting of measurable quantum states and classically contractable tensors, inheriting both their distinct features in efficient representation of many-body wave functions. With the example of hybrid tree tensor networks, we demonstrate efficient quantum simulation using a quantum computer whose size is significantly smaller than the one of the target system. We numerically benchmark our method for finding the ground state of 1D and 2D spin systems of up to 8×8 and 9×8 qubits with operations only acting on 8+1 and 9+1 qubits, respectively. Our approach sheds light on simulation of large practical problems with intermediate-scale quantum computers, with potential applications in chemistry, quantum many-body physics, quantum field theory, and quantum gravity thought experiments.
The content of this paper can be roughly organized into a three-level hierarchy of generality. At the first, most general level, we introduce a new language which allows us to express various categorical structures in a systematic and explicit manner in terms of so-called 2-schemes. Although 2-schemes can formalize categorical structures such as symmetric monoidal categories, they are not limited to this, and can be used to define structures with no categorical analogue. Most categorical structures come with an effective graphical calculus such as string diagrams for symmetric monoidal categories, and the same is true more generally for interesting 2-schemes. In this work, we focus on one particular non-categorical 2-scheme, whose instances we refer to as tensor types. At the second level of the hierarchy, we work out different flavors of this 2-scheme in detail. The effective graphical calculus of tensor types is that of tensor networks or Penrose diagrams, that is, string diagrams without a flow of time. As such, tensor types are similar to compact closed categories, though there are various small but potentially important differences. Also, the two definitions use completely different mechanisms despite both being examples of 2-schemes. At the third level of the hierarchy, we provide a long list of different families of concrete tensor types, in a way which makes them accessible to concrete computations, motivated by their potential use in physics. Different tensor types describe different types of physical models, such as classical or quantum physics, deterministic or statistical physics, many-body or single-body physics, or matter with or without symmetries or fermions.
Strongly correlated systems exhibit phenomena -- such as high-T_c 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. While any state can be written as a tensor network state, the number of parameters needed for the description might be too large. This is not the case for one-dimensional systems: only a few parameters are required to have a good approximation of their ground states; that, in turn, allows for numerical algorithms based on tensor networks performing well. The situation in two dimensions is somewhat more complicated, but it is known that ground states of local Hamiltonians can be expressed as tensor networks with sub-exponentially many parameters. In the present thesis, we improve on these existing bounds strengthening the claim that the language of tensor networks is suitable to describe many-body systems. Another central question is how symmetries of the system such as translational invariance, time-reversal symmetry or local unitary symmetry can be reflected in tensor networks. This question is important as systems appearing in nature might intrinsically possess certain symmetries; on one hand, understanding these symmetries simplifies the description of these systems. On the other hand, the presence of symmetries leads to the appearance of novel phases -- symmetry-protected topological (SPT) order, -- and tensor networks provide the right language to classify these phases. In one dimension and for certain classes of two-dimensional tensor networks (states generated by so-called injective tensors) it is well understood how symmetries of the state can be described. A general framework, however, has yet to be developed. In the present thesis, we contribute to the development of the theory in two ways. We first investigate the question for injective tensors, and generalize the existing proof for any geometry including the hyperbolic geometry used in the AdS/CFT correspondence. Second, we introduce a class of tensor network states that include previously known examples of states exhibiting SPT order. We show how symmetries are reflected in these states thus deepening the understanding of SPT order in two dimensions.
The intuitiveness of the tensor network graphical language is becoming well known through its use in numerical simulations using methods from tensor network algorithms. Recent times have also seen rapid progress in developing equations of motion to predict the time evolution of quantum entanglement [Nature Physics, 4(\textbf{4}):99, 2008]. Here we cast these recent results into a tensor network framework and in doing so, construct a theory which exposes the topological equivalence of the evolution of a family of entanglement monotones in arbitrary dimensions. This unification was accomplished by tailoring a form of channel state duality through the interpretation of graphical tensor network rewrite rules. The introduction of tensor network methods to the theory of entanglement evolution opens the door to apply methods from the rapidly evolving area known as tensor network states.
Tensor networks provide succinct representations of quantum many-body states and are an important computational tool for strongly correlated quantum systems. Their expressive and computational power is characterized by an underlying entanglement structure, on a lattice or more generally a (hyper)graph, with virtual entangled pairs or multipartite entangled states associated to (hyper)edges. Changing this underlying entanglement structure into another can lead to both theoretical and computational benefits. We study a natural resource theory which generalizes the notion of bond dimension to entanglement structures using multipartite entanglement. It is a direct extension of resource theories of tensors studied in the context of multipartite entanglement and algebraic complexity theory, allowing for the application of the sophisticated methods developed in these fields to tensor networks. The resource theory of tensor networks concerns both the local entanglement structure of a quantum many-body state and the (algebraic) complexity of tensor network contractions using this entanglement structure. We show that there are transformations between entanglement structures which go beyond edge-by-edge conversions, highlighting efficiency gains of our resource theory that mirror those obtained in the search for better matrix multiplication algorithms. We also provide obstructions to the existence of such transformations by extending a variety of methods originally developed in algebraic complexity theory for obtaining complexity lower bounds. The resource theory of tensor networks allows to compare different entanglement structures and should lead to more efficient tensor network representations and contraction algorithms.