Related papers: Weight of quadratic forms and graph states
We address the question of quantifying entanglement in pure graph states. Evaluation of multipartite entanglement measures is extremely hard for most pure quantum states. In this paper we demonstrate how solving one problem in graph theory,…
We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graph, and show…
We study the entanglement between a certain qubit and the remaining system in rank- 2 mixed states prepared on the quantum computer. The protocol, which we propose for this purpose, is based on the relation of geometric measure of…
In this letter we have established the physical character of pure bipartite states with the same amount of entanglement in the same Schmidt rank that either they are local unitarily connected or they are incomparable. There exist infinite…
We present a novel spectral embedding of graphs that incorporates weights assigned to the nodes, quantifying their relative importance. This spectral embedding is based on the first eigenvectors of some properly normalized version of the…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
The thesis showcases the importance of tomograms in quantifying nonclassical effects such as wavepacket revivals, squeezing, and quantum entanglement in continuous-variable, hybrid quantum, and qubit systems. This approach avoids…
The thesis includes the original results of our articles [30, 37, 40, 42, 51, 53, 75]. A method is developed to compute analytically entanglement measures of three-qubit pure states. Owing to it closed-form expressions are presented for the…
These notes accompany a lecture about the topology of symplectic (and other) quotients. The aim is two-fold: first to advertise the ease of computation in the symplectic category; and second to give an account of some new computations for…
Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating the partition function of edge-weighted matchings in a bipartite graph.…
Any graph can be represented pictorially as a figure. Moreover, it can be represented as two or more figures that can be have different properties to each other. For the purpose of HCP, we represent a graph by two such figures. In each of…
The Schmidt number characterizes the quantum entanglement of a bipartite mixed state and plays a significant role in certifying entanglement of quantum states. We derive a Schmidt number criterion based on the trace norm of the correlation…
In 2010, Cassidy and Vancliff extended the notion of a quadratic form on n generators to the noncommutative setting. In this article, we suggest a notion of rank for such noncommutative quadratic forms, where n = 2 or 3. Since writing an…
This is the first paper in a series devoted to understanding the classical and quantum nature of edge modes and symmetries in gravitational systems. The goal of this analysis is to: i) achieve a clear understanding of how different…
A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…
It is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflection positivity and exponential rank-connectivity. In terms…
We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…
Representing graphs as quantum states is becoming an increasingly important approach to study entanglement of mixed states, alternate to the standard linear algebraic density matrix-based approach of study. In this paper, we propose a…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
We introduce the notion of a Schmidt number of a bipartite density matrix, characterizing the minimum Schmidt rank of the pure states that are needed to construct the density matrix. We prove that Schmidt number is nonincreasing under local…