Related papers: Reaching Quantum Consensus with Directed Links: Mi…
Quantum computing is poised to redefine the algorithmic foundations of communication systems. While quantum superposition and entanglement enable quadratic or exponential speedups for specific problems, identifying use cases where these…
In this article, we present a finite time stopping criterion for consensus algorithms in networks with dynamic communication topology. Recent results provide asymptotic convergence to the consensus algorithm. However, the asymptotic…
This work addresses the complexities involved in designing distributed quantum algorithms, highlighting that quantum entanglement does not bypass the Fischer-Lynch-Paterson (FLP) impossibility theorem in asynchronous networks. Although…
The interconnection of quantum nodes holds great promise for scaling up quantum computing units and enabling information processing across long-distance quantum registers. Such quantum networks can be realized using superconducting qubits…
Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. In this manuscript, we consider a revised unambiguous discrimination of quantum resources. First, we present an upper bound of the success…
We evaluate the degree of quantum correlation between two fermions (bosons) subject to continuous time quantum walks in a one-dimensional ring lattice with periodic boundary conditions. In our approach, no particle-particle interaction is…
Graphical Models have various applications in science and engineering which include physics, bioinformatics, telecommunication and etc. Usage of graphical models needs complex computations in order to evaluation of marginal functions,so…
Quantum networks use quantum mechanics properties of entanglement and teleportation to transfer data from one node to another. Hence, it is necessary to have an efficient mechanism to distribute entanglement among quantum network nodes.…
In this paper, we study the leaderless consensus problem for multiple Lagrangian systems in the presence of parametric uncertainties and external disturbances under directed graphs. For achieving asymptotic behavior, a robust continuous…
We analyze how the transient dynamics of large dynamical systems in the vicinity of a stationary point, modeled by a set of randomly coupled linear differential equations, depends on the network topology. We characterize the transient…
The Symmetric group $S_{n}$ manifests itself in large classes of quantum systems as the invariance of certain characteristics of a quantum state with respect to permuting the qubits. The subgroups of $S_{n}$ arise, among many other…
The computation of quantum entanglement can be formulated as a high-dimensional nonconvex optimization problem with orthogonality constraints. In this work, we propose structure-preserving consensus-based optimization (CBO) methods for…
We study the quantum state transfer (QST) in a class of qubit network with on-site interaction, which is described by the generalized Hubbard model with engineered couplings. It is proved that the system of two electrons with opposite spins…
Quantum information, computation and communication, will have a great impact on our world. One important subfield will be quantum networking and the quantum Internet. The purpose of a quantum Internet is to enable applications that are…
The realization of the Quantum Internet promises transformative capabilities in secure communication, distributed quantum computing, and high-precision metrology. However, transitioning from laboratory experiments to a scalable,…
Distributing quantum correlations to each node of a network is a key aspect of quantum networking. Here, we present a robust, physically motivated protocol by which global quantum correlations, as characterized by the discord, can be…
The time evolution of a quantum state with short-range correlations after a quench to a one-dimensional critical Hamiltonian can be understood using the quasi-particle picture, which states that local entanglement spreads as if it was…
We present a method that implement directional, perfect state transfers within a branched spin network by exploiting quantum interferences in the time-domain. That provides a tool to isolate subsystems from a large and complex one.…
The efficacy of a communication network hinges upon both its physical architecture and the protocols that are employed within it. In the context of quantum communications, there exists a fundamental rate-loss tradeoff for point-to-point…
As generalizations of results of Christandl et al.\cite{8,9""} and Facer et al.\cite{Facer}, Bernasconi et al.\cite{godsil,godsil1} studied perfect state transfer (PST) between two particles in quantum networks modeled by a large class of…