Related papers: Graph States and the Variety of Principal Minors
This PhD thesis is dedicated to the study of the interplay between symmetries of quantum states and their self-similar properties. It consists of three connected threads of research: polynomial invariants for multiphoton states,…
We construct families of graphs from linear groups $\mathrm{SL}(2,q)$, $\mathrm{GL}(2,q)$ and $\mathrm{GU}(2,q^2)$, where $q$ is an odd prime power, with the property that the continuous-time quantum walks on the associated networks of…
A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, stabilizer states),…
Let $\mathcal{A}_n^k$ denote all nonbounding effective smooth $({\Bbb Z}_2)^k$-actions on $n$-dimensional smooth closed connected manifolds, each of which is cobordant to one with finite fixed set. Motivated by GKM theory, one can associate…
Graph states are computationally powerful quantum states with many applications including use as resource states for measurement-based quantum computing (MBQC). We demonstrate construction of graph states on a Rydberg atom quantum analogue…
The entanglement properties of a multiparty pure state are invariant under local unitary transformations. The stabilizer dimension of a multiparty pure state characterizes how many types of such local unitary transformations existing for…
We study the computational complexity of quantum state isomorphism problems under group actions: given two quantum circuits that prepare pure or mixed states, decide whether the two states are related by a group action. This can be seen as…
In this article we further investigate the construction of graph coherent states, first introduced in [1], in the context of loop quantum gravity. We specifically investigate the possibility of defining a family of graph coherent states…
Graph states are a powerful class of entangled states with numerous applications in quantum communication and quantum computation. Local Clifford (LC) operations that map one graph state to another can alter the structure of the…
This article delves into an analysis of the intrinsic entanglement and separability feature in quantum states as depicted by graph Laplacian. We show that the presence or absence of edges in the graph plays a pivotal role in defining the…
Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a…
The classification of stabilizer states under local Clifford (LC) equivalence is of particular importance in quantum error-correction and measurement-based quantum computation. Two stabilizer states are called LC equivalent if there exists…
This work studies how a suitably-designed classical system generates with a quantum-like (QL) state space mediated by a graph. The graph plays a special dual role by directing the topology of the classical network and defining a state space…
An important question of quantum information is to characterize genuinely quantum (beyond-Clifford) resources necessary for universal quantum computing. Here, we use the Pauli spectrum to quantify how magic, beyond Clifford, typical…
For any graph $G$ of order $n$ with degree sequence $d_{1}\geq\cdots\geq d_{n}$, we define the double Slater number $s\ell_{\times2}(G)$ as the smallest integer $t$ such that $t+d_{1}+\cdots+d_{t-e}\geq2n-p$ in which $e$ and $p$ are the…
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…
Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which…
We introduce the concept of group state transfer on graphs, summarize its relationship to other concepts in the theory of quantum walks, set up a basic theory, and discuss examples. Let $X$ be a graph with adjacency matrix $A$ and consider…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Circle graph states are a structurally important family of graph states. The family's entanglement is a priori high enough to allow for universal measurement-based quantum computation (MBQC); however, MBQC on circle graph states is actually…