Related papers: Stateless Quantum Structures and Extremal Graph Th…
It has recently been pointed out that phases of matter with intrinsic topological order, like the fractional quantum Hall states, have an extra dynamical degree of freedom that corresponds to quantum geometry. Here we perform extensive…
We investigate a graph-theoretic approach to the problem of distinguishing quantum product states in the fundamental quantum communication framework called local operations and classical communication (LOCC). We identify chordality as the…
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…
I investigate the extent to which the description of quantum systems by Gibbs states can be justified purely on the basis of tomographic data, without recourse to theoretical concepts such as infinite ensembles, environments, information,…
Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation…
We introduce a new top down approach to canonical quantum gravity, called Algebraic Quantum Gravity (AQG):The quantum kinematics of AQG is determined by an abstract $*-$algebra generated by a countable set of elementary operators labelled…
The most irreducible way to represent information is a sequence of two symbols. In this paper, we construct quantum states using this basic building block. Specifically, we show that the probabilities that arise in quantum theory can be…
The `global' Zarankiewicz problem for hypergraphs asks for an upper bound on the number of edges of a finite $r$-hypergraph $V$ in terms of the number $|V|$ of its vertices, assuming the edge relation is induced by a fixed $K_{k, \dots,…
If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…
Quantum algorithms are usually described as monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only manage a small number of qubits. We develop an automated method to distribute quantum circuits…
We construct families of cell complexes that generalize expander graphs. These families are called non-$k$-hyperfinite, generalizing the idea of a non-hyperfinite (NH) family of graphs. Roughly speaking, such a complex has the property that…
We study a family of closed quantum graphs described by one singular vertex of order n=4. By suitable choice of the parameters specifying the singular vertex, we can construct a closed sequence of paths in the parameter space that…
We propose a topological understanding of the quantum spin Hall state without considering any symmetries, and it follows from the gauge invariance that either the energy gap or the spin spectrum gap needs to close on the system edges, the…
The fundamental theorem of Tur\'{a}n from Extremal Graph Theory determines the exact bound on the number of edges $t_r(n)$ in an $n$-vertex graph that does not contain a clique of size $r+1$. We establish an interesting link between…
We present quantum simulation experiments of Ising-like spins on Platonic graphs, which are performed with two-dimensional arrays of Rydberg atoms and quantum-wire couplings. The quantum wires are used to couple otherwise uncoupled…
We investigate quantum tomography in scenarios where prior information restricts the state space to a smooth manifold of lower dimensionality. By considering stability we provide a general framework that relates the topology of the manifold…
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 describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number $k \ge 0$ of hamiltonian cycles, which is especially efficient for small $k$. Our main findings, combining applications of this algorithm…
Fractional quantum Hall-superconductor heterostructures may provide a platform towards non-abelian topological modes beyond Majoranas. However their quantitative theoretical study remains extremely challenging. We propose and implement a…
We study the notion of $k$-stabilizer universal quantum state, that is, an $n$-qubit quantum state, such that it is possible to induce any stabilizer state on any $k$ qubits, by using only local operations and classical communications.…