Related papers: Quantum Systems on Non-$k$-Hyperfinite Complexes: …
Holonomic Quantum Computation (HQC) is an all-geometrical approach to quantum information processing. In the HQC strategy information is encoded in degenerate eigen-spaces of a parametric family of Hamiltonians. The computational network of…
The notion of families of quantum invertible maps ($C^*$-algebra homomorphisms satisfying Podle\'s condition) is employed to strengthen and reinterpret several results concerning universal quantum groups acting on finite quantum spaces. In…
The {\em overlap number} of a finite $(d+1)$-uniform hypergraph $H$ is defined as the largest constant $c(H)\in (0,1]$ such that no matter how we map the vertices of $H$ into $\R^d$, there is a point covered by at least a $c(H)$-fraction of…
We analytically explore the scaling properties of a general class of nested subgraphs in complex networks, which includes the $K$-core and the $K$-scaffold, among others. We name such class of subgraphs $K$-nested subgraphs due to the fact…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
One of the interesting topics in quantum contextuality is the construction for various non-contextual inequalities. By introducing a new structure called hyper-graph, we present a general method, which seems to be analytic and extensible,…
We define algebraic families of (all) morphisms which are purely algebraic analogs of quantum families of (all) maps introduced by P.M. Soltan. Also, algebraic families of (all) isomorphisms are introduced. By using these notions we…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
We present a general method to convert algorithms into faster algorithms for almost-regular input instances. Informally, an almost-regular input is an input in which the maximum degree is larger than the average degree by at most a constant…
The first goal of the article is to solve several fundamental problems in the theory of holomorphic bundles over non-algebraic manifolds: For instance we prove that stability and semi-stability are Zariski open properties in families when…
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a…
The aim of this paper is to give new insights about families of integrable systems lifting a Hamiltonian $S^1$-space. Specifically, we study one-parameter families $(M^4,\omega,F_t=(J,H_t))_{0 \leq t \leq 1}$ of systems with a fixed…
In this paper we look at 3D lattice models that are generalizations of the state sum model used to define the Kuperberg invariant of 3-manifolds. The partition function is a scalar constructed as a tensor network where the building blocks…
Classical finite association schemes lead to a finite-dimensional algebras which are generated by finitely many stochastic matrices. Moreover, there exist associated finite hypergroups. The notion of classical discrete association schemes…
In this survey article we give basic introduction to the theory of quantum families of maps. We begin with a general look at non-commutative (or "quantum") topology. Then we formulate all our results in this language. Existence of quantum…
We develop an algebraic and operational framework for quantum isomorphisms of hypergraphs, using tools from compact quantum group theory. We introduce a new synchronous version of the hypergraph isomorphism game whose game algebra uniformly…
Universal quantum computation can be achieved by simply performing single-qubit measurements on a highly entangled resource state. Resource states can arise from ground states of carefully designed two-body interacting Hamiltonians. This…
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v_1, ..., v_k of G, there exists a cycle (respectively, a hamiltonian cycle) in G containing these k vertices in the specified…
We establish an important duality correspondence between topological order in quantum many body systems and criticality in ferromagnetic classical spin systems. We show how such a correspondence leads to a classical and simple procedure for…
We prove that estimating the ground state energy of a translationally-invariant, nearest-neighbour Hamiltonian on a 1D spin chain is QMAEXP-complete, even for systems of low local dimension (roughly 40). This is an improvement over the best…