arXiv subjects

Simone Severini

Publications and source records attributed to Simone Severini.

At least 109 records · Page 6Linked to original sources

arXiv2009

A note on observables for counting trails and paths in graphs

We point out that the total number of trails and the total number of paths of given length, between two vertices of a simple undirected graph, are obtained as expectation values of specifically engineered quantum mechanical observables. Such observables are contextual with some background independent theories of gravity and emergent geometry. Thus, we point out yet another situation in which the mathematical formalism of a physical theory has some computational aspects involving intractable problems.

math.CO↗

arXiv2009

Quantum state transfer through a qubit network with energy shifts and fluctuations

We study quantum state transfer through a qubit network modeled by spins with XY interaction, when relying on a single excitation. We show that it is possible to achieve perfect transfer by shifting (adding) energy to specific vertices. This technique appears to be a potentially powerful tool to change, and in some cases improve, transfer capabilities of quantum networks. Analytical results are presented for all-to-all networks and all-to-all networks with a missing link. Moreover, we evaluate the effect of random fluctuations on the transmission fidelity.

quant-ph↗

arXiv2009

Perturbation theory in a pure exchange non-equilibrium economy

We develop a formalism to study linearized perturbations around the equilibria of a pure exchange economy. With the use of mean field theory techniques, we derive equations for the flow of products in an economy driven by heterogeneous preferences and probabilistic interaction between agents. We are able to show that if the economic agents have static preferences, which are also homogeneous in any of the steady states, the final wealth distribution is independent of the dynamics of the non-equilibrium theory. In particular, it is completely determined in terms of the initial conditions, and it is independent of the probability, and the network of interaction between agents. We show that the main effect of the network is to determine the relaxation time via the usual eigenvalue gap as in random walks on graphs.

q-fin.TR↗

arXiv2009

Counting paths in Bratteli diagrams for SU(2)_k

It is known that the Hilbert space dimensionality for quasiparticles in an SU(2)_k Chern-Simons-Witten theory is given by the number of directed paths in certain Bratteli diagrams. We present an explicit formula for these numbers for arbitrary k. This is on the basis of a relation with Dyck paths and Chebyshev polynomials.

math.CO↗

arXiv2009

Rational Orthogonal versus Real Orthogonal

The main question we raise here is the following one: given a real orthogonal n by n matrix X, is it true that there exists a rational orthogonal matrix Y having the same zero-pattern? We conjecture that this is the case and prove it for n<=5. We also consider the related problem for symmetric orthogonal matrices.

math.CO↗

arXiv2008

Weighing matrices and optical quantum computing

Quantum computation in the one-way model requires the preparation of certain resource states known as cluster states. We describe how the construction of continuous-variable cluster states for optical quantum computing relate to the existence of certain families of matrices. The relevant matrices are known as weighing matrices, with a few additional constraints. We prove some results regarding the structure of these matrices, and their associated graphs.

quant-ph↗

arXiv2008

Lieb-Robinson bounds and the speed of light from topological order

We apply the Lieb-Robinson bounds technique to find the maximum speed of interaction in a spin model with topological order whose low-energy effective theory describes light [see X.-G. Wen, \prb {\bf 68}, 115413 (2003)]. The maximum speed of interactions is found in two dimensions is bounded from above less than $\sqrt{2} e$ times the speed of emerging light, giving a strong indication that light is indeed the maximum speed of interactions. This result does not rely on mean field theoretic methods. In higher spatial dimensions, the Lieb-Robinson speed is conjectured to increase linearly with the dimension itself. Implications for the horizon problem in cosmology are discussed.

quant-ph↗

arXiv2008

Extrema of discrete Wigner functions and applications

We study the class of discrete Wigner functions proposed by Gibbons et al. [Phys. Rev. A 70, 062101 (2004)] to describe quantum states using a discrete phase-space based on finite fields. We find the extrema of such functions for small Hilbert space dimensions, and present a quantum information application: a construction of quantum random access codes. These are constructed using the complete set of phase-space point operators to find encoding states and to obtain the codes' average success rates for Hilbert space dimensions 2,3,4,5,7 and 8.

quant-ph↗

arXiv2008

Enumeration of $(k,2)$-noncrossing partitions

A set partition is said to be $(k,d)$-noncrossing if it avoids the pattern $12... k12... d$. We find an explicit formula for the ordinary generating function of the number of $(k,d)$-noncrossing partitions of $\{1,2,...,n\}$ when $d=1,2$.

math.CO↗

arXiv2008

Communication in XYZ All-to-All Quantum Networks with a Missing Link

We explicitate the relation between Hamiltonians for networks of interacting qubits in the XYZ model and graph Laplacians. We then study evolution in networks in which all sites can communicate with each other. These are modeled by the complete graph K_{n} and called all-to-all networks. It turns out that K_{n} does not exhibit perfect state transfer (PST). However, we prove that deleting an edge in K_{n} allows PST between the two non-adjacent sites, when n is a multiple of four. An application is routing a qubit over n different sites, by switching off the link between the sites that we wish to put in communication. Additionally, we observe that, in certain cases, the unitary inducing evolution in K_{n} is equivalent to the Grover operator.

quant-ph↗

arXiv2008

Quantum Networks on Cubelike Graphs

Cubelike graphs are the Cayley graphs of the elementary abelian group (Z_2)^n (e.g., the hypercube is a cubelike graph). We give conditions for perfect state transfer between two particles in quantum networks modeled by a large class of cubelike graphs. This generalizes results of Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)] and Facer et al. [Phys. Rev. A 92, 187902 (2008)].

quant-ph↗

arXiv2008

A further look into combinatorial orthogonality

Strongly quadrangular matrices have been introduced in the study of the combinatorial properties of unitary matrices. It is known that if a (0, 1)-matrix supports a unitary then it is strongly quadrangular. However, the converse is not necessarily true. In this paper, we fully classify strongly quadrangular matrices up to degree 5. We prove that the smallest strongly quadrangular matrices which do not support unitaries have exactly degree 5. Further, we isolate two submatrices not allowing a (0, 1)-matrix to support unitaries.

math.CO↗

arXiv2008

Hidden entanglement at the Planck scale: loss of unitarity and the information paradox

We discuss how relaxing the requirement of locality for quantum fields can equip the Hilbert space of the theory with a richer structure in its multi-particle sector. A physical consequence is the emergence of a "planckian" mode-entanglement, invisible to an observer that cannot probe the Planck scale. To the same observer, certain unitary processes would appear non-unitary. We show how entanglement transfer to the additional degrees of freedom can provide a potential way out of the black hole information paradox.

hep-th↗

arXiv2008

Quantum Graphity: a model of emergent locality

Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly connected and the physics is invariant under the full symmetric group acting on the vertices. We present evidence that the model also has a low-energy phase in which the graph describing the system breaks permutation symmetry and appears to be ordered, low-dimensional and local. Consideration of the free energy associated with the dominant terms in the dynamics shows that this low-energy state is thermodynamically stable under local perturbations. The model can also give rise to an emergent U(1) gauge theory in the ground state by the string-net condensation mechanism of Levin and Wen. We also reformulate the model in graph-theoretic terms and compare its dynamics to some common graph processes.

hep-th↗

arXiv2008

Nondiscriminatory Propagation on Trees

We consider a discrete-time dynamical process on graphs, firstly introduced in connection with a protocol for controlling large networks of spin 1/2 quantum mechanical particles [Phys. Rev. Lett. 99, 100501 (2007)]. A description is as follows: each vertex of an initially selected set has a packet of information (the same for every element of the set), which will be distributed among vertices of the graph; a vertex v can pass its packet to an adjacent vertex w only if w is its only neighbour without the information. By mean of examples, we describe some general properties, mainly concerning homeomorphism, and redundant edges. We prove that the cardinality of the smallest sets propagating the information in all vertices of a balanced m-ary tree of depth k is exactly (m^{k+1}+(-1)^{k})/(m+1). For binary trees, this number is related to alternating sign matrices.

math.CO↗

arXiv2008

Partial transpose of permutation matrices

The partial transpose of a block matrix M is the matrix obtained by transposing the blocks of M independently. We approach the notion of partial transpose from a combinatorial point of view. In this perspective, we solve some basic enumeration problems concerning the partial transpose of permutation matrices. More specifically, we count the number of permutations matrices which are equal to their partial transpose and the number of permutation matrices whose partial transpose is still a permutation. We solve these problems also when restricted to symmetric permutation matrices only.

math.CO↗

arXiv2008

An application of the Deutsch-Josza algorithm to formal languages and the word problem in groups

We adapt the Deutsch-Josza algorithm to the context of formal language theory. Specifically, we use the algorithm to distinguish between trivial and nontrivial words in groups given by finite presentations, under the promise that a word is of a certain type. This is done by extending the original algorithm to functions of arbitrary length binary output, with the introduction of a more general concept of parity. We provide examples in which properties of the algorithm allow to reduce the number of oracle queries with respect to the deterministic classical case. This has some consequences for the word problem in groups with a particular kind of presentation.

quant-ph↗

arXiv2007

Combinatorial laplacians and positivity under partial transpose

Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix carries a block structure with respect to which properties such as separability can be considered. We prove that the so-called degree-criterion, which was conjectured to be necessary and sufficient for separability of density matrices of graphs, is equivalent to the PPT-criterion. As such it is not sufficient for testing the separability of density matrices of graphs (we provide an explicit example). Nonetheless, we prove the sufficiency when one of the array dimensions has length two (for an alternative proof see Wu, \emph{Phys. Lett. A}\textbf{351} (2006), no. 1-2, 18--22). Finally we derive a rational upper bound on the concurrence of density matrices of graphs and show that this bound is exact for graphs on four vertices.

cs.CC↗