Related papers: Stateless Quantum Structures and Extremal Graph Th…
We introduce algebriac sets in the products of complex projective spaces for multipartite mixed states, which are independent of their eigenvalues and only measure the "position" of their eigenvectors, as their non-local invariants (ie.…
The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions were explored using Artificial intelligence and SAT solvers…
We investigate the bottom of the spectra of infinite quantum graphs, i.e., Laplace operators on metric graphs having infinitely many edges and vertices. We introduce a new definition of the isoperimetric constant for quantum graphs and then…
We introduce quantum hypercube states, a class of continuous-variable quantum states that are generated as orthographic projections of hypercubes onto the quadrature phase-space of a bosonic mode. In addition to their interesting geometry,…
We prove an upper bound for the number of edges a C4-free graph on q^2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q.
Let $m$ denote the number of quasielectrons (QEs) in a quantum Hall system containing $N$ particles altogether. We show in several general cases that for systems containing $m$ QEs in a single angular momentum shell above $N-m$ Fermions in…
A graph is maximal knotless if it is edge maximal for the property of knotless embedding in $R^3$. We show that such a graph has at least $\frac74 |V|$ edges, and construct an infinite family of maximal knotless graphs with $|E| <…
Random quantum states have various applications in quantum information science. We discover a new ensemble of quantum states that serve as an $\epsilon$-approximate state $t$-design while possessing extremely low entanglement, magic, and…
Weighted graph states are a natural generalization of graph states, which are generated by applying controlled-phase gates, instead of controlled-Z gates, to a separable state. In this paper, we show that uniformly weighted graph states on…
We demonstrate that absolutely maximally entangled (AME) states consisting of $N=4n$ qudits with $n\in\{1,2,3,...\}$, each of even local dimension, cannot be realized as graph states. This result imposes strong constraints on AME states in…
We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…
A discrete analog of quantum unique ergodicity was proved for Cayley graphs of quasirandom groups by Magee, Thomas and Zhao. They show that for large graphs there exist real orthonormal basis of eigenfunctions of the adjacency matrix such…
In this paper, we demonstrate that it is possible to create an adiabatic quantum computing algorithm that solves the shortest path between any two vertices on an undirected graph with at most 3V qubits, where V is the number of vertices of…
Programmable quantum systems based on Rydberg atom arrays have recently emerged as a promising testbed for combinatorial optimization. Indeed, the Maximum Weighted Independent Set problem on unit-disk graphs can be efficiently mapped to…
These lecture notes cover 13 sessions and are presented as an e-print, intended to evolve over time. Quantum invariants do more than distinguish topological objects; they build bridges between topology, algebra, number theory and quantum…
Atomic gases confined in curved geometries are characterized by distinctive features that are absent in their flat counterparts, such as periodic boundaries, local curvature, and nontrivial topologies. The recent experiments with…
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of $G$ to a sequence of horizontal…
Quantum gravity is studied nonperturbatively in the case in which space has a boundary with finite area. A natural set of boundary conditions is studied in the Euclidean signature theory, in which the pullback of the curvature to the…
We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups ${\mathbb Z}_n$, symmetric groups $S_n$ and quantum symmetric groups…
In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erd\H{o}s-R\'{e}nyi model or the Barab\'{a}si-Albert model. Unfortunately, most graph generating…