With the development of topological field theory, the mathematical tool of the tensor category was also introduced into physics. Traditional group theory corresponds to a special category,group category. Tensor categories can describe higher-order interactions and symmetric relations, while group theory can only describe first-order interactions. In fact, the quantum circuit itself constitutes a category. However, at present, the field of quantum computing mainly uses group theory as a mathematical tool. If category theory is introduced into the field of quantum simulation, the application scope of quantum computers can be greatly expanded. This paper propose a new dynamic simulation method,categorical quantum simulation. In our paradigm quantum simulation is no longer based on the structure of the group theory, but based on the structure of the tensor category. This could enable many systems that could not be efficiently quantum simulated before.In this article we give an concrete example of the categorical simulation of $SU(3)$ Yang-Mills theory. It shows that categorical quantum simulation provides a new encoding method,emergenism encoding, which saves more qubits resources than reductionism quantum encoding. In addition, many domains can be described in the language of category theory, which allows quantum circuits to directly encode and simulate these domains.
With the development of topological field theory, the mathematical tool of the tensor category was also introduced into physics. Traditional group theory corresponds to a special category,group category. Tensor categories can describe higher-order interactions and symmetric relations, while group theory can only describe first-order interactions. In fact, the quantum circuit itself constitutes a category. However, at present, the field of quantum computing mainly uses group theory as a mathematical tool. If category theory is introduced into the field of quantum simulation, the application scope of quantum computers can be greatly expanded. This paper propose a new dynamic simulation method,categorical quantum simulation. In our paradigm quantum simulation is no longer based on the structure of the group theory, but based on the structure of the tensor category. This could enable many systems that could not be efficiently quantum simulated before.In this article we give an concrete example of the categorical simulation of SU(3) Yang-Mills theory. It shows that categorical quantum simulation provides a new encoding method,emergenism encoding, which saves more qubits resources than reductionism quantum encoding. In addition, many domains can be described in the language of category theory, which allows quantum circuits to directly encode and simulate these domains.
Quantum computers promise to simulate complex quantum field theories that are intractable for classical computers, potentially revealing new physics in strongly interacting systems. Current approaches for simulating Yang-Mills gauge theories face significant technical barriers due to complex group structures and complicated truncation schemes that vary drastically between different theories. Here we show that the orbifold lattice formulation provides a universal framework for quantum simulation of Yang-Mills theories with arbitrary gauge groups and dimensions. Our approach reduces all theories to the same simple Hamiltonian form, enabling implementation with standard quantum gates regardless of system complexity. We demonstrate explicit quantum circuits using only controlled-NOT and single-qubit operations, with concrete resource estimates for time evolution algorithms. This universal framework simplifies quantum simulation of gauge theories and enables systematic scaling to larger systems on fault-tolerant quantum computers.
This paper explores the application of category theory to provide a semantic framework for quantum vector spaces, which are fundamental to quantum mechanics and quantum information. We move beyond the traditional algebraic and analytical descriptions of Hilbert spaces to adopt a more abstract, compositional, and graphical approach rooted in monoidal categories. This categorical perspective allows for a unified understanding of quantum phenomena, including superposition, entanglement, and measurement, by representing quantum systems as objects and processes as morphisms. We delve into the concept of compact closed categories and dagger symmetric monoidal categories as the appropriate mathematical structures to capture the essential features of quantum theory, such as duality, adjoints, and the tensor product for composite systems. Furthermore, the paper discusses how graphical calculi, arising from these categorical structures, offer an intuitive and rigorous method for reasoning about quantum protocols and computations, facilitating the design and verification of quantum algorithms. By providing a high-level, axiomatic framework, categorical semantics clarifies the foundational principles of quantum mechanics and opens new avenues for developing quantum programming languages and understanding the interplay between quantum information and computation.
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.
Simulating quantum mechanics is known to be a difficult computational problem, especially when dealing with large systems. However, this difficulty may be overcome by using some controllable quantum system to study another less controllable or accessible quantum system, i.e., quantum simulation. Quantum simulation promises to have applications in the study of many problems in, e.g., condensed-matter physics, high-energy physics, atomic physics, quantum chemistry, and cosmology. Quantum simulation could be implemented using quantum computers, but also with simpler, analog devices that would require less control, and therefore, would be easier to construct. A number of quantum systems such as neutral atoms, ions, polar molecules, electrons in semiconductors, superconducting circuits, nuclear spins, and photons have been proposed as quantum simulators. This review outlines the main theoretical and experimental aspects of quantum simulation and emphasizes some of the challenges and promises of this fast-growing field.
Applied category theory provides powerful mathematical tools for modelling processes and their composition. Symmetric monoidal categories, which involve series and parallel composition, are particularly well-suited for describing the composition of processes in space and time. Also called process theories, they admit string diagrams, which constitute a visually intuitive, mathematically rigorous, expressive and flexible syntax that is applicable to wide-ranging scientific domains. In this thesis, we employ string diagrams to investigate a selection of topics in the areas of quantum foundations, computing, and natural language processing. We report three main contributions: • We formalise constructor theory as a process theory. In the context of quantum physics, we also demonstrate the conflict between constructor-theoretic principles of locality and composition. Moreover, we argue that if the principle of locality is rejected, categorical quantum mechanics (CQM) can be conceived as a constructor theory of quantum physics. • We develop a formalism for wave-based logic circuits with phase encoding. We motivate the formalism using the example of spin-wave circuits, and then demonstrate its utility in design, analysis and optimisation of Boolean logic circuits. • We investigate the elimination of inter-language grammatical bureaucracy in the distributional compositional circuits (DisCoCirc) framework. In particular, we develop a hybrid grammar for a restricted fragment of the Urdu language, and show that Urdu text endowed with this hybrid grammar maps surjectively to DisCoCirc text circuits. Furthermore, we show that for the same language fragment, Urdu and English text circuits become the same up to gate-level translation. The aforementioned work supports the view that a process-relational outlook in science is well-supported by applied category-theoretic tools, particularly string diagrams.
Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described by models which we cannot solve with sufficient accuracy, neither analytically nor numerically with classical computers. Using a quantum computer to simulate such quantum systems has been viewed as a key application of quantum computation from the very beginning of the field in the 1980s. Moreover, useful results beyond the reach of classical computation are expected to be accessible with fewer than a hundred qubits, making quantum simulation potentially one of the earliest practical applications of quantum computers. In this paper we survey the theoretical and experimental development of quantum simulation using quantum computers, from the first ideas to the intense research efforts currently underway.