Local Operations And Classical Communication Research Articles

Quantum Entanglement and Its Classification Protocols

Quantum entanglement has its own major role in quantum information theory. Its application in numerous areas namely quantum computing, quantum cryptography and quantum teleportation are proven vital and essential. Over the last decades, the interests in quantum entanglement have grown and significant progress in quantum computing has been revealed. However, the classification of entanglement was proved to be challenging especially in a higher qubit-dimensional system setting. In this review, indexed literature as the secondary resource was chosen by specific keywords from several database. In reference to the literatures review, there exists several entanglement classifications protocols that will be presented in this paper namely local unitary (LU), local operations and classical communication (LOCC), and stochastic local operations and classical communication (SLOCC). This study will offer a better understanding of quantum entanglement and the entanglement classification protocols.

Quantum routing with teleportation

We study the problem of implementing arbitrary permutations of qubits under interaction constraints in quantum systems that allow for arbitrarily fast local operations and classical communication (LOCC). In particular, we show examples of speedups over swap-based and more general unitary routing methods by distributing entanglement and using LOCC to perform quantum teleportation. We further describe an example of an interaction graph for which teleportation gives a logarithmic speedup in the worst-case routing time over swap-based routing. We also study limits on the speedup afforded by quantum teleportation—showing an O(NlogN) upper bound on the separation in routing time for any interaction graph—and give tighter bounds for some common classes of graphs. Published by the American Physical Society 2024

Quantifying the performance of bidirectional quantum teleportation

Bidirectional teleportation is a fundamental protocol for exchanging quantum information between two parties by means of a shared resource state and local operations and classical communication (LOCC). In this paper, we develop two seemingly different ways of quantifying the simulation error of unideal bidirectional teleportation by means of the normalized diamond distance and the channel infidelity, and we prove that they are equivalent. By relaxing the set of operations allowed from LOCC to those that completely preserve the positivity of the partial transpose, we obtain semi-definite programming lower bounds on the simulation error of unideal bidirectional teleportation. We evaluate these bounds for several key examples: when there is no resource state at all and for isotropic and Werner states, in each case finding an analytical solution. The first aforementioned example establishes a benchmark for classical versus quantum bidirectional teleportation. Another example consists of a resource state resulting from the action of a generalized amplitude damping channel on two Bell states, for which we find an analytical expression for the simulation error that is in agreement with numerical estimates (up to numerical precision). We then evaluate the performance of some schemes for bidirectional teleportation due to (Kiktenko et al., Phys. Rev. A 93, 062305 (2016)) and find that they are suboptimal and do not go beyond the aforementioned classical limit for bidirectional teleportation. We offer a scheme alternative to theirs that is provably optimal. Finally, we generalize the whole development to the setting of bidirectional controlled teleportation, in which there is an additional assisting party who helps with the exchange of quantum information, and we establish semi-definite programming lower bounds on the simulation error for this task. More generally, we provide semi-definite programming lower bounds on the performance of bipartite and multipartite channel simulation using a shared resource state and LOCC.

LOCC convertibility of entangled states in infinite-dimensional systems

We advance on the conversion of bipartite quantum states via local operations and classical communication (LOCC) for infinite-dimensional systems. We introduce δ-LOCC convertibility based on the observation that any pure state can be approximated by a state with finite-support Schmidt coefficients. We show that δ-LOCC convertibility of bipartite states is fully characterized by a majorization relation between the sequences of squared Schmidt coefficients, providing a novel extension of Nielsen’s theorem for infinite-dimensional systems. Hence, our definition is equivalent to the one of ε-LOCC convertibility (Owari et al 2008 Quantum Inf. Comput. 8 0030), but deals with states having finitely supported sequences of Schmidt coefficients. Additionally, we discuss the notions of optimal common resource and optimal common product in this scenario. The optimal common product always exists, whereas the optimal common resource depends on the existence of a common resource. This highlights a distinction between the resource-theoretic aspects of finite versus infinite-dimensional systems. Our results rely on the order-theoretic properties of majorization for infinite sequences, applicable beyond the LOCC convertibility problem.

Resource theory of imaginarity in distributed scenarios

The resource theory of imaginarity studies the operational value of imaginary parts in quantum states, operations, and measurements. Here we introduce and study the distillation and conversion of imaginarity in distributed scenario. This arises naturally in bipartite systems where both parties work together to generate the maximum possible imaginarity on one of the subsystems. We give exact solutions to this problem for general qubit states and pure states of arbitrary dimension. We present a scenario that demonstrates the operational advantage of imaginarity: the discrimination of quantum channels without the aid of an ancillary system. We then link this scenario to local operations and classical communications(LOCC) discrimination of bipartite states. We experimentally demonstrate the relevant assisted distillation protocol, and show the usefulness of imaginarity in the aforementioned two tasks.

Chordal graphs and distinguishability of quantum product states

We investigate a graph-theoretic approach to the problem of distinguishing quantum product states in the fundamental quantum communication framework called local operations and classical communication (LOCC). We identify chordality as the key graph structure that drives distinguishability in one-way LOCC, and we derive a one-way LOCC characterization for chordal graphs that establishes a connection with the theory of matrix completions. We also derive minimality conditions on graph parameters that allow for the determination of indistinguishability of states. We present a number of applications and examples built on these results.

Transformations in quantum networks via local operations assisted by finitely many rounds of classical communication

Recent advances have led towards first prototypes of quantum networks in which entanglement is distributed by sources producing bipartite entangled states. This raises the question of which states can be generated in quantum networks based on bipartite sources using local operations and classical communication. In this work, we study state transformations under finite rounds of local operations and classical communication (LOCC) in networks based on maximally entangled two-qubit states. We first derive the symmetries for arbitrary network structures, as these determine which transformations are possible. Then, we show that contrary to tree graphs, for which it has already been shown that any state within the same entanglement class can be reached, there exist states which can be reached probabilistically but not deterministically if the network contains a cycle. Furthermore, we provide a systematic way to determine states which are not reachable in networks consisting of a cycle. Moreover, we provide a complete characterization of the states which can be reached in a cycle network with a protocol where each party measures only once, and each step of the protocol results in a deterministic transformation. Finally, we present an example which cannot be reached with such a simple protocol, and constitutes, up to our knowledge, the first example of a LOCC transformation among fully entangled states requiring three rounds of classical communication.

An improved quantum payment protocol based on group signature without entanglement

With the popularization of E-payment, more and more electronic payment protocols have been proposed. In 2021, Lin et al. proposed a trusted third-party E-Payment protocol based on a set of three-particle local indistinguishable orthogonal product (X-LIOP) states. In this paper, we first point out that there is a security flaw where the merchant can forge the purchase goods information to sell something that the customer does not want to buy in Lin et al. protocol. Besides, the X-LIOP states used by Lin are not orthogonal and can be discriminated by Local Operation and Classical Communication (LOCC). Second, we propose a new electronic payment protocol that combines group signature and the three-particle X-LIOP states. Compared with Lin et al. protocol, customers can purchase goods anonymously in our protocol and the unforgeability of messages and signatures is guaranteed.

A special case on the distillability problem of two-copy n×n Werner states

In this paper, we delve into a nuanced aspect of the distillability problem within the realm of entanglement theory, specifically examining the distillability of anti-diagonal [Formula: see text] entangled Werner states under the framework of local operations and classical communication (LOCC). To address this, we scrutinize a conjecture central to the distillability issue, initially focusing on its implications in 4-dimensional and 5-dimensional contexts. Through rigorous calculations, we establish that these cases align with the conjecture. Subsequently, we broaden our investigation to encompass [Formula: see text] matrices, demonstrating that both even and odd n-dimensional anti-diagonal matrices are in concordance with the conjecture, thus contributing to a deeper understanding of the distillability problem in quantum entanglement.

Cross-platform comparison of arbitrary quantum processes

In this work, we present a protocol for comparing the performance of arbitrary quantum processes executed on spatially or temporally disparate quantum platforms using Local Operations and Classical Communication (LOCC). The protocol involves sampling local unitary operators, which are then communicated to each platform via classical communication to construct quantum state preparation and measurement circuits. Subsequently, the local unitary operators are implemented on each platform, resulting in the generation of probability distributions of measurement outcomes. The max process fidelity is estimated from the probability distributions, which ultimately quantifies the relative performance of the quantum processes. Furthermore, we demonstrate that this protocol can be adapted for quantum process tomography. We apply the protocol to compare the performance of five quantum devices from IBM and the “Qianshi" quantum computer from Baidu via the cloud. The experimental results unveil two notable aspects: Firstly, the protocol adeptly compares the performance of the quantum processes implemented on different quantum computers. Secondly, the protocol scales, although still exponentially, much more favorably with the number of qubits, when compared to the full quantum process tomography. We view our work as a catalyst for collaborative efforts in cross-platform comparison of quantum computers.

Understanding the interplay of entanglement and nonlocality: motivating and developing a new branch of entanglement theory

A standard approach to quantifying resources is to determine which operations on the resources are freely available, and to deduce the partial order over resources that is induced by the relation of convertibility under the free operations. If the resource of interest is the nonclassicality of the correlations embodied in a quantum state, i.e., entanglement, then the common assumption is that the appropriate choice of free operations is Local Operations and Classical Communication (LOCC). We here advocate for the study of a different choice of free operations, namely, Local Operations and Shared Randomness (LOSR), and demonstrate its utility in understanding the interplay between the entanglement of states and the nonlocality of the correlations in Bell experiments. Specifically, we show that the LOSR paradigm (i) provides a resolution of the anomalies of nonlocality, wherein partially entangled states exhibit more nonlocality than maximally entangled states, (ii) entails new notions of genuine multipartite entanglement and nonlocality that are free of the pathological features of the conventional notions, and (iii) makes possible a resource-theoretic account of the self-testing of entangled states which generalizes and simplifies prior results. Along the way, we derive some fundamental results concerning the necessary and sufficient conditions for convertibility between pure entangled states under LOSR and highlight some of their consequences, such as the impossibility of catalysis for bipartite pure states. The resource-theoretic perspective also clarifies why it is neither surprising nor problematic that there are mixed entangled states which do not violate any Bell inequality. Our results motivate the study of LOSR-entanglement as a new branch of entanglement theory.

Local discrimination of lattice states via complete graph

In this paper, we use graph theory to study the distinguishability of lattice states under local operations and classical communication (LOCC) in . Firstly, we present that for the basis of lattice unitary matrices, there are (p 2 + 1)(p + 1) distinct maximal commuting sets in p 2-dimensional system. Secondly, for any set of lattice states, we can obtain a graph G which consists of some k-complete subgraphs. Using the graph G, we show that the set can be distinguished by one-way LOCC if , where n is the number of vertices of a graph G and s k is the number of k-complete subgraphs. Moreover, we also proved that this conclusion is necessary and sufficient in . For system, our result can cover the results in (2015, Phys. Rev. A 92, 042 320); (2020, Sci. China-Phys. Mech. Astron. 63, 280 312).

Trading Causal Order for Locality.

Quantum theory admits ensembles of quantum nonlocality without entanglement (QNLWE). These ensembles consist of seemingly classical states (they are perfectly distinguishable and nonentangled) that cannot be perfectly discriminated with local operations and classical communication (LOCC). Here, we analyze QNLWE from a causal perspective, and show how to perfectly discriminate some of these ensembles using local operations and classical communication without definite causal order. Specifically, three parties with access to an instance of indefinite causal order-the Araújo-Feix-Baumeler-Wolf process-can perfectly discriminate the states in a QNLWE ensemble-the SHIFT ensemble-with local operations. Hence, this type of quantum nonlocality disappears at the expense of definite causal order while retaining classical communication. Our results thereby leverage the fact that LOCC is a conjunction of three constraints: local operations, classical communication, and definite causal order. Moreover, we show how multipartite generalizations of the Araújo-Feix-Baumeler-Wolf process are transformed into multiqubit ensembles that exhibit QNLWE. Such ensembles are of independent interest for cryptographic protocols and for the study of separable quantum operations unachievable with LOCC.

The Round Complexity of Local Operations and Classical Communication (LOCC) in Random-Party Entanglement Distillation

A powerful operational paradigm for distributed quantum information processing involves manipulating pre-shared entanglement by local operations and classical communication (LOCC). The LOCC round complexity of a given task describes how many rounds of classical communication are needed to complete the task. Despite some results separating one-round versus two-round protocols, very little is known about higher round complexities. In this paper, we revisit the task of one-shot random-party entanglement distillation as a way to highlight some interesting features of LOCC round complexity. We first show that for random-party distillation in three qubits, the number of communication rounds needed in an optimal protocol depends on the entanglement measure used; for the same fixed state some entanglement measures need only two rounds to maximize whereas others need an unbounded number of rounds. In doing so, we construct a family of LOCC instruments that require an unbounded number of rounds to implement. We then prove explicit tight lower bounds on the LOCC round number as a function of distillation success probability. Our calculations show that the original W-state random distillation protocol by Fortescue and Lo is essentially optimal in terms of round complexity.

Investigating global and topological orders of states by local measurement and classical communication: Study on SPT phase diagrams by quantum energy teleportation

Distinguishing non-local orders, including global and topological orders of states through solely local operations and classical communications (LOCC), is a highly non-trivial and challenging task since the topology of states is determined by the global characteristics of the many-body system, such as the system's symmetry and the topological space it is based on. Here, we report that we reproduced the phase diagram of Ising model and symmetry protected topological phases using the quantum energy teleportation protocol, which foresees non-trivial energy transfer between remote observers using the entanglement nature of the ground state and LOCC. The model we use includes the Haldane model, the AKLT model, and the Kitaev model. Therefore, our method paves a new general experimental framework to determine and quantify phase transitions in various condensed matter physics and statistical mechanics.

Entanglement as the cross-symmetric part of quantum discord

We show that a large class of discord measures can be used to construct entanglement monotones, by proving that the minimal discord over all cross-symmetric state extensions is non-increasing under local operations and classical communications (LOCC). In particular, the result implies that the coherence measure can be used to quantify entanglement since for each coherence measure, the corresponding correlated coherence can be also regarded as a kind of discord. It is well known that the Hilbert-Schmidt distance is not suitable for quantifying entanglement since it is not contractive under quantum operations. At last, the results presented here show that the corresponding entanglement quantifier defined with the Hilbert-Schmidt distance is non-increasing under LOCC, which refutes a long-held but unstated convention that only contractive distances can be used to construct entanglement monotones.

Completable sets of orthogonal product states with minimal nonlocality

Since the theory of quantum nonlocality without entanglement was proposed, great achievements have been made in the local distinguishability of bipartite orthogonal quantum states, but there are still many unresolved problems. In this paper, we first propose the concept of minimal nonlocality to characterize the lower bound of the amount of the elements contained in a nonlocal set of orthogonal product states. A nonlocal set of orthogonal product states has minimal nonlocality if and only if the set can be distinguished by local operations and classical communication (LOCC) after only a certain state of the set is removed. Then we give a novel method to construct completable sets with minimal nonlocality in bipartite quantum system. Compared with the existing results, the completable sets we construct have the least number of elements in the same quantum systems. Finally, we extend our construction method of completable nonlocal set with fewer elements in bipartite system to tripartite or even more multipartite quantum systems.

The SWAP imposter: Bidirectional quantum teleportation and its performance

Bidirectional quantum teleportation is a fundamental protocol for exchanging quantum information between two parties. Specifically, two individuals make use of a shared resource state as well as local operations and classical communication (LOCC) to swap quantum states. In this work, we concisely highlight the contributions of our companion paper [A. U. Siddiqui and M. M. Wilde, arXiv:2010.07905 (2020)]. We develop two different ways of quantifying the error of nonideal bidirectional teleportation by means of the normalized diamond distance and the channel infidelity. We then establish that the values given by both metrics are equal for this task. Additionally, by relaxing the set of operations allowed from LOCC to those that completely preserve the positivity of the partial transpose, we obtain semidefinite programing lower bounds on the error of nonideal bidirectional teleportation. We evaluate these bounds for some key examples—isotropic states and when there is no resource state at all. In both cases, we find an analytical solution. The second example establishes a benchmark for classical versus quantum bidirectional teleportation. Another example that we investigate consists of two Bell states that have been sent through a generalized amplitude damping channel. For this scenario, we find an analytical expression for the error, as well as a numerical solution that agrees with the former up to numerical precision.

Quantum superposition of causal structures as a universal resource for local implementation of nonlocal quantum operations

Spatial separation restricts the set of locally implementable quantum operations on distributed multipartite quantum systems. We propose that indefinite causal structure arising due to quantum superposition of different space-time geometries can be used as an independent universal resource for local implementation of any quantum operation on spatially distributed quantum systems. Consequently, all such quantum tasks that are not accomplishable by local operations and classical communication (LOCC) only also become locally accomplishable. We show that exploiting indefinite causal structure as the sole resource, it is possible to perfectly teleport the state of one agent's subsystem to the other distant laboratory in such a way that the agent at the distant laboratory can have access to the whole initially shared state in his or her laboratory and can perform any global quantum operation on the joint state locally. We further find that, after the teleportation process, the resource -- indefinite causal structure of the space-time does not get consumed. Hence, after implementing the desired quantum operation the state of the first agent's subsystem can be teleported back to its previous laboratory using the same resource. We show that this two-way teleportation is not always necessary for locally executing all nonlocal quantum tasks that are not realisable by LOCC only. Without invoking any kind of teleportation, we present a protocol for perfect local discrimination of the set of four Bell states that exploits indefinite causal structure as the sole resource. As immediate upshots, we present some more examples of such nonlocal tasks as local discrimination of the set of states exhibiting ``quantum nonlocality without entanglement" and activation of bound entangled states that are also achievable by our proposed protocol incorporating indefinite causal structure as a resource.

Quantum Machine Learning for Distributed Quantum Protocols with Local Operations and Noisy Classical Communications

Distributed quantum information processing protocols such as quantum entanglement distillation and quantum state discrimination rely on local operations and classical communications (LOCC). Existing LOCC-based protocols typically assume the availability of ideal, noiseless, communication channels. In this paper, we study the case in which classical communication takes place over noisy channels, and we propose to address the design of LOCC protocols in this setting via the use of quantum machine learning tools. We specifically focus on the important tasks of quantum entanglement distillation and quantum state discrimination, and implement local processing through parameterized quantum circuits (PQCs) that are optimized to maximize the average fidelity and average success probability in the respective tasks, while accounting for communication errors. The introduced approach, Noise Aware-LOCCNet (NA-LOCCNet), is shown to have significant advantages over existing protocols designed for noiseless communications.