446 research outputs found

    Parsing a sequence of qubits

    Full text link
    We develop a theoretical framework for frame synchronization, also known as block synchronization, in the quantum domain which makes it possible to attach classical and quantum metadata to quantum information over a noisy channel even when the information source and sink are frame-wise asynchronous. This eliminates the need of frame synchronization at the hardware level and allows for parsing qubit sequences during quantum information processing. Our framework exploits binary constant-weight codes that are self-synchronizing. Possible applications may include asynchronous quantum communication such as a self-synchronizing quantum network where one can hop into the channel at any time, catch the next coming quantum information with a label indicating the sender, and reply by routing her quantum information with control qubits for quantum switches all without assuming prior frame synchronization between users.Comment: 11 pages, 2 figures, 1 table. Final accepted version for publication in the IEEE Transactions on Information Theor

    Symmetries, Stability, and Control in Nonlinear Systems and Networks

    Full text link
    This paper discusses the interplay of symmetries and stability in the analysis and control of nonlinear dynamical systems and networks. Specifically, it combines standard results on symmetries and equivariance with recent convergence analysis tools based on nonlinear contraction theory and virtual dynamical systems. This synergy between structural properties (symmetries) and convergence properties (contraction) is illustrated in the contexts of network motifs arising e.g. in genetic networks, of invariance to environmental symmetries, and of imposing different patterns of synchrony in a network.Comment: 16 pages, second versio

    Perfect quantum-state synchronization

    Full text link
    We investigate the most general mechanisms that lead to perfect synchronization of the quantum states of all subsystems of an open quantum system starting from an arbitrary initial state. We provide a necessary and sufficient condition for such "quantum-state synchronization", prove tight lower bounds on the dimension of the environment's Hilbert space in two main classes of quantum-state synchronizers, and give an analytical solution for their construction. The functioning of the found quantum-state synchronizer of two qubits is demonstrated experimentally on an IBM quantum computer and we show that the remaining asynchronicity is a sensitive measure of the quantum computer's imperfection.Comment: 10 pages, 4 figure

    Synchronization with partial state coupling on SO(n)

    Full text link
    This paper studies autonomous synchronization of k agents whose states evolve on SO(n), but which are only coupled through the action of their states on one "reference vector" in Rn for each link. Thus each link conveys only partial state information at each time, and to reach synchronization agents must combine this information over time or throughout the network. A natural gradient coupling law for synchronization is proposed. Extensive convergence analysis of the coupled agents is provided, both for fixed and time-varying reference vectors. The case of SO(3) with fixed reference vectors is discussed in more detail. For comparison, we also treat the equivalent setting in Rn, i.e. with states in Rn and connected agents comparing scalar product of their states with a reference vector.Comment: to be submitted to SIAM Journal on Control and Optimizatio

    Cluster synchronization in networks of coupled non-identical dynamical systems

    Full text link
    In this paper, we study cluster synchronization in networks of coupled non-identical dynamical systems. The vertices in the same cluster have the same dynamics of uncoupled node system but the uncoupled node systems in different clusters are different. We present conditions guaranteeing cluster synchronization and investigate the relation between cluster synchronization and the unweighted graph topology. We indicate that two condition play key roles for cluster synchronization: the common inter-cluster coupling condition and the intra-cluster communication. From the latter one, we interpret the two well-known cluster synchronization schemes: self-organization and driving, by whether the edges of communication paths lie at inter or intra-cluster. By this way, we classify clusters according to whether the set of edges inter- or intra-cluster edges are removable if wanting to keep the communication between pairs of vertices in the same cluster. Also, we propose adaptive feedback algorithms on the weights of the underlying graph, which can synchronize any bi-directed networks satisfying the two conditions above. We also give several numerical examples to illustrate the theoretical results
    corecore