Entanglement Cost Research Articles

Distillable entanglement under dually non-entangling operations

Computing the exact rate at which entanglement can be distilled from noisy quantum states is one of the longest-standing questions in quantum information. We give an exact solution for entanglement distillation under the set of dually non-entangling (DNE) operations—a relaxation of the typically considered local operations and classical communication, comprising all channels which preserve the sets of separable states and measurements. We show that the DNE distillable entanglement coincides with a modified version of the regularised relative entropy of entanglement in which the arguments are measured with a separable measurement. Ours is only the second known regularised formula for the distillable entanglement under any class of free operations in entanglement theory, after that given by Devetak and Winter for (one-way) local operations and classical communication. An immediate consequence of our finding is that, under DNE, entanglement can be distilled from any entangled state. As our second main result, we construct a general upper bound on the DNE distillable entanglement, using which we prove that the separably measured relative entropy of entanglement can be strictly smaller than the regularisation of the standard relative entropy of entanglement, solving an open problem posed by Li and Winter. Finally, we study also the reverse task of entanglement dilution and show that the restriction to DNE operations does not change the entanglement cost when compared with the larger class of non-entangling operations. This implies a strong form of irreversiblility of entanglement theory under DNE operations: even when asymptotically vanishing amounts of entanglement may be generated, entangled states cannot be converted reversibly.

Entanglement-efficient bipartite-distributed quantum computing

In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit (QPU) can be extended through distributed quantum computing (DQC), in which one can implement global operations over two QPUs by entanglement-assisted local operations and classical communication. To facilitate this type of DQC in experiments, we need an entanglement-efficient protocol. To this end, we extend the protocol in [Eisert et. al., PRA, 62:052317(2000)] implementing each nonlocal controlled-unitary gate locally with one maximally entangled pair to a packing protocol, which can pack multiple nonlocal controlled-unitary gates locally using one maximally entangled pair. In particular, two types of packing processes are introduced as the building blocks, namely the distributing processes and embedding processes. Each distributing process distributes corresponding gates locally with one entangled pair. The efficiency of entanglement is then enhanced by embedding processes, which merge two non-sequential distributing processes and hence save the entanglement cost. We show that the structure of distributability and embeddability of a quantum circuit can be fully represented by the corresponding packing graphs and conflict graphs. Based on these graphs, we derive heuristic algorithms for finding an entanglement-efficient packing of distributing processes for a given quantum circuit to be implemented by two parties. These algorithms can determine the required number of local auxiliary qubits in the DQC. We apply these algorithms for bipartite DQC of unitary coupled-cluster circuits and find a significant reduction of entanglement cost through embeddings. This method can determine a constructive upper bound on the entanglement cost for the DQC of quantum circuits.

Controlled Remote Implementation of Operations via Graph States

AbstractProtocols are proposed for controlled remote implementation of operations here. Sharing a ‐partite graph state, 2N participants collaborate to prepare the stator and realize the operation on N unknown states for distributed systems , only with the permission of a controller. The control power analysis shows that without the controller's permission, eight specified operations can be implemented with the success rate of 50%, other operations can be realized with the success rate of 25%, and thus the control power is reliable. All the implementation requirements of this protocol can be satisfied by means of local operations and classical communications, and the experimental feasibility is presented according to current techniques. The entanglement requirement of this protocol is characterized in terms of geometric measure of entanglement. It turns out to be economic to realize the control function from the perspective of entanglement cost.

Sparse Backdoor Attack Against Neural Networks

Abstract Recent studies show that neural networks are vulnerable to backdoor attacks, in which compromised networks behave normally for clean inputs but make mistakes when a pre-defined trigger appears. Although prior studies have designed various invisible triggers to avoid causing visual anomalies, they cannot evade some trigger detectors. In this paper, we consider the stealthiness of backdoor attacks from input space and feature representation space. We propose a novel backdoor attack named sparse backdoor attack, and investigate the minimum required trigger to induce the well-trained networks to make incorrect results. A U-net-based generator is employed to create triggers for each clean image. Considering the stealthiness of the trigger, we restrict the elements of the trigger between −1 and 1. In the aspect of the feature representation domain, we adopt an entanglement cost function to minimize the gap between feature representations of benign and malicious inputs. The inseparability of benign and malicious feature representations contributes to the stealthiness of our attack against various model diagnosis-based defences. We validate the effectiveness and generalization of our method by conducting extensive experiments on multiple datasets and networks.

Code-routing: a new attack on position verification

The cryptographic task of position verification attempts to verify one party's location in spacetime by exploiting constraints on quantum information and relativistic causality. A popular verification scheme known as f-routing involves requiring the prover to redirect a quantum system based on the value of a Boolean function f. Cheating strategies for the f-routing scheme require the prover use pre-shared entanglement, and security of the scheme rests on assumptions about how much entanglement a prover can manipulate. Here, we give a new cheating strategy in which the quantum system is encoded into a secret-sharing scheme, and the authorization structure of the secret-sharing scheme is exploited to direct the system appropriately. This strategy completes the f-routing task using O(SPp(f)) EPR pairs, where SPp(f) is the minimal size of a span program over the field Zp computing f. This shows we can efficiently attack f-routing schemes whenever f is in the complexity class ModpL, after allowing for local pre-processing. The best earlier construction achieved the class L, which is believed to be strictly inside of ModpL. We also show that the size of a quantum secret sharing scheme with indicator function fI upper bounds entanglement cost of f-routing on the function fI.

Exact entanglement cost of quantum states and channels under positive-partial-transpose-preserving operations

This paper establishes single-letter formulas for the exact entanglement cost of simulating quantum channels under free quantum operations that completely preserve positivity of the partial transpose (PPT). First, we introduce the $\kappa$-entanglement measure for point-to-point quantum channels, based on the idea of the $\kappa$-entanglement of bipartite states, and we establish several fundamental properties for it, including amortization collapse, monotonicity under PPT superchannels, additivity, normalization, faithfulness, and non-convexity. Second, we introduce and solve the exact entanglement cost for simulating quantum channels in both the parallel and sequential settings, along with the assistance of free PPT-preserving operations. In particular, we establish that the entanglement cost in both cases is given by the same single-letter formula, the $\kappa$-entanglement measure of a quantum channel. We further show that this cost is equal to the largest $\kappa$-entanglement that can be shared or generated by the sender and receiver of the channel. This formula is calculable by a semidefinite program, thus allowing for an efficiently computable solution for general quantum channels. Noting that the sequential regime is more powerful than the parallel regime, another notable implication of our result is that both regimes have the same power for exact quantum channel simulation, when PPT superchannels are free. For several basic Gaussian quantum channels, we show that the exact entanglement cost is given by the Holevo--Werner formula [Holevo and Werner, Phys. Rev. A 63, 032312 (2001)], giving an operational meaning of the Holevo-Werner quantity for these channels.

Computable lower bounds on the entanglement cost of quantum channels

A class of lower bounds for the entanglement cost of any quantum state was recently introduced in Lami and Regula (2023 Nature Physics) in the form of entanglement monotones known as the tempered robustness and tempered negativity. Here we extend their definitions to point-to-point quantum channels, establishing a lower bound for the asymptotic entanglement cost of any channel, whether finite or infinite dimensional. This leads, in particular, to a bound that is computable as a semidefinite program and that can outperform previously known lower bounds, including ones based on quantum relative entropy. In the course of our proof we establish a useful link between the robustness of entanglement of quantum states and quantum channels, which requires several technical developments such as showing the lower semicontinuity of the robustness of entanglement of a channel in the weak*-operator topology on bounded linear maps between spaces of trace class operators.

Complexity and entanglement in non-local computation and holography

Does gravity constrain computation? We study this question using the AdS/CFT correspondence, where computation in the presence of gravity can be related to non-gravitational physics in the boundary theory. In AdS/CFT, computations which happen locally in the bulk are implemented in a particular non-local form in the boundary, which in general requires distributed entanglement. In more detail, we recall that for a large class of bulk subregions the area of a surface called the ridge is equal to the mutual information available in the boundary to perform the computation non-locally. We then argue the complexity of the local operation controls the amount of entanglement needed to implement it non-locally, and in particular complexity and entanglement cost are related by a polynomial. If this relationship holds, gravity constrains the complexity of operations within these regions to be polynomial in the area of the ridge.

Quantum telescopy clock games

We consider the clock game-a task formulated in the framework of quantum information theory-that can be used to improve the existing schemes of quantum-enhanced telescopy. The problem of learning when a stellar photon reaches a telescope is translated into an abstract game, which we call the clock game. A winning strategy is provided that involves performing a quantum non-demolition measurement that verifies which stellar spatio-temporal modes are occupied by a photon without disturbing the phase information. We prove tight lower bounds on the entanglement cost needed to win the clock game, with the amount of necessary entangled bits equaling the number of time-bins being distinguished. This lower bound on the entanglement cost applies to any telescopy protocol that aims to non-destructively extract the time-bin information of an incident photon through local measurements, and our result implies that the protocol of Khabiboulline et al. [\text{Phys. Rev. Lett.} 123, 70504 (2019)] is optimal in terms of entanglement consumption. The full task of the phase extraction is also considered, and we show that the quantum Fisher information of the stellar phase can be achieved by local measurements and shared entanglement without the necessity of nonlinear optical operations. The optimal phase measurement is achieved asymptotically with increasing number of ancilla qubits, whereas a single qubit pair is required if nonlinear operations are allowed.

Broadcast of a restricted set of qubit and qutrit states

The no-cloning theorem forbids the distribution of an unknown state to more than one receiver. However, if the sender knows the state, and the state is chosen from a restricted set of possibilities, a procedure known as remote state preparation can be used to broadcast a state. Here we examine a remote state preparation protocol that can be used to send the state of a qubit, confined to the equator of the Bloch sphere, to an arbitrary number of receivers. The entanglement cost is less than that of using teleportation to accomplish the same task. We present a number of variations on this task, probabilistically sending an unknown qubit state to two receivers, sending different qubit states to two receivers, and sending qutrit states to two receivers. Finally, we discuss some applications of these protocols.

Entanglement cost for steering assemblages

In this paper we pose the question of how one can quantify the amount of entanglement necessary to create a given steering assemblage, when the original state and measurements are unknown. To do this, we extend the concepts of entanglement cost and entanglement of formation to steering assemblages, and show how to upper bound them with semidefinite programming. We prove that the entanglement of formation for assemblages is not generally continuous and not a flat roof extension; and use numerical analysis to illustrate these properties. Finally, we discuss the consequences of these results for assemblage-to-assemblage conversion and directions for further research.

Entanglement cost of discriminating noisy Bell states by local operations and classical communication

Entangled states can help in quantum state discrimination by local operations and classical communication (LOCC). For example, a Bell state is necessary (and sufficient) to perfectly discriminate a set of either three or four Bell states by LOCC. In this paper, we consider the task of LOCC discrimination of the states of noisy Bell ensembles, where a given ensemble consists of the states obtained by mixing the Bell states with an arbitrary two-qubit state with nonzero probabilities. It is proved that a Bell state is required for optimal discrimination by LOCC, even though the ensembles do not contain, in general, any maximally entangled state, and in specific instances, any entangled state.

Entanglement of a bipartite channel

The most general quantum object that can be shared between two distant parties is a bipartite channel, as it is the basic element to construct all quantum circuits. In general, bipartite channels can produce entangled states, and can be used to simulate quantum operations that are not local. While much effort over the last two decades has been devoted to the study of entanglement of bipartite states, very little is known about the entanglement of bipartite channels. In this work, we rigorously study the entanglement of bipartite channels as a resource theory of quantum processes. We present an infinite and complete family of measures of dynamical entanglement, which gives necessary and sufficient conditions for convertibility under local operations and classical communication. Then we focus on the dynamical resource theory where free operations are positive partial transpose (PPT) superchannels, but we do not assume that they are realized by PPT pre- and post-processing. This leads to a greater mathematical simplicity that allows us to express all resource protocols and the relevant resource measures in terms of semi-definite programs. Along the way, we generalize the negativity from states to channels, and introduce the max-logarithmic negativity, which has an operational interpretation as the exact asymptotic entanglement cost of a bipartite channel. Finally, we use the non-positive partial transpose (NPT) resource theory to derive a no-go result: it is impossible to distill entanglement out of bipartite PPT channels under any sets of free superchannels that can be used in entanglement theory. This allows us to generalize one of the long-standing open problems in quantum information - the NPT bound entanglement problem - from bipartite states to bipartite channels. It further leads us to the discovery of bound entangled POVMs.

Quantum state rotation: Circularly transferring quantum states of multiple users

Quantum state exchange is a quantum communication task for two users in which the users faithfully exchange their respective parts of an initial state under the asymptotic scenario. In this work, we generalize the quantum state exchange task to a quantum communication task for $M$ users in which the users circularly transfer their respective parts of an initial state. We assume that every pair of users may share entanglement resources, and they use local operations and classical communication in order to perform the task. We call this generalized task the (asymptotic) quantum state rotation. First of all, we formally define the quantum state rotation task and its optimal entanglement cost, which means the least amount of total entanglement required to carry out the task. We then present lower and upper bounds on the optimal entanglement cost, and provide conditions for zero optimal entanglement cost. Based on these results, we find out a difference between the quantum state rotation task for three or more users and the quantum state exchange task.

One-shot static entanglement cost of bipartite quantum channels

We first investigate the one-shot static entanglement cost to simulate a bipartite quantum channel under the set of non-entangling channels. The lower bound on the static entanglement cost is given by the generalized robustness of the target channel as well as the robust-generating power of the channel, which implies that the cost necessary to generate a bipartite quantum channel might not be retrievable in general. Next, we conceive a set of quantum channels that extends the set of non-entangling channels. We find out that the one-shot static entanglement cost under the extended set of channels is given by the channel's standard log-robustness. This gives the one-shot dynamic entanglement cost under a set of free superchannels that do not generate dynamic entanglement resource; the extended set is shown to be equivalent to the set of free superchannels.

One-Shot Manipulation of Entanglement for Quantum Channels

We show that the dynamic resource theory of quantum entanglement can be formulated using the superchannel theory. In this formulation, we identify the separable channels and the class of free superchannels that preserve channel separability as free resources, and choose the swap channels as dynamic entanglement golden units. Our first result is that the one-shot dynamic entanglement cost of a bipartite quantum channel under the free superchannels is bounded by the standard log-robustness of channels. The one-shot distillable dynamic entanglement of a bipartite quantum channel under the free superchannels is found to be bounded by a resource monotone that we construct from the hypothesis-testing relative entropy of channels with minimization over separable channels. We also address the one-shot catalytic dynamic entanglement cost of a bipartite quantum channel under a larger class of free superchannels that could generate the dynamic entanglement which is asymptotically negligible; it is bounded by the generalized log-robustness of channels.

An Extension of Entanglement Measures for Pure States

AbstractTo quantify the entanglement is one of the most important topics in quantum entanglement theory. An entanglement measure is built from measures for pure states. Conditions when the entanglement measure is entanglement monotone and convex are presented, as well as the interpretation of smoothed one‐shot entanglement cost. Next, a difference between the measure under the local operation and classical communication and the separability‐preserving operations is presented. Then, the relation between the convex roof extended method and the way here for the entanglement measures built from the geometric entanglement measure for pure states, as well as the concurrence for pure states in two‐qubit systems are considered. It is also shown that the measure is monogamous for system.

Dynamical Entanglement.

Unlike the entanglement of quantum states, very little is known about the entanglement of bipartite channels, called dynamical entanglement. Here we work with the partial transpose of a superchannel, and use it to define computable measures of dynamical entanglement, such as the negativity. We show that a version of it, the max-logarithmic negativity, represents the exact asymptotic dynamical entanglement cost. We discover a family of dynamical entanglement measures that provide necessary and sufficient conditions for bipartite channel simulation under local operations and classical communication and under operations with positive partial transpose.

α -logarithmic negativity

The logarithmic negativity of a bipartite quantum state is a widely employed entanglement measure in quantum information theory, due to the fact that it is easy to compute and serves as an upper bound on distillable entanglement. More recently, the $\kappa$-entanglement of a bipartite state was shown to be the first entanglement measure that is both easily computable and has a precise information-theoretic meaning, being equal to the exact entanglement cost of a bipartite quantum state when the free operations are those that completely preserve the positivity of the partial transpose [Wang and Wilde, Phys. Rev. Lett. 125(4):040502, July 2020]. In this paper, we provide a non-trivial link between these two entanglement measures, by showing that they are the extremes of an ordered family of $\alpha$-logarithmic negativity entanglement measures, each of which is identified by a parameter $\alpha\in[ 1,\infty] $. In this family, the original logarithmic negativity is recovered as the smallest with $\alpha=1$, and the $\kappa$-entanglement is recovered as the largest with $\alpha=\infty$. We prove that the $\alpha $-logarithmic negativity satisfies the following properties: entanglement monotone, normalization, faithfulness, and subadditivity. We also prove that it is neither convex nor monogamous. Finally, we define the $\alpha$-logarithmic negativity of a quantum channel as a generalization of the notion for quantum states, and we show how to generalize many of the concepts to arbitrary resource theories.

On the Entanglement Cost of One-Shot Compression

We revisit the task of visible compression of an ensemble of quantum states with entanglement assistance in the one-shot setting. The protocols achieving the best compression use many more qubits of shared entanglement than the number of qubits in the states in the ensemble. Other compression protocols, with potentially larger communication cost, have entanglement cost bounded by the number of qubits in the given states. This motivates the question as to whether entanglement is truly necessary for compression, and if so, how much of it is needed. Motivated by questions in communication complexity, we lift certain restrictions that are placed on compression protocols in tasks such as state-splitting and channel simulation. We show that an ensemble of the form designed by Jain, Radhakrishnan, and Sen (ICALP'03) saturates the known bounds on the sum of communication and entanglement costs, even with the relaxed compression protocols we study. The ensemble and the associated one-way communication protocol have several remarkable properties. The ensemble is incompressible by more than a constant number of qubits without shared entanglement, even when constant error is allowed. Moreover, in the presence of shared entanglement, the communication cost of compression can be arbitrarily smaller than the entanglement cost. The quantum information cost of the protocol can thus be arbitrarily smaller than the cost of compression without shared entanglement. The ensemble can also be used to show the impossibility of reducing, via compression, the shared entanglement used in two-party protocols for computing Boolean functions.