Related papers: Sinkhorn algorithm for quantum permutation groups
We initiate a systematic study of quantum properties of finite graphs, namely, quantum asymmetry, quantum symmetry, and quantum isomorphism. We define the Schmidt alternative for a class of graphs, which reveals to be a useful tool for…
The representations of the observable algebra of a low dimensional quantum field theory form the objects of a braided tensor category. The search for gauge symmetry in the theory amounts to finding an algebra which has the same…
The meaning of quantum group transformation properties is discussed in some detail by comparing the (co)actions of the quantum group with those of the corresponding Lie group, both of which have the same algebraic (matrix) form of the…
We introduce the notion of noncommutative complex spheres with partial commutation relations for the coordinates. We compute the corresponding quantum symmetry groups of these spheres, and this yields new quantum unitary groups with partial…
We investigate the completely positive semidefinite cone $\mathcal{CS}_+^n$, a new matrix cone consisting of all $n\times n$ matrices that admit a Gram representation by positive semidefinite matrices (of any size). In particular we study…
Practical success of quantum learning models hinges on having a suitable structure for the parameterized quantum circuit. Such structure is defined both by the types of gates employed and by the correlations of their parameters. While much…
We construct Quantum Representation Theory which describes quantum analogue of representations in frame of "non-commutative linear geometry" developed by Manin. To do it we generalise the internal hom-functor to the case of adjunction with…
Quantum networks are promising tools for the implementation of long-range quantum communication. The characterization of quantum correlations in networks and their usefulness for information processing is therefore central for the progress…
It is known that any quantum algorithm for Graph Isomorphism that works within the framework of the hidden subgroup problem (HSP) must perform highly entangled measurements across \Omega(n \log n) coset states. One of the only known models…
We give a classical algorithm for linear regression analogous to the quantum matrix inversion algorithm [Harrow, Hassidim, and Lloyd, Physical Review Letters'09, arXiv:0811.3171] for low-rank matrices [Wossnig, Zhao, and Prakash, Physical…
We present a conceptually new approach to describe state-of-the-art photonic quantum experiments using Graph Theory. There, the quantum states are given by the coherent superpositions of perfect matchings. The crucial observation is that…
In this paper we will demonstrate that any compact quantum group can be used as symmetry groups for quantum channels, which leads us to the concept of covariant channels. We, then, unearth the structure of the convex set of covariant…
Invariant theory is concerned with functions that do not change under the action of a given group. Here we communicate an approach based on tensor networks to represent polynomial local unitary invariants of quantum states. This graphical…
We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different…
Let G be a finite subgroup of unitary matrices acting on the space of $N$-qubits. We associate with G a uniform quantum channel QU from the space on $N$-qubits to itself. We give a quantum algorithm to approximate this channel by…
We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…
In the age of noisy quantum processors, the exploitation of quantum symmetries can be quite beneficial in the efficient preparation of trial states, an important part of the variational quantum eigensolver algorithm. The benefits include…
We present a quantum variational algorithm based on a novel circuit that generates all permutations that can be spanned by one- and two-qubits permutation gates. The construction of the circuits follows from group-theoretical results, most…
This is a systematic introduction for physicists to the theory of algebras and groups with braid statistics, as developed over the last three years by the author. There are braided lines, braided planes, braided matrices and braided groups…
Machine learning is becoming an increasingly valuable tool in mathematics, enabling one to identify subtle patterns across collections of examples so vast that they would be impossible for a single researcher to feasibly review and analyze.…