Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1903.09655

Entanglement theory in distributed quantum information processing

隼汰 山崎

Published Mar 22, 2019• 7 citations
arXivHTMLPDF

Abstract

Distributed quantum information processing is a promising platform for scaling up quantum information processing, where small- and intermediate-scale quantum devices are connected by a network of quantum channels for communicating quantum information, so as to cooperate in achieving larger-scale information processing. In such distributed settings, entangled states shared among the multiple devices serve as a resource for achieving nonlocal information processing tasks by local operations and classical communication (LOCC), where transformations of multipartite entangled states play central roles. This thesis analyzes properties of quantum entanglement in these small- and intermediate-scale settings and multipartite settings. The first part of this thesis investigates a communication task, quantum state merging, on the small and intermediate scales. The second part of this thesis analyzes multipartite entanglement in distributed quantum information processing. These analyses clarify fundamental limitations and potential applications of distributed quantum information processing to characterize properties of quantum entanglement in the small- and intermediate-scale settings and multipartite settings, providing a paradigm for investigating multipartite entanglement in distributed quantum information processing over networks beyond the state convertibility under LOCC.

DOI
10.48550/arxiv.1903.09655

Related papers

分散型量子情報処理のエンタングルメント理論

Hayata Yamasaki

Distributed quantum information processing is a promising platform for scaling up quantum information processing, where small-and intermediate-scale quantum devices are connected by a network of quantum channels for communicating quantum information, so as to cooperate in achieving larger-scale information processing.In I express my sincere thanks to

•Mar 25, 2019•0 citations

Resources for quantum information tasks: from the bipartite to the multipartite scenario

Mafalda L. Almeida

Quantum physics provides results at information processing tasks that are unattainable by any classical theory. The aim of this thesis is to identify and characterize quantum entanglement and quantum nonlocality, the key resources used at quantum information protocols. We consider the problem of finding better experimental schemes to detect entangled states. For that, we study approximate physical realizations to non-physical processes, which provide the most efficient method to identify entanglement. We prove that many of these physical approximations have a simple experimental implementation. We then study characterization of quantum nonlocality. We introduce a method using the multipartite scenario, where more than two parties are involved, which provides several results on bipartite and multipartite quantum nonlocality. First, we prove that there exist quantum states which contain full multipartite nonlocality, which consist of the strongest kind of nonlocality. then, we prove that the combined use of several copies of a state can activate its nonlocal properties. In particular, this holds for bipartite and genuine multipartite nonlocality. Finally, we characterize quantum nonlocality by distinguishing it from stronger-than-quantum nonlocality. We construct a multipartite game for which classical and quantum players perform equally well, but for which supre-quantum players can sometimes provide an advantage. Our results suggest that physical resources might obbey a generalized no-signaling principle ( according to which ther's no instantaneous communication).

•Jan 1, 2010•0 citations

Distributing and tailoring noisy resource states in quantum networks

Maria Flors Mor-Ruiz

Quantum information science is an interdisciplinary field that investigates the principles and applications of quantum mechanics in information processing. Upcoming quantum technologies promise a range of valuable applications, including powerful simulation of complex systems, enhanced computational capabilities, high-precision sensing and metrology, and secure communication via quantum key distribution. A central concept is entanglement, a unique type of correlation between quantum systems that has no classical counterpart. Entanglement plays a pivotal role in many quantum protocols, particularly as a key resource in quantum communication, where protocols such as distributed quantum computation and secret sharing are executed in a distributed setting. Hence, distributing entanglement over long distances and manipulating it locally is essential for enabling quantum communication applications. However, the effectiveness of such applications is limited by the challenges of transmitting quantum information and maintaining precise control over quantum systems. For example, quantum information carriers, such as photons traveling through optical fibers, may be lost, or the operations performed may not be perfect. Consequently, it is crucial to develop robust tools for distributing and manipulating entanglement in distributed settings in order to fully unlock the capabilities of quantum technologies. In this thesis, we explore the influence of noise on the manipulation of entanglement in entanglement-based quantum networks. First, we examine the noise resilience of various resource states, i.e., pre-established entangled states, used to achieve bipartite or tripartite communication. This is followed by an analysis of a fully asymmetric network scenario, incorporating the noise introduced by the delays from classical messaging within the quantum network. We then propose classical communication protocols to achieve bipartite communication and evaluate their noise impact under the optimization of the arrangement of the pre-established entanglement. In addition, we propose an alternative approach to quantum repeaters, a key device for entanglement distribution, based on growing multipartite states, allowing entanglement to be recycled and patched. All investigations have been carried out employing a novel formalism, also developed in this thesis, for efficiently and accurately simulating noisy quantum processes on classical hardware, with broader applicability beyond quantum communication.

•Jan 1, 2025•0 citations

Information Theoretical Analysis of Distributed Quantum Computation

若桑, 江友里

Distributed quantum computation is a task in which many distant parties perform a large quantum computation in collaboration with each other, by using classical communication, quantum communication or shared entanglement as resources.In this thesis, we consider one of the simplest nontrivial task of distributed quantum computation, that is, implementation of bipartite unitary by LOCC (local operations and classical communication) assisted by shared entanglement.Here, two input states are distributed over two distant parties.Contrary to previous researches, we consider an asymptotic scenario in which the two parties perform the same bipartite unitary on infinitely many independent input pairs.We analyze the minimum amount of resources required for the task by exploiting concepts and techniques developed in the field of quantum Shannon theory, which has originally been developed to analyze quantum communication.As a tool for analyzing distributed quantum computation, we first introduce a task that we call Markovianization.Markovianization is a task in which a tripartite pure state is transformed to a state called quantum Markov chain, by a randomizing operation on one of the three subsystems.We derive the minimum cost of randomness required for Markovianization (Markovianizing cost) by exploiting a novel decomposition of a Hilbert space introduced in the context of quantum cryptography.We then apply the obtained result to distributed quantum computation.We mainly consider implementation of bipartite unitaries by entanglement-assisted LOCC protocols consisting of three steps, called one-round protocols.This is the first nontrivial case because it is not possible to implement bipartite unitaries by protocols consisting of only one or two steps.Our main result is that we derive the minimum costs of entanglement and classical communication.We show that the minimum costs are given by the Markovianizing cost of a tripartite state associated with the unitary.The result indicates that information about input states of computation is divided into three components: one of which only information of amplitude in a basis is required for computation (information of phase is not), another of which both amplitude and phase information are required, and the other of which no information is involved in computation.Our construction of a protocol that requires the smallest amount of resources is based on this decomposition.We also propose a method to compute the Markovianizing cost of a state associated with the unitary.We also consider two-round protocols, that is, protocols consisting of concatenation of two one-round protocols, for two-qubit controlled unitaries.We show that, for a particular class of two-qubit controlled unitaries, the minimum entanglement cost in two-round protocols is strictly smaller than that in one-round protocols.This result is the first reported case that indicates a property of a trade-off relation between entanglement requirement and the number of turns in entanglement-assisted LOCC tasks.The research in this thesis opens a possibility to build a new bridge between quantum computation theory and quantum communication theory, which are the two largest subfield of quantum information theory, by analyzing a problem in the former using concepts and techniques developed in the latter.

•Mar 24, 2015•0 citations

Entanglement and Causal Relation in distributed quantum computation

Seiseki Akibue

In this thesis, we investigate two different aspects of entanglement and classical communication in distributed quantum computation (DQC). In the first part, we analyze implementable computation over a given quantum network resource by introducing a new concept, quantum network coding for quantum computation. We consider a setting of networks where quantum communication for each edge of a network is restricted to sending one-qubit, but classical communication is unrestricted. Specifically, we analyze implementable $k$-qubit unitary operations over a certain class of networks, called cluster networks. We show that any two-qubit unitary operation is implementable over the butterfly network and the grail network, which are fundamental primitive networks for network coding. We also obtain necessary and sufficient conditions for the probabilistic implementability of unitary operations over cluster networks. In the second part, we investigate resource tradeoffs in DQC. First, we show that entanglement required for local state discrimination can be substituted by less entanglement by increasing the rounds of classical communication. Second, we develop a new framework of deterministic joint quantum operations by using a causal relation between the outputs and inputs of the local operations without predefined causal order, called "classical communication" without predefined causal order (CC*). We show that local operations and CC* (LOCC*) is equivalent to the separable operation (SEP). This result indicates that entanglement-assisted LOCC implementing SEP can be simulated by LOCC* without entanglement. We also investigate the relationship between LOCC* and another formalism for deterministic joint quantum operations without assuming predefined causal order based on the quantum process formalism. As a result, we construct an example of non-LOCC SEP by using LOCC*.

arXiv:2202.06518•Feb 14, 2022•4 citations

Exploring Quantum Information Flow in Multi-Particle Entangled Networks

Dr. Ruman Singh

Quantum information science has altered the concept of the method of processing and transporting information through the laws of quantum mechanics. Quantum entanglement is one of its basic properties, which is instrumental to non-classical correlations between spatially separate particles. New quantum communication networks and quantum computing systems distributed are based on these interrelations. In this paper, quantum information flow dynamics of multi-particle entangled networks with particular emphasis to the processes governing information transmission, redistribution and maintenance of coupled quantum nodes are discussed. The paper discloses the way in which the entangled structures comprising multiple entities can help in facilitating the sharing of information beyond the capabilities of the classical communication systems. Complex entangled structures are analyzed in terms of the channels through which the flow of quantum information is analyzed in respect to the theoretical models of multi-qubit systems and networked quantum channels. The way the communication between the particles influences the coherence, strength of correlation, as well as the stability of the whole network in general, is given particular attention. The effect of environmental noise and decoherence which can cause a break of entanglement and the loss of efficiency in quantum information exchange is also considered in the analysis. Moreover, the article discusses the application of network topology in order to establish the behaviour of entangled systems. The impact of the structural changes on information transfer reliability and speed is determined by the evaluation of the various forms of quantum nodes and connections. These findings suggest that entangled networks structured appropriately will be able to enhance stability of quantum communication and assist in distributing quantum resources more efficiently. Overall, the present research can be deemed as part of the bigger initiative of scaling up quantum communication infrastructures. The research builds knowledge in the sense that it provides an insight into the behavior of information in multi-particle entangled networks with important considerations being made as to the advancement of robust quantum networks which can be used in future to support the realization of future applications in the area of secure communication, distributed computing and the future developments in information processing technologies.

Scriptora International Journal of Research and Innovation (SIJRI)•Feb 5, 2026•0 citations
Distributed quantum information processing is a promising platform for scaling up quantum information processing, where small- and intermediate-scale quantum devices are connected by a network of quantum channels for communicating quantum information, so as to cooperate in achieving larger-scale information processing. In such distributed settings, entangled states shared among the multiple devices serve as a resource for achieving nonlocal information processing tasks by local operations and classical communication (LOCC), where transformations of multipartite entangled states play central roles. This thesis analyzes properties of quantum entanglement in these small- and intermediate-scale settings and multipartite settings. The first part of this thesis investigates a communication task, quantum state merging, on the small and intermediate scales. The second part of this thesis analyzes multipartite entanglement in distributed quantum information processing. These analyses clarify fundamental limitations and potential applications of distributed quantum information processing to characterize properties of quantum entanglement in the small- and intermediate-scale settings and multipartite settings, providing a paradigm for investigating multipartite entanglement in distributed quantum information processing over networks beyond the state convertibility under LOCC.
Quantum physics provides results at information processing tasks that are unattainable by any classical theory. The aim of this thesis is to identify and characterize quantum entanglement and quantum nonlocality, the key resources used at quantum information protocols. We consider the problem of finding better experimental schemes to detect entangled states. For that, we study approximate physical realizations to non-physical processes, which provide the most efficient method to identify entanglement. We prove that many of these physical approximations have a simple experimental implementation. We then study characterization of quantum nonlocality. We introduce a method using the multipartite scenario, where more than two parties are involved, which provides several results on bipartite and multipartite quantum nonlocality. First, we prove that there exist quantum states which contain full multipartite nonlocality, which consist of the strongest kind of nonlocality. then, we prove that the combined use of several copies of a state can activate its nonlocal properties. In particular, this holds for bipartite and genuine multipartite nonlocality. Finally, we characterize quantum nonlocality by distinguishing it from stronger-than-quantum nonlocality. We construct a multipartite game for which classical and quantum players perform equally well, but for which supre-quantum players can sometimes provide an advantage. Our results suggest that physical resources might obbey a generalized no-signaling principle ( according to which ther's no instantaneous communication).
Quantum information science is an interdisciplinary field that investigates the principles and applications of quantum mechanics in information processing. Upcoming quantum technologies promise a range of valuable applications, including powerful simulation of complex systems, enhanced computational capabilities, high-precision sensing and metrology, and secure communication via quantum key distribution. A central concept is entanglement, a unique type of correlation between quantum systems that has no classical counterpart. Entanglement plays a pivotal role in many quantum protocols, particularly as a key resource in quantum communication, where protocols such as distributed quantum computation and secret sharing are executed in a distributed setting. Hence, distributing entanglement over long distances and manipulating it locally is essential for enabling quantum communication applications. However, the effectiveness of such applications is limited by the challenges of transmitting quantum information and maintaining precise control over quantum systems. For example, quantum information carriers, such as photons traveling through optical fibers, may be lost, or the operations performed may not be perfect. Consequently, it is crucial to develop robust tools for distributing and manipulating entanglement in distributed settings in order to fully unlock the capabilities of quantum technologies. In this thesis, we explore the influence of noise on the manipulation of entanglement in entanglement-based quantum networks. First, we examine the noise resilience of various resource states, i.e., pre-established entangled states, used to achieve bipartite or tripartite communication. This is followed by an analysis of a fully asymmetric network scenario, incorporating the noise introduced by the delays from classical messaging within the quantum network. We then propose classical communication protocols to achieve bipartite communication and evaluate their noise impact under the optimization of the arrangement of the pre-established entanglement. In addition, we propose an alternative approach to quantum repeaters, a key device for entanglement distribution, based on growing multipartite states, allowing entanglement to be recycled and patched. All investigations have been carried out employing a novel formalism, also developed in this thesis, for efficiently and accurately simulating noisy quantum processes on classical hardware, with broader applicability beyond quantum communication.
Distributed quantum computation is a task in which many distant parties perform a large quantum computation in collaboration with each other, by using classical communication, quantum communication or shared entanglement as resources.In this thesis, we consider one of the simplest nontrivial task of distributed quantum computation, that is, implementation of bipartite unitary by LOCC (local operations and classical communication) assisted by shared entanglement.Here, two input states are distributed over two distant parties.Contrary to previous researches, we consider an asymptotic scenario in which the two parties perform the same bipartite unitary on infinitely many independent input pairs.We analyze the minimum amount of resources required for the task by exploiting concepts and techniques developed in the field of quantum Shannon theory, which has originally been developed to analyze quantum communication.As a tool for analyzing distributed quantum computation, we first introduce a task that we call Markovianization.Markovianization is a task in which a tripartite pure state is transformed to a state called quantum Markov chain, by a randomizing operation on one of the three subsystems.We derive the minimum cost of randomness required for Markovianization (Markovianizing cost) by exploiting a novel decomposition of a Hilbert space introduced in the context of quantum cryptography.We then apply the obtained result to distributed quantum computation.We mainly consider implementation of bipartite unitaries by entanglement-assisted LOCC protocols consisting of three steps, called one-round protocols.This is the first nontrivial case because it is not possible to implement bipartite unitaries by protocols consisting of only one or two steps.Our main result is that we derive the minimum costs of entanglement and classical communication.We show that the minimum costs are given by the Markovianizing cost of a tripartite state associated with the unitary.The result indicates that information about input states of computation is divided into three components: one of which only information of amplitude in a basis is required for computation (information of phase is not), another of which both amplitude and phase information are required, and the other of which no information is involved in computation.Our construction of a protocol that requires the smallest amount of resources is based on this decomposition.We also propose a method to compute the Markovianizing cost of a state associated with the unitary.We also consider two-round protocols, that is, protocols consisting of concatenation of two one-round protocols, for two-qubit controlled unitaries.We show that, for a particular class of two-qubit controlled unitaries, the minimum entanglement cost in two-round protocols is strictly smaller than that in one-round protocols.This result is the first reported case that indicates a property of a trade-off relation between entanglement requirement and the number of turns in entanglement-assisted LOCC tasks.The research in this thesis opens a possibility to build a new bridge between quantum computation theory and quantum communication theory, which are the two largest subfield of quantum information theory, by analyzing a problem in the former using concepts and techniques developed in the latter.
In this thesis, we investigate two different aspects of entanglement and classical communication in distributed quantum computation (DQC). In the first part, we analyze implementable computation over a given quantum network resource by introducing a new concept, quantum network coding for quantum computation. We consider a setting of networks where quantum communication for each edge of a network is restricted to sending one-qubit, but classical communication is unrestricted. Specifically, we analyze implementable kkk-qubit unitary operations over a certain class of networks, called cluster networks. We show that any two-qubit unitary operation is implementable over the butterfly network and the grail network, which are fundamental primitive networks for network coding. We also obtain necessary and sufficient conditions for the probabilistic implementability of unitary operations over cluster networks. In the second part, we investigate resource tradeoffs in DQC. First, we show that entanglement required for local state discrimination can be substituted by less entanglement by increasing the rounds of classical communication. Second, we develop a new framework of deterministic joint quantum operations by using a causal relation between the outputs and inputs of the local operations without predefined causal order, called "classical communication" without predefined causal order (CC*). We show that local operations and CC* (LOCC*) is equivalent to the separable operation (SEP). This result indicates that entanglement-assisted LOCC implementing SEP can be simulated by LOCC* without entanglement. We also investigate the relationship between LOCC* and another formalism for deterministic joint quantum operations without assuming predefined causal order based on the quantum process formalism. As a result, we construct an example of non-LOCC SEP by using LOCC*.
Quantum information science has altered the concept of the method of processing and transporting information through the laws of quantum mechanics. Quantum entanglement is one of its basic properties, which is instrumental to non-classical correlations between spatially separate particles. New quantum communication networks and quantum computing systems distributed are based on these interrelations. In this paper, quantum information flow dynamics of multi-particle entangled networks with particular emphasis to the processes governing information transmission, redistribution and maintenance of coupled quantum nodes are discussed. The paper discloses the way in which the entangled structures comprising multiple entities can help in facilitating the sharing of information beyond the capabilities of the classical communication systems. Complex entangled structures are analyzed in terms of the channels through which the flow of quantum information is analyzed in respect to the theoretical models of multi-qubit systems and networked quantum channels. The way the communication between the particles influences the coherence, strength of correlation, as well as the stability of the whole network in general, is given particular attention. The effect of environmental noise and decoherence which can cause a break of entanglement and the loss of efficiency in quantum information exchange is also considered in the analysis. Moreover, the article discusses the application of network topology in order to establish the behaviour of entangled systems. The impact of the structural changes on information transfer reliability and speed is determined by the evaluation of the various forms of quantum nodes and connections. These findings suggest that entangled networks structured appropriately will be able to enhance stability of quantum communication and assist in distributing quantum resources more efficiently. Overall, the present research can be deemed as part of the bigger initiative of scaling up quantum communication infrastructures. The research builds knowledge in the sense that it provides an insight into the behavior of information in multi-particle entangled networks with important considerations being made as to the advancement of robust quantum networks which can be used in future to support the realization of future applications in the area of secure communication, distributed computing and the future developments in information processing technologies.