Searcharxiv⌕ Search

arXiv subjects

Claudio Altafini

Publications and source records attributed to Claudio Altafini.

35 records · Page 2Linked to original sources
arXiv2018

Dynamics over Signed Networks

A signed network is a network with each link associated with a positive or negative sign. Models for nodes interacting over such signed networks, where two different types of interactions take place along the positive and negative links, respectively, arise from various biological, social, political, and economic systems. As modifications to the conventional DeGroot dynamics for positive links, two basic types of negative interactions along negative links, namely the opposing rule and the repelling rule, have been proposed and studied in the literature. This paper reviews a few fundamental convergence results for such dynamics over deterministic or random signed networks under a unified algebraic-graphical method. We show that a systematic tool of studying node state evolution over signed networks can be obtained utilizing generalized Perron-Frobenius theory, graph theory, and elementary algebraic recursions.

cs.SI↗
arXiv2018

Interval Consensus for Multiagent Networks

The constrained consensus problem considered in this paper, denoted interval consensus, is characterized by the fact that each agent can impose a lower and upper bound on the achievable consensus value. Such constraints can be encoded in the consensus dynamics by saturating the values that an agent transmits to its neighboring nodes. We show in the paper that when the intersection of the intervals imposed by the agents is nonempty, the resulting constrained consensus problem must converge to a common value inside that intersection. In our algorithm, convergence happens in a fully distributed manner, and without need of sharing any information on the individual constraining intervals. When the intersection of the intervals is an empty set, the intrinsic nonlinearity of the network dynamics raises new challenges in understanding the node state evolution. Using Brouwer fixed-point theorem we prove that in that case there exists at least one equilibrium, and in fact the possible equilibria are locally stable if the constraints are satisfied or dissatisfied at the same time among all nodes. For graphs with sufficient sparsity it is further proven that there is a unique equilibrium that is globally attractive if the constraint intervals are pairwise disjoint.

eess.SY↗
arXiv2017

Multiequilibria analysis for a class of collective decision-making networked systems

The models of collective decision-making considered in this paper are nonlinear interconnected cooperative systems with saturating interactions. These systems encode the possible outcomes of a decision process into different steady states of the dynamics. In particular, they are characterized by two main attractors in the positive and negative orthant, representing two choices of agreement among the agents, associated to the Perron-Frobenius eigenvector of the system. In this paper we give conditions for the appearance of other equilibria of mixed sign. The conditions are inspired by Perron-Frobenius theory and are related to the algebraic connectivity of the network. We also show how all these equilibria must be contained in a solid disk of radius given by the norm of the equilibrium point which is located in the positive orthant.

math.OC↗
arXiv2016

Minimum energy control for complex networks

The aim of this paper is to shed light on the problem of controlling a complex network with minimal control energy. We show first that the control energy depends on the time constant of the modes of the network, and that the closer the eigenvalues are to the imaginary axis of the complex plane, the less energy is required for complete controllability. In the limit case of networks having all purely imaginary eigenvalues (e.g. networks of coupled harmonic oscillators), several constructive algorithms for minimum control energy driver node selection are developed. A general heuristic principle valid for any directed network is also proposed: the overall cost of controlling a network is reduced when the controls are concentrated on the nodes with highest ratio of weighted outdegree vs indegree.

eess.SY↗
arXiv2016

The geometric phase of stock trading

Geometric phases describe how in a continuous-time dynamical system the displacement of a variable (called phase variable) can be related to other variables (shape variables) undergoing a cyclic motion, according to an area rule. The aim of this paper is to show that geometric phases can exist also for discrete-time systems, and even when the cycles in shape space have zero area. A context in which this principle can be applied is stock trading. A zero-area cycle in shape space represents the type of trading operations normally carried out by high-frequency traders (entering and exiting a position on a fast time-scale), while the phase variable represents the cash balance of a trader. Under the assumption that trading impacts stock prices, even zero-area cyclic trading operations can induce geometric phases, i.e., profits or losses, without affecting the stock quote.

q-fin.TR↗
arXiv2012

Modeling and Control of Quantum Systems: An Introduction

The scope of this work is to provide a self-contained introduction to a selection of basic theoretical aspects in the modeling and control of quantum mechanical systems, as well as a brief survey on the main approaches to control synthesis. While part of the existing theory, especially in the open-loop setting, stems directly from classical control theory (most notably geometric control and optimal control), a number of tools specifically tailored for quantum systems have been developed since the 1980s, in order to take into account their distinctive features: the probabilistic nature of atomic-scale physical systems, the effect of dissipation and the irreversible character of the measurements have all proved to be critical in feedback-design problems. The relevant dynamical models for both closed and open quantum systems are presented, along with the main results on their controllability and stability. A brief review of several currently available control design methods is meant to provide the interested reader with a roadmap for further studies.

quant-ph↗
arXiv2011

Stabilization of Stochastic Quantum Dynamics via Open and Closed Loop Control

In this paper we investigate parametrization-free solutions of the problem of quantum pure state preparation and subspace stabilization by means of Hamiltonian control, continuous measurement and quantum feedback, in the presence of a Markovian environment. In particular, we show that whenever suitable dissipative effects are induced either by the unmonitored environment or by non Hermitian measurements, there is no need for feedback control to accomplish the task. Constructive necessary and sufficient conditions on the form of the open-loop controller can be provided in this case. When open-loop control is not sufficient, filtering-based feedback control laws steering the evolution towards a target pure state are provided, which generalize those available in the literature.

quant-ph↗
arXiv2006

Feedback control of spin systems

The feedback stabilization problem for ensembles of coupled spin 1/2 systems is discussed from a control theoretic perspective. The noninvasive nature of the bulk measurement allows for a fully unitary and deterministic closed loop. The Lyapunov-based feedback design presented does not require spins that are selectively addressable. With this method, it is possible to obtain control inputs also for difficult tasks, like suppressing undesired couplings in identical spin systems.

quant-ph↗
arXiv2005

Almost Global Stochastic Feedback Stabilization of Conditional Quantum Dynamics

We propose several parametrization-free solutions to the problem of quantum state reduction control by means of continuous measurement and smooth quantum feedback. In particular, we design a feedback law for which almost global stochastic feedback stabilization can be proved analytically by means of Lyapunov techinques. This synthesis arises very naturally from the physics of the problem, as it relies on the variance associated with the quantum filtering process.

quant-ph↗
arXiv2005

Feedback stabilization of quantum ensembles: a global convergence analysis on complex flag manifolds

In an N-level quantum mechanical system, the problem of unitary feedback stabilization of mixed density operators to periodic orbits admits a natural Lyapunov-based time-varying feedback design. A global description of the domain of attraction of the closed-loop system can be provided based on a ``root-space''-like structure of the space of density operators. This convex set foliates as a complex flag manifold where each leaf is identified with the coadjoint orbit of the eigenvalues of the density operator. The converging conditions are time-independent but depend from the topology of the flag manifold: it is shown that the closed loop must have a number of equilibria at least equal to the Euler characteristic of the manifold, thus imposing obstructions of topological nature to global stabilizability.

quant-ph↗
arXiv2005

Reflection Symmetries for Multiqubit Density Operators

For multiqubit density operators in a suitable tensorial basis, we show that a number of nonunitary operations used in the detection and synthesis of entanglement are classifiable as reflection symmetries, i.e., orientation changing rotations. While one-qubit reflections correspond to antiunitary symmetries, as is known for example from the partial transposition criterion, reflections on the joint density of two or more qubits are not accounted for by the Wigner Theorem and are well-posed only for sufficiently mixed states. One example of such nonlocal reflections is the unconditional NOT operation on a multiparty density, i.e., an operation yelding another density and such that the sum of the two is the identity operator. This nonphysical operation is admissible only for sufficiently mixed states.

quant-ph↗
arXiv2005

Commuting multiparty quantum observables and local compatibility

A formula for the commutator of tensor product matrices is used to shows that, for qubits, compatibility of quantum multiparty observables almost never implies local compatibility at each site and to predict when this happens/does not happen in a concise manner. In particular, it is shown that two ``fully nontrivial'' $n$-qubit observables are compatible locally and globally if and only if they are equal up to sign. In addition, the formula gives insight into the construction of new paradoxes of the type of the Kochen-Specker Theorem, which can then be easily rephrased into proposals for new no hidden variable experiments of the type of the ``Bell Theorem without inequalities''.

quant-ph↗
arXiv2004

Characterizing 3-qubit UPB states: violations of LHV models, preparation via nonlocal unitaries and PPT entangled nonlocal orbits

For the 3-qubit UPB state, i.e., the bound entangled state constructed from an Unextendable Product Basis of Bennett et al. (Phys. Rev. Lett. 82:5385, 1999), we provide a set of violations of Local Hidden Variable (LHV) models based on the particular type of reflection symmetry encoded in this state. The explicit nonlocal unitary operation needed to prepare the state from its reflected separable mixture of pure states is given, as well as a nonlocal one-parameter orbit of states with Positive Partial Transpositions (PPT) which swaps the entanglement between a state and its reflection twice during a period.

quant-ph↗
arXiv2004

Representing multiqubit unitary evolutions: spin coherences and infinitesimal coherences

For the tensor of coherences parametrization of a multiqubit density operator, we provide an explicit formulation of the corresponding unitary dynamics at infinitesimal level. The main advantage of this formalism (clearly reminiscent of the idea of ``coherences'' and ``coupling Hamiltonians'' of spin systems) is that the pattern of correlation between qubits and the pattern of infinitesimal correlation are highlighted simultaneously and can be used constructively for qubit manipulation. For example, it allows to compute explicitly a Rodrigues' formula for the one-parameter orbits of nonlocal Hamiltonians. The result is easily generalizable to orbits of Cartan subalgebras and allows to write the Cartan decomposition of unitary propagators as a linear action.

quant-ph↗
arXiv2003

Tensor of coherences parameterization of multiqubit density operators for entanglement characterization

For multiqubit densities, the tensor of coherences (or Stokes tensor) is a real parameterization obtained by the juxtaposition of the affine Bloch vectors of each qubit. While it maintains the tensorial structure of the underlying space, it highlights the pattern of correlations, both classical and quantum, between the subsystems and, due to the affine parameterization, it contains in its components all reduced densities of all orders. The main purpose of our use of this formalism is to deal with entanglement. For example, the detection of bipartite entanglement is straightforward, as it is the synthesis of densities having positive partial transposes between desired qubits. In addition, finding explicit mixtures for families of separable states becomes a feasible issue for few qubit symmetric densities (we compute it for Werner states) and, more important, it provides some insight on the possible origin of entanglement for such densities.

quant-ph↗
arXiv2002

Parameter differentiation and quantum state decomposition for time varying Schroedinger equations

For the unitary operator, solution of the Schroedinger equation corresponding to a time-varying Hamiltonian, the relation between the Magnus and the product of exponentials expansions can be expressed in terms of a system of first order differential equations in the parameters of the two expansions. A method is proposed to compute such differential equations explicitly and in a closed form.

quant-ph↗