In this paper, we study the induced probabilistic Boolean dynamics for dynamical quantum networks subject to sequential quantum measurements. In this part of the paper, we focus on closed networks of quits whose states evolutions are described by a continuous Lindblad master equation. When measurements are performed sequentially along such continuous dynamics, the quantum network states undergo random jumps and the corresponding measurement outcomes can be described by a probabilistic Boolean network. First of all, we show that the state transition of the induced Boolean networks can be explicitly represented through realification of the master equation. Next, when the open quantum dynamics is relaxing in the sense that it possesses a unique equilibrium as a global attractor, structural properties including absorbing states, reducibility, and periodicity for the induced Boolean network are direct consequences of the relaxing property. Finally, we show that for quantum consensus networks as a type of non-relaxing open quantum network dynamics, the communication classes of the measurement-induced Boolean networks are encoded in the quantum Laplacian of the underlying interaction graph.
In this paper, we study the induced probabilistic Boolean dynamics for dynamical quantum networks subject to sequential quantum measurements. In this part of the paper, we focus on closed networks of quits whose states evolutions are described by a continuous Lindblad master equation. When measurements are performed sequentially along such continuous dynamics, the quantum network states undergo random jumps and the corresponding measurement outcomes can be described by a probabilistic Boolean network. First of all, we show that the state transition of the induced Boolean networks can be explicitly represented through realification of the master equation. Next, when the open quantum dynamics is relaxing in the sense that it possesses a unique equilibrium as a global attractor, structural properties including absorbing states, reducibility, and periodicity for the induced Boolean network are direct consequences of the relaxing property. Finally, we show that for quantum consensus networks as a type of non-relaxing open quantum network dynamics, the communication classes of the measurement-induced Boolean networks are encoded in the quantum Laplacian of the underlying interaction graph.
In this article, we study the recursion corresponding to the measurement outcomes for open quantum networks under sequential measurements. Open quantum networks are networked quantum subsystems (e.g., qubits) with the state evolutions described by a continuous Lindblad master equation. When measurements are performed sequentially along such continuous dynamics, the quantum network states undergo probabilistic jumps and the corresponding measurement outcomes can be described by a vector of probabilistic Boolean variables. The induced recursion of the Boolean vectors forms a probabilistic Boolean network. First of all, we show that the state transition of the induced Boolean network can be explicitly represented through a real version of the master equation. Next, when the open quantum dynamics are relaxing in the sense that they possess a unique equilibrium as a global attractor, structural properties including absorbing states, reducibility, and periodicity for the induced Boolean network are direct consequences of this relaxing property. Particularly, we show that generically, relaxing quantum dynamics leads to irreducible and aperiodic chains for the measurement outcomes. Finally, we show that for quantum consensus networks, which are a type of nonrelaxing open quantum network dynamics, the communication classes of the measurement-induced Boolean networks are encoded in the quantum Laplacian of the underlying interaction graph
In this paper, we study dynamical quantum networks which evolve according to Schrödinger equations but subject to sequential local or global quantum measurements. A network of qubits forms a composite quantum system whose state undergoes unitary evolution in between periodic measurements, leading to hybrid quantum dynamics with random jumps at discrete time instances along a continuous orbit. The measurements either act on the entire network of qubits, or only a subset of qubits. First of all, we reveal that this type of hybrid quantum dynamics induces probabilistic Boolean recursions representing the measurement outcomes. With global measurements, it is shown that such resulting Boolean recursions define Markov chains whose state-transitions are fully determined by the network Hamiltonian and the measurement observables. Particularly, we establish an explicit and algebraic representation of the underlying recursive random mapping driving such induced Markov chains. Next, with local measurements, the resulting probabilistic Boolean dynamics is shown to be no longer Markovian. The state transition probability at any given time becomes dependent on the entire history of the sample path, for which we establish a recursive way of computing such non-Markovian probability transitions. Finally, we adopt the classical bilinear control model for the continuous Schrödinger evolution, and show how the measurements affect the controllability of the quantum networks.
In this paper, we develop a blended dynamics framework for open quantum networks with diffusive couplings. The network consists of qubits interconnected through Hamiltonian couplings, environmental dissipation, and consensus-like diffusive interactions. Such networks commonly arise in spontaneous emission processes and non-Hermitian quantum computing, and their evolution follows a Lindblad master equation. Blended dynamics theory is well established in the classical setting as a tool for analyzing emergent behaviors in heterogeneous networks with diffusive couplings. Its key insight is to blend the local dynamics rather than the trajectories of individual nodes. Perturbation analysis then shows that, under sufficiently strong coupling, all node trajectories tend to stay close to those of the blended system over time. We first show that this theory extends naturally to the reduced-state dynamics of quantum networks, revealing classical-like clustering phenomena in which qubits converge to a shared equilibrium or a common trajectory determined by the quantum blended reduced-state dynamics. We then extend the analysis to qubit coherent states using quantum Laplacians and induced graphs, proving orbit attraction of the network density operator toward the quantum blended coherent dynamics, establishing the emergence of intrinsically quantum and dynamically clustering behaviors. Finally, numerical examples validate the theoretical results.
We show that all nonrelativistic quantum processes, whether open or closed, are either unitary or probabilistic unitary, i.e., probabilistic combinations of unitary evolutions. This means that, for open quantum systems, their continuous dynamics can always be described by the Lindblad master equation with all jump operators being unitary. We call this formalism the probabilistic unitary formulation of open quantum system dynamics. This formalism is shown to be exact under all cases, and does not rely on any assumptions other than the continuity and differentiability of the density matrix. Moreover, it requires as few as $d\ensuremath{-}1$ jump operators, instead of ${d}^{2}\ensuremath{-}1$, to describe the open dynamics in the most general case, where d is the dimension of Hilbert space of the system. Importantly, different from the conventional Lindblad master equation, this formalism is state dependent, meaning that the Hamiltonian, jump operators, and rates in general all depend on the current state of the density matrix. Hence one needs to know the explicit expression of the density matrix in order to write down the probabilistic unitary master equation explicitly. Experimentally, the formalism provides a scheme to control a quantum state to evolve along designed nonunitary quantum trajectories, and can be potentially useful in quantum computing and quantum control scenes since only unitary resources are needed for implementation.
In this paper, we propose and study a master-equation based approach to drive a quantum network with n qubits to a consensus (symmetric) state introduced by Mazzarella et al. The state evolution of the quantum network is described by a Lindblad master equation with the Lindblad terms generated by continuous-time swapping operators, which also introduce an underlying interaction graph. We establish a graphical method that bridges the proposed quantum consensus scheme and classical consensus dynamics by studying an induced graph (with 22nnodes) of the quantum interaction graph (with n qubits). A fundamental connection is then shown that quantum consensus over the quantum graph is equivalent to componentwise classical consensus over the induced graph, which allows various existing works on classical consensus to be applicable to the quantum setting. Some basic scaling and structural properties of the quantum induced graph are established via combinatorial analysis. Necessary and sufficient conditions for exponential and asymptotic quantum consensus are obtained, respectively, for switching quantum interaction graphs. As a quantum analogue of classical synchronization of coupled oscillators, quantum synchronization conditions are also presented, in which the reduced states of all qubits tend to a common trajectory.
In this paper, we investigate the convergence of the state of a quantum network to a consensus (symmetric) state. The state evolution of the quantum network with continuous-time swapping operators can be described by a Lindblad master equation, which also introduces an underlying interaction graph for the network. For a fixed quantum interaction graph, we prove that the state of a quantum network with continuous-time Markovian dynamics converges to a consensus state, with convergence rate given by the smallest nonzero eigenvalue of a matrix serving as the Laplacian of the quantum interaction graph. We show that this convergence rate can be optimized via standard convex programming given a fixed amount of edge weights. For switching quantum interaction graphs, we establish necessary and sufficient conditions for exponential quantum consensus and asymptotic quantum consensus, respectively. The convergence analysis is based on a bridge built between the proposed quantum consensus scheme and classical consensus dynamics, in that quantum consensus of n qubits naturally defines a consensus process on an induced classical graph with 22nnodes. Existing consensus results on classical networks can thus be adopted to establish the quantum consensus convergence.