119 research outputs found
Unitary designs and codes
A unitary design is a collection of unitary matrices that approximate the
entire unitary group, much like a spherical design approximates the entire unit
sphere. In this paper, we use irreducible representations of the unitary group
to find a general lower bound on the size of a unitary t-design in U(d), for
any d and t. We also introduce the notion of a unitary code - a subset of U(d)
in which the trace inner product of any pair of matrices is restricted to only
a small number of distinct values - and give an upper bound for the size of a
code of degree s in U(d) for any d and s. These bounds can be strengthened when
the particular inner product values that occur in the code or design are known.
Finally, we describe some constructions of designs: we give an upper bound on
the size of the smallest weighted unitary t-design in U(d), and we catalogue
some t-designs that arise from finite groups.Comment: 25 pages, no figure
Dimension Reduction via Colour Refinement
Colour refinement is a basic algorithmic routine for graph isomorphism
testing, appearing as a subroutine in almost all practical isomorphism solvers.
It partitions the vertices of a graph into "colour classes" in such a way that
all vertices in the same colour class have the same number of neighbours in
every colour class. Tinhofer (Disc. App. Math., 1991), Ramana, Scheinerman, and
Ullman (Disc. Math., 1994) and Godsil (Lin. Alg. and its App., 1997)
established a tight correspondence between colour refinement and fractional
isomorphisms of graphs, which are solutions to the LP relaxation of a natural
ILP formulation of graph isomorphism.
We introduce a version of colour refinement for matrices and extend existing
quasilinear algorithms for computing the colour classes. Then we generalise the
correspondence between colour refinement and fractional automorphisms and
develop a theory of fractional automorphisms and isomorphisms of matrices.
We apply our results to reduce the dimensions of systems of linear equations
and linear programs. Specifically, we show that any given LP L can efficiently
be transformed into a (potentially) smaller LP L' whose number of variables and
constraints is the number of colour classes of the colour refinement algorithm,
applied to a matrix associated with the LP. The transformation is such that we
can easily (by a linear mapping) map both feasible and optimal solutions back
and forth between the two LPs. We demonstrate empirically that colour
refinement can indeed greatly reduce the cost of solving linear programs
Emergence of Symmetry in Complex Networks
Many real networks have been found to have a rich degree of symmetry, which
is a very important structural property of complex network, yet has been rarely
studied so far. And where does symmetry comes from has not been explained. To
explore the mechanism underlying symmetry of the networks, we studied
statistics of certain local symmetric motifs, such as symmetric bicliques and
generalized symmetric bicliques, which contribute to local symmetry of
networks. We found that symmetry of complex networks is a consequence of
similar linkage pattern, which means that nodes with similar degree tend to
share similar linkage targets. A improved version of BA model integrating
similar linkage pattern successfully reproduces the symmetry of real networks,
indicating that similar linkage pattern is the underlying ingredient that
responsible for the emergence of the symmetry in complex networks.Comment: 7 pages, 7 figure
On the eigenvalues of Cayley graphs on the symmetric group generated by a complete multipartite set of transpositions
Given a finite simple graph \cG with vertices, we can construct the
Cayley graph on the symmetric group generated by the edges of \cG,
interpreted as transpositions. We show that, if \cG is complete multipartite,
the eigenvalues of the Laplacian of \Cay(\cG) have a simple expression in
terms of the irreducible characters of transpositions, and of the
Littlewood-Richardson coefficients. As a consequence we can prove that the
Laplacians of \cG and of \Cay(\cG) have the same first nontrivial
eigenvalue. This is equivalent to saying that Aldous's conjecture, asserting
that the random walk and the interchange process have the same spectral gap,
holds for complete multipartite graphs.Comment: 29 pages. Includes modification which appear on the published version
in J. Algebraic Combi
The average mixing matrix signature
Laplacian-based descriptors, such as the Heat Kernel Signature and the Wave Kernel Signature, allow one to embed the vertices of a graph onto a vectorial space, and have been successfully used to find the optimal matching between a pair of input graphs. While the HKS uses a heat di↵usion process to probe the local structure of a graph, the WKS attempts to do the same through wave propagation. In this paper, we propose an alternative structural descriptor that is based on continuoustime quantum walks. More specifically, we characterise the structure of a graph using its average mixing matrix. The average mixing matrix is a doubly-stochastic matrix that encodes the time-averaged behaviour of a continuous-time quantum walk on the graph. We propose to use the rows of the average mixing matrix for increasing stopping times to develop a novel signature, the Average Mixing Matrix Signature (AMMS). We perform an extensive range of experiments and we show that the proposed signature is robust under structural perturbations of the original graphs and it outperforms both the HKS and WKS when used as a node descriptor in a graph matching task
Spectral plots and the representation and interpretation of biological data
It is basic question in biology and other fields to identify the char-
acteristic properties that on one hand are shared by structures from a
particular realm, like gene regulation, protein-protein interaction or neu- ral
networks or foodwebs, and that on the other hand distinguish them from other
structures. We introduce and apply a general method, based on the spectrum of
the normalized graph Laplacian, that yields repre- sentations, the spectral
plots, that allow us to find and visualize such properties systematically. We
present such visualizations for a wide range of biological networks and compare
them with those for networks derived from theoretical schemes. The differences
that we find are quite striking and suggest that the search for universal
properties of biological networks should be complemented by an understanding of
more specific features of biological organization principles at different
scales.Comment: 15 pages, 7 figure
Polyhedra in loop quantum gravity
Interwiners are the building blocks of spin-network states. The space of
intertwiners is the quantization of a classical symplectic manifold introduced
by Kapovich and Millson. Here we show that a theorem by Minkowski allows us to
interpret generic configurations in this space as bounded convex polyhedra in
Euclidean space: a polyhedron is uniquely described by the areas and normals to
its faces. We provide a reconstruction of the geometry of the polyhedron: we
give formulas for the edge lengths, the volume and the adjacency of its faces.
At the quantum level, this correspondence allows us to identify an intertwiner
with the state of a quantum polyhedron, thus generalizing the notion of quantum
tetrahedron familiar in the loop quantum gravity literature. Moreover, coherent
intertwiners result to be peaked on the classical geometry of polyhedra. We
discuss the relevance of this result for loop quantum gravity. In particular,
coherent spin-network states with nodes of arbitrary valence represent a
collection of semiclassical polyhedra. Furthermore, we introduce an operator
that measures the volume of a quantum polyhedron and examine its relation with
the standard volume operator of loop quantum gravity. We also comment on the
semiclassical limit of spinfoams with non-simplicial graphs.Comment: 32 pages, many figures. v2 minor correction
Generating GHZ state in 2m-qubit spin network
We consider a pure 2m-qubit initial state to evolve under a particular
quantum me- chanical spin Hamiltonian, which can be written in terms of the
adjacency matrix of the Johnson network J(2m;m). Then, by using some techniques
such as spectral dis- tribution and stratification associated with the graphs,
employed in [1, 2], a maximally entangled GHZ state is generated between the
antipodes of the network. In fact, an explicit formula is given for the
suitable coupling strengths of the hamiltonian, so that a maximally entangled
state can be generated between antipodes of the network. By using some known
multipartite entanglement measures, the amount of the entanglement of the final
evolved state is calculated, and finally two examples of four qubit and six
qubit states are considered in details.Comment: 22 page
A universal graph description for one-dimensional exchange models
We demonstrate that a large class of one-dimensional quantum and classical
exchange models can be described by the same type of graphs, namely Cayley
graphs of the permutation group. Their well-studied spectral properties allow
us to derive crucial information about those models of fundamental importance
in both classical and quantum physics, and to completely characterize their
algebraic structure. Notably, we prove that the spectral gap can be obtained in
polynomial computational time, which has strong implications in the context of
adiabatic quantum computing with quantum spin-chains. This quantity also
characterizes the rate to stationarity of some important classical random
processes such as interchange and exclusion processes. Reciprocally, we use
results derived from the celebrated Bethe ansatz to obtain original
mathematical results about these graphs in the unweighted case. We also discuss
extensions of this unifying framework to other systems, such as asymmetric
exclusion processes -- a paradigmatic model in non-equilibrium physics, or the
more exotic non-Hermitian quantum systems
Tight informationally complete quantum measurements
We introduce a class of informationally complete positive-operator-valued
measures which are, in analogy with a tight frame, "as close as possible" to
orthonormal bases for the space of quantum states. These measures are
distinguished by an exceptionally simple state-reconstruction formula which
allows "painless" quantum state tomography. Complete sets of mutually unbiased
bases and symmetric informationally complete positive-operator-valued measures
are both members of this class, the latter being the unique minimal rank-one
members. Recast as ensembles of pure quantum states, the rank-one members are
in fact equivalent to weighted 2-designs in complex projective space. These
measures are shown to be optimal for quantum cloning and linear quantum state
tomography.Comment: 20 pages. Final versio
- …