Related papers: Combinatorial Entanglement
Gram matrix approach to an entanglement analysis of pure states describing $(d,\infty)$ -- quantum systems is being introduced. In particular, maximally entangled states are described as those having a special forms of the corresponding…
Counting problems, determining the number of possible states of a large system under certain constraints, play an important role in many areas of science. They naturally arise for complex disordered systems in physics and chemistry, in…
Quantum computers can be considered as a natural means for performing machine learning tasks for inherently quantum labeled data. Many quantum machine learning techniques have been developed for solving classification problems, such as…
Using a graph approach to quantum systems, we prove that descriptions of 3-dim Kochen-Specker (KS) setups as well as descriptions of 3-dim spin systems by means of Greechie lattices that we find in the literature are wrong. Correct lattices…
The study of multipartite entanglement is much less developed than the bipartite scenario. Recently, a string of results have proposed using tools from Topological Data Analysis (TDA) to attach topological quantities to multipartite states.…
We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs. An expression for the entanglement distance for multi-qubit states corresponding to arbitrary tripartite graph structures is…
This paper presents a new graph isomorphism invariant, called $\mathfrak{w}$-labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism problem for various graph classes. For example, all…
Quantum graph states are critical resources for various quantum algorithms, and also determine essential interconnections in distributed quantum computing. There are two schemes for generating graph states probabilistic scheme and…
For graph classification tasks, many traditional kernel methods focus on measuring the similarity between graphs. These methods have achieved great success on resolving graph isomorphism problems. However, in some classification problems,…
We introduce examples of three- and four-mode entangled Gaussian mixed states that are not detected by the scaling and Peres-Horodecki separability criteria. The presented modification of the scaling criterion resolves this problem. Also it…
Conditional correlation networks, within Gaussian Graphical Models (GGM), are widely used to describe the direct interactions between the components of a random vector. In the case of an unlabelled Heterogeneous population, Expectation…
Graph states are a key resource for a number of applications in quantum information theory. Due to the inherent noise in noisy intermediate-scale quantum (NISQ) era devices, it is important to understand the effects noise has on the…
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…
The entanglement spectroscopy, initially introduced by Li and Haldane in the context of the fractional quantum Hall effects, has stimulated an extensive range of studies. The entanglement spectrum is the spectrum of the reduced density…
We consider graph states generated by the action of controlled phase shift operators on a separable state of a multi-qubit system. The case when all the qubits are initially prepared in arbitrary states is investigated. We obtain the…
Multi-photon entangled graph states are a fundamental resource in quantum communication networks, distributed quantum computing, and sensing. These states can in principle be created deterministically from quantum emitters such as optically…
Projected Entangled Pair States (PEPS) are recognized as a potent tool for exploring two-dimensional quantum many-body systems. However, a significant challenge emerges when applying conventional PEPS methodologies to systems with periodic…
We give combinatorial proofs of some enumeration formulas involving labelled threshold, quasi-threshold, loop-threshold and quasi-loop-threshold graphs. In each case we count by number of vertices and number of components. For threshold…
We introduce techniques for analysing the structure of quantum states of many-body localized (MBL) spin chains by identifying correlation clusters from pairwise correlations. These techniques proceed by interpreting pairwise correlations in…
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…