Simone Severini

Simone Severini

Auto-generated profile, based on publicly available information

Simone Severini

Department of Computer Science, University College London, London, UK

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 January 2014 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
ACAdán Cabello
Adán Cabello
SSSimone Severini
Simone Severini
AWAndreas Winter
Andreas Winter
Correlations in Bell and noncontextuality inequalities can be expressed as a positive linear combination of probabilities of events. Exclusive events can be represented as adjacent vertices of a graph, so correlations can be associated to a subgraph. We show that the maximum value of the correlations for classical, quantum, and more general theories is the independence number, the Lovász number, and the fractional packing number of this subgraph, respectively. We also show that, for any graph, there is always a correlation experiment such that the set of quantum probabilities is exactly the Grötschel-Lovász-Schrijver theta body. This identifies these combinatorial notions as fundamental physical objects and provides a method for singling out experiments with quantum correlations on demand.

27 May 2008 in Physical Review D
Verified
Journal Article
Closed access
PDF file
TKTomasz Konopka
Tomasz Konopka
FMFotini Markopoulou
Fotini Markopoulou
SSSimone Severini
Simone Severini
Quantum graphity is a background-independent model for emergent macroscopic 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.

2 October 2012 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
RDRunyao Duan
Runyao Duan
SSSimone Severini
Simone Severini
AWAndreas Winter
Andreas Winter
We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we propose to consider a certain subspace of operators (so-called operator systems) as the quantum generalization of the adjacency matrix, in terms of which the zero-error capacity of a quantum channel, as well as the quantum and entanglement-assisted zero-error capacities can be formulated, and for which we show some new basic properties. Most importantly, we define a quantum version of Lovász' famous ϑ function on general operator systems, as the norm-completion (or stabilization) of a “naive” generalization of ϑ. We go on to show that this function upper bounds the number of entanglement-assisted zero-error messages, that it is given by a semidefinite program, whose dual we write down explicitly, and that it is multiplicative with respect to the tensor product of operator systems (corresponding to the tensor product of channels). We explore various other properties of the new quantity, which reduces to Lovász' original ϑ in the classical case, give several applications, and propose to study the operator systems associated with channels as “noncommutative graphs,” using the language of Hilbert modules.

1 December 2006 in Annals of Combinatorics
Verified
Journal Article
Closed access
PDF file
SBSamuel Braunstein
Samuel Braunstein
SGSibasish Ghosh
Sibasish Ghosh
SSSimone Severini
Simone Severini

13 November 2012 in Scientific Reports
Verified
Journal Article
Open access
JWJames West
James West
Ginestra BianconiGinestra Bianconi
Ginestra Bianconi
SSSimone Severini
Simone Severini
Andrew E. TeschendorffAndrew E. Teschendorff
Andrew E. Teschendorff
The cellular phenotype is described by a complex network of molecular interactions. Elucidating network properties that distinguish disease from the healthy cellular state is therefore of critical importance for gaining systems-level insights into disease mechanisms and ultimately for developing improved therapies. By integrating gene expression data with a protein interaction network we here demonstrate that cancer cells are characterised by an increase in network entropy. In addition, we formally demonstrate that gene expression differences between normal and cancer tissue are anticorrelated with local network entropy changes, thus providing a systemic link between gene expression changes at the nodes and their local correlation patterns. In particular, we find that genes which drive cell-proliferation in cancer cells and which often encode oncogenes are associated with reductions in network entropy. These findings may have potential implications for identifying novel drug targets.

18 March 2011 in Physical Review E
Verified
Journal Article
Closed access
KAKartik Anand
Kartik Anand
Ginestra BianconiGinestra Bianconi
Ginestra Bianconi
SSSimone Severini
Simone Severini
Entropic measures of complexity are able to quantify the information encoded in complex network structures. Several entropic measures have been proposed in this respect. Here we study the relation between the Shannon entropy and the von Neumann entropy of networks with given expected degree sequence. We find in different examples of network topologies that when the degree distribution contains some heterogeneity, an intriguing correlation emerges between the two entropic quantities. This results seems to suggest that heterogeneity in the expected degree distribution is implying an equivalence between a quantum and a classical description of networks, which respectively corresponds to the von Neumann and the Shannon entropy.