Quantum-state transfer in imperfect artificial spin networks

High-fidelity quantum computation and quantum state transfer are possible in short spin chains. We exploit a system based on a dispersive qubit-boson interaction to mimic XY coupling. In this model, the usually assumed nearest-neighbor coupling is no longer valid: all the qubits are mutually coupled. We analyze the performances of our model for quantum state transfer showing how preengineered coupling rates allow for nearly optimal state transfer. We address a setup of superconducting qubits coupled to a microstrip cavity in which our analysis may be applied.

Cloning transformations in spin networks without external control

In this paper we present an approach to quantum cloning with unmodulated spin networks. The cloner is realized by a proper design of the network and a choice of the coupling between the qubits. We show that in the case of phase covariant cloner the XY coupling gives the best results. In the 1 -> 2 cloning we find that the value for the fidelity of the optimal cloner is achieved, and values comparable to the optimal ones in the general N -> M case can be attained. If a suitable set of network symmetries are satisfied, the output fidelity of the clones does not depend on the specific choice of the graph. We show that spin network cloning is robust against the presence of static imperfections. Moreover, in the presence of noise, it outperforms the conventional approach. In this case the fidelity exceeds the corresponding value obtained by quantum gates even for a very small amount of noise. Furthermore, we show how to use this method to clone qutrits and qudits. By means of the Heisenberg coupling it is also possible to implement the universal cloner although in this case the fidelity is 10% off that of the optimal cloner.

Quantum cloning in spin networks

We introduce an approach to quantum cloning based on spin networks and we demonstrate that phase covariant cloning can be realized using no external control but only with a proper design of the Hamiltonian of the system. In the 1-->2 cloning we find that the XY model saturates the value for the fidelity of the optimal cloner and gives values comparable to it in the general N-->M case. We finally discuss the effect of external noise. Our protocol is much more robust to decoherence than a conventional procedure based on quantum gates.

Integrability for Relativistic Spin Networks

The evaluation of relativistic spin networks plays a fundamental role in the Barrett-Crane state sum model of Lorentzian quantum gravity in 4 dimensions. A relativistic spin network is a graph labelled by unitary irreducible representations of the Lorentz group appearing in the direct integral decomposition of the space of L^2 functions on three-dimensional hyperbolic space. To `evaluate' such a spin network we must do an integral; if this integral converges we say the spin network is `integrable'. Here we show that a large class of relativistic spin networks are integrable, including any whose underlying graph is the 4-simplex (the complete graph on 5 vertices). This proves a conjecture of Barrett and Crane, whose validity is required for the convergence of their state sum model.

Toy model for a relational formulation of quantum theory

In the absence of an external frame of reference-i.e., in background independent theories such as general relativity-physical degrees of freedom must describe relations between systems. Using a simple model, we investigate how such a relational quantum theory naturally arises by promoting reference systems to the status of dynamical entities. Our goal is twofold. First, we demonstrate using elementary quantum theory how any quantum mechanical experiment admits a purely relational description at a fundamental. Second, we describe how the original non-relational theory approximately emerges from the fully relational theory when reference systems become semi-classical. Our technique is motivated by a Bayesian approach to quantum mechanics, and relies on the noiseless subsystem method of quantum information science used to protect quantum states against undesired noise. The relational theory naturally predicts a fundamental decoherence mechanism, so an arrow of time emerges from a time-symmetric theory. Moreover, our model circumvents the problem of the collapse of the wave packet as the probability interpretation is only ever applied to diagonal density operators. Finally, the physical states of the relational theory can be described in terms of spin networks introduced by Penrose as a combinatorial description of geometry, and widely studied in the loop formulation of quantum gravity. Thus, our simple bottom-up approach (starting from the semiclassical limit to derive the fully relational quantum theory) may offer interesting insights on the low energy limit of quantum gravity.

A Lorentzian Signature Model for Quantum General Relativity

We give a relativistic spin network model for quantum gravity based on the Lorentz group and its q-deformation, the Quantum Lorentz Algebra. We propose a combinatorial model for the path integral given by an integral over suitable representations of this algebra. This generalises the state sum models for the case of the four-dimensional rotation group previously studied in gr-qc/9709028. As a technical tool, formulae for the evaluation of relativistic spin networks for the Lorentz group are developed, with some simple examples which show that the evaluation is finite in interesting cases. We conjecture that the `10J' symbol needed in our model has a finite value.

Geometrical measurements in three-dimensional quantum gravity

A set of observables is described for the topological quantum field theory which describes quantum gravity in three space-time dimensions with positive signature and positive cosmological constant. The simplest examples measure the distances between points, giving spectra and probabilities which have a geometrical interpretation. The observables are related to the evaluation of relativistic spin networks by a Fourier transform.

Additionality of Incubator Support on Networks of University Spin-Out Firms

The formation rate of university spin-out firms has increased markedly over the past decade. While this is seen as an important channel for the commercialisation of academic research, concerns have centred around high failure rates and no-to-low growth among those which survive compared to other new technology based firms. Universities have responded to this by investing in incubators to assist spin-outs to overcome their liability of newness. Yet how effective are incubators in supporting these firms? Here we examine this in terms of the structural networks that spin-out firms form, the role of the incubator in this and the effect of this on the spin-out process.

The Utilization of Classical Spin Monte Carlo Methods to Simulate the Magnetic Behavior of Extended Three-Dimensional Cubic Networks Incorporating M(II) Ions with an S = 5/2 Ground State Spin

The numerical simulations of the magnetic properties of extended three-dimensional networks containing M(II) ions with an S = 5/2 ground-state spin have been carried out within the framework of the isotropic Heisenberg model. Analytical expressions fitting the numerical simulations for the primitive cubic, diamond, together with (10−3) cubic networks have all been derived. With these empirical formulas in hands, we can now extract the interaction between the magnetic ions from the experimental data for these networks. In the case of the primitive cubic network, these expressions are directly compared with those from the high-temperature expansions of the partition function. A fit of the experimental data for three complexes, namely [(N(CH3)4][Mn(N3)] 1, [Mn(CN4)]n 2, and [FeII(bipy)3][MnII2(ox)3] 3, has been carried out. The best fits were those obtained using the following parameters, J = −3.5 cm-1, g = 2.01 (1); J = −8.3 cm-1, g = 1.95 (2); and J = −2.0 cm-1, g = 1.95 (3).

Molecular-Based Magnetism in High-Spin Molecular Clusters and Three-Dimensional Networks Based on Cyanometalate Building Blocks

The field of molecule-based magnets is a relatively new branch of chemistry, which involves the design and study of molecular compounds that exhibit a spontaneous magnetic ordering below a critical temperature, Tc. One major goal involves the design of materials with tuneable Tc's for specific applications in memory storage devices. Molecule-based magnets with high magnetic ordering temperatures have recently been obtained from bimetallic and mixed-valence transition metal μ-cyanide complexes of the Prussian blue family. Since the μ-cyanide linkages permit an interaction between paramagnetic metal ions, cyanometalate building blocks have found useful applications in the field of molecule-based magnets. Our work involves the use of octacyanometalate building blocks for the self-assembly of two new classes of magnetic materials namely, high-spin molecular clusters which exhibit both ferromagnetic intra- and intercluster coupling, and specific extended network topologies which show long-range ferromagnetic ordering.

Research-based spin-offs as agents of knowledge dissemination: evidence from the analysis of innovation networks

The paper addresses the role played by research-based spin-offs (RBSOs) as knowledge dissemination mechanisms, through their position in knowledge networks. For this purpose the paper analyses the formal networks established by the Portuguese RBSOs in the context of publicly funded research, technology and pre-commercial product development projects, and investigates their configuration along two levels. At organisational level, in order to understand whether RBSOs extend their reach beyond the academic sphere; and if they do, whether they relate with similar firms or connect to organisations located downstream in the knowledge value chain, and which is their position in networks involving both research organisations and other firms. At spatial level, in order to understand whether RBSOs extend their reach beyond the region where they are created, thus potentially acting as connectors between diverse regions. The analysis starts from the population of RBSOs created in Portugal until 2007 (387) and identifies those that have established formal technological relationships as part of projects funded by all the programmes launched in the period 1993-2012. As a result, the analysis encompasses 192 collaborative projects and involves 82 spin-offs and 281 partners, of which only 20% are research organisations, the remaining being other firms and a variety of other user organisations. The results, although still preliminary, provide some insights into the knowledge networking behaviour of the RBSOs. As expected, research organisations are a central actor in spin-offs’ networks, being the sole partner for some of them. But half of the RBSOs have moved beyond the academic sphere, being frequently a central element in tripartite technological relationships between research and other organisations and occupying an intermediation position in the network, thus potentially acting as facilitators in knowledge circulation and transformation. Also as expected, RBSOs are predominantly located in the main metropolitan areas and tend to relate with organisations similarly located. But while geographical proximity emerges as important in the choice of partners, in about half of the cases, RBSOs knowledge networks have extended beyond regional boundaries. Given their central position in the network this suggests a role as connectors across regions that will be explored in subsequent research.

Research-based spin-offs as agents of knowledge dissemination: evidence from the analysis of innovation networks

The paper addresses the role played by research-based spin-offs (RBSOs) as knowledge dissemination mechanisms, through their position in knowledge networks. For this purpose the paper analyses the formal networks established by Portuguese RBSOs, in the context of publicly funded research, technology and pre-commercial product development projects, and investigates their configuration across two levels. At organisational level, in order to understand whether RBSOs extend their reach beyond the academic sphere; and if they do, whether they connect to organisations located downstream in the knowledge value chain, and which is their position in networks involving both research organisations and other firms. At spatial level, in order to understand whether RBSOs extend their reach beyond the region where they are created, thus potentially acting as connectors between diverse regions. The analysis starts from the population of RBSOs created in Portugal until 2007 (327 firms) and identifies those that have established formal technological relationships, as part of projects funded by all the relevant programmes launched in the period 1993-2012. As a result, the analysis encompasses 192 collaborative projects and involves 82 spin-offs and 281 partners, of which only 20% are research organisations, the remaining being other firms and a variety of other downstream organisations. The results, although still preliminary, provide some insights into the knowledge networking behaviour of the RBSOs. As expected, research organisations are a central actor in spin-offs’ networks, being the sole partner for some of them. But half of the RBSOs have moved beyond the academic sphere, being frequently a central element in tripartite technological relationships between research and other organisations, and occupying an intermediation position in the network, thus potentially acting as facilitators in knowledge circulation and transformation. Also as expected, RBSOs are predominantly located in the main metropolitan areas and tend to relate with organisations similarly located. But while geographical proximity emerges as important in the choice of partners, in about half of the cases, RBSOs knowledge networks have extended beyond regional boundaries. Given their central position in the network, this suggests a role as connectors across regions that will be explored in subsequent research.

A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks

Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-k nodes problem and 2) lambda-coverage problem. In the top-k nodes problem, we are required to find a set of k key nodes that would maximize the number of nodes being influenced in the network. The lambda-coverage problem is concerned with finding a set of k key nodes having minimal size that can influence a given percentage lambda of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-k nodes problem and the lambda-coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient. Note to Practitioners-In recent times, social networks have received a high level of attention due to their proven ability in improving the performance of web search, recommendations in collaborative filtering systems, spreading a technology in the market using viral marketing techniques, etc. It is well known that the interpersonal relationships (or ties or links) between individuals cause change or improvement in the social system because the decisions made by individuals are influenced heavily by the behavior of their neighbors. An interesting and key problem in social networks is to discover the most influential nodes in the social network which can influence other nodes in the social network in a strong and deep way. This problem is called the target set selection problem and has two variants: 1) the top-k nodes problem, where we are required to identify a set of k influential nodes that maximize the number of nodes being influenced in the network and 2) the lambda-coverage problem which involves finding a set of influential nodes having minimum size that can influence a given percentage lambda of the nodes in the entire network. There are many existing algorithms in the literature for solving these problems. In this paper, we propose a new algorithm which is based on a novel interpretation of information diffusion in a social network as a cooperative game. Using this analogy, we develop an algorithm based on the Shapley value of the underlying cooperative game. The proposed algorithm outperforms the existing algorithms in terms of generality or computational complexity or both. Our results are validated through extensive experimentation on both synthetically generated and real-world data sets.

The Non-Responsive Receiver Problem in Mobile Ad-hoc Networks

This letter exposed a serious unfairness problem with IEEE 802.11 MAC based Mobile Ad-hoc Networks (MANETs) when operating TCP connections, and identifies the three common factors that contribute to this problem. The work initiated the development of a programmable wireless framework that is subsequently used in a spin-out company (TOM), and by the Telecoms Technology Testing centre in Taiwan(Dr D Chieng).