Related papers: Quantum symmetry vs nonlocal symmetry

We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…

In quantum information, nonlocal games are particularly useful for differentiating classical, quantum, and non-signalling correlations. An example of differentiation is given by the principle of no-collapse of communication complexity,…

The relation between symmetry reduction before and after quantization of a field theory is discussed using a toy model: the axisymmetric Klein-Gordon field. We consider three possible notions of symmetry at the quantum level: invariance…

One of the most important questions in quantum information theory is the so-called separability problem. It involves characterizing the set of separable (or, equivalently entangled) states among mixed states of a multipartite quantum…

We discuss generalizations of the notion of i) the group of unitary elements of a (real or complex) finite dimensional C*-algebra, ii) gauge transformations and iii) (real) automorphisms, in the framework of compact quantum group theory and…

Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…

In this article the geometry of quantum gravity is quantized in the sense of being noncommutative (first quantization) but it is also quantized in the sense of being emergent (second quantization). A new mechanism for quantum geometry is…

This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…

A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…

The graph isomorphism (GI) problem is the computational problem of finding a permutation of vertices of a given graph $G_1$ that transforms $G_1$ to another given graph $G_2$ and preserves the adjacency. In this work, we propose a quantum…

The relation between genuine multipartite entanglement in the pure state of a collection of N qubits and the nonclassical correlations in its two-qubit subsystems is studied. Quantum discord is used as the quantifier of nonclassical…

In 2007, Banica and Bichon asked whether the well-known Petersen graph has quantum symmetry. In this article, we show that the Petersen graph has no quantum symmetry, i.e. the quantum automorphism group of the Petersen graph is its usual…

The unique entanglement measure is concurrence in a 2-qubit pure state. The maximum violation of Bell's inequality is monotonically increasing for this quantity. Therefore, people expect that pure state entanglement is relevant to the…

We develop a complete theory of symmetry and topology in non-Hermitian physics. We demonstrate that non-Hermiticity ramifies the celebrated Altland-Zirnbauer symmetry classification for insulators and superconductors. In particular, charge…

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…

We study several noncommutative properties of 0-hyperbolic graphs. In particular, we prove that 0-hyperbolicity is preserved under quantum isomorphism. We also compute the quantum automorphism groups of 0-hyperbolic graphs and characterise…

Quantum hypergraph states are the natural generalization of graph states. Here we investigate and analytically quantify entanglement and nonlocality for large classes of quantum hypergraph states. More specifically, we connect the geometric…

In this paper we study the non-local properties of permutation symmetric states of n-qubits. We extend the bipartite Hardy paradox and the associated CH-inequality to n-party permutation symmetric states to show that all symmetric states…

Quite often real-world networks can be thought of as being symmetric, in the abstract sense that vertices can be found to have similar or equivalent structural roles. However, traditional measures of symmetry in graphs are based on their…

Quantum entanglement and nonlocality are inequivalent notions: There exist entangled states that nevertheless admit local-realistic interpretations. This paper studies a special class of local-hidden-variable theories, in which the linear…