相关论文: A diagrammatic approach to map-state and channel-s…

Classical simulation of quantum physics is a central approach to investigating physical phenomena. Quantum computers enhance computational capabilities beyond those of classical resources, but it remains unclear to what extent existing…

Situated as a language between computer science, quantum physics and mathematics, tensor network theory has steadily grown in popularity and can now be found in applications ranging across the entire field of quantum information processing.…

Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…

Efficient methods for the representation and simulation of quantum states and quantum operations are crucial for the optimization of quantum circuits. Decision diagrams (DDs), a well-studied data structure originally used to represent…

Area preserving maps provide the simplest and most accurate means to visualize and quantify the behavior of nonlinear systems. Convenience of the mapping equations of motion for investigation of transition to chaotic behavior in dynamics of…

The representation of numbers by tensor product states of composite quantum systems is examined. Consideration is limited to k-ary representations of length L and arithmetic modulo k^{L}. An abstract representation on an L fold tensor…

Simulating quantum circuits on classical computers is a notoriously hard, yet increasingly important task for the development and testing of quantum algorithms. In order to alleviate this inherent complexity, efficient data structures and…

On networks representing probability currents between states of a system, we generalize Schnakenberg's theory of nonequilibrium observables to nonsteady states, with the introduction of a new set of macroscopic observables that, for planar…

In recent years, diagrammatic languages have been shown to be a powerful and expressive tool for reasoning about physical, logical, and semantic processes represented as morphisms in a monoidal category. In particular, categorical quantum…

We give an introduction to the theory of multi-partite entanglement. We begin by describing the "coordinate system" of the field: Are we dealing with pure or mixed states, with single or multiple copies, what notion of "locality" is being…

The computational power of quantum computers poses major challenges to new design tools since representing pure quantum states typically requires exponentially large memory. As shown previously, decision diagrams can reduce these memory…

Molecular graphs generally contain subgraphs (known as groups) that are identifiable and significant in composition, functionality, geometry, etc. Flat latent representations (node embeddings or graph embeddings) fail to represent, and…

Neural networks are being used to improve the probing of the state spaces of many particle systems as approximations to wavefunctions and in order to avoid the recurring sign problem of quantum monte-carlo. One may ask whether the usual…

Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…

We investigate an original family of quantum distinguishability problems, where the goal is to perfectly distinguish between $M$ quantum states that become identical under a completely decohering map. Similarly, we study distinguishability…

A class of quantum protocols to teleport bipartite (entangled) states of two qubits is suggested. Our schemes require a single entangled pair shared by the two parties and the transmission of three bits of classical information, as well as…

The quantum switch is a higher-order operation that takes as an input two quantum processes and combines them in a coherent superposition of two alternative orders. Here we provide an approach to the quantum switch based on the methods of…

This paper is intended to be a pedagogical introduction to quantum Bayesian networks (QB nets), as I personally use them to represent mixed states (i.e., density matrices, and open quantum systems). A special effort is made to make contact…

The graph state formalism offers strong connections between quantum information processing and graph theory. Exploring these connections, first we show that any graph is a pivot-minor of a planar graph, and even a pivot minor of a…

In this article we show the duality between tensor networks and undirected graphical models with discrete variables. We study tensor networks on hypergraphs, which we call tensor hypernetworks. We show that the tensor hypernetwork on a…