We consider multi-qubit systems and relate quantitatively the problems of generating cluster states with high value of concurrence of assistance, and that of generating states with maximal bipartite entanglement. We prove an upper bound for the concurrence of assistance. We consider dynamics of spin-1/2 systems that model qubits, with different couplings and possible presence of magnetic field to investigate the appearance of the discussed entanglement properties. We find that states with maximal bipartite entanglement can be generated by an XY Hamiltonian, and their generation can be controlled by the initial state of one of the spins. The same Hamiltonian is capable of creating states with high concurrence of assistance with suitably chosen initial state. We show that the production of graph states using the Ising Hamiltonian is controllable via a single-qubit rotation of one spin-1/2 subsystem in the initial multi-qubit state. We shown that the property of Ising dynamics to convert a product state basis into a special maximally entangled basis is temporally enhanced by the application of a suitable magnetic field. Similar basis transformations are found to be feasible in the case of isotropic XY couplings with magnetic field.
If we distribute n qubits between two parties, which quantum pure states and distributions of qubits would allow all-versus-nothing (or Greenberger-Horne-Zeilinger-like) proofs of Bell's theorem using only single-qubit measurements? We show a necessary and sufficient condition for the existence of these proofs for any number of qubits, and provide all distinct proofs up to n=7 qubits. Remarkably, there is only one distribution of a state of n=4 qubits, and six distributions, each for a different state of n=6 qubits, which allow these proofs.
Using one channel to simulate another exactly with the aid of quantum no-signalling correlations has been studied recently. The one-shot no-signalling assisted classical zero-error simulation cost of non-commutative bipartite graphs has been formulated as semidefinite programms [Duan and Winter, IEEE Trans. Inf. Theory 62, 891 (2016)]. Before our work, it was unknown whether the one-shot (or asymptotic) no-signalling assisted zero-error classical simulation cost for general non-commutative graphs is multiplicative (resp. additive) or not. In this paper we address these issues and give a genera…
We introduce the general catalysts for pure entanglement transformations under local operations and classical communications in such a way that we disregard the profit and loss of entanglement of the catalysts per se. As such, the possibilities of pure entanglement transformations are greatly expanded. Remarkably, we find an interesting phenomenon that, in some situations, incomparable pairs ${| ψ> ,| ϕ> \} $ and ${| χ> ,| χ^{\prime}> \} $ can assist each other mutually so as to realize the transformation $| ψ> | χ> \to| ϕ> | χ^{\prime}>$. We also design an efficient algorithm to detect whethe…
Nonlocal unitary operations can create quantum entanglement between distributed particles, and the quantification of created entanglement is a hard problem. It corresponds to the concepts of entangling and assisted entangling power when the input states are, respectively, product and arbitrary pure states. We analytically derive them for Schmidt-rank-two bipartite unitary and some complex bipartite permutation unitaries. In particular, the entangling power of permutation unitary of Schmidt rank three can take only one of two values: $\log_2 9 - 16/9$ or $\log_2 3$ ebits. The entangling power, …
We quantify the usefulness of a bipartite quantum state in the ancilla-assisted channel discrimination of arbitrary quantum channels, formally defining a worst-case-scenario channel discrimination power for bipartite quantum states. We show that such a quantifier is deeply connected with the operator Schmidt decomposition of the state. We compute the channel discrimination power exactly for pure states, and provide upper and lower bounds for general mixed states. We show that highly entangled states can outperform any state that passes the realignment criterion for separability. Furthermore, w…
We evaluate the one-shot entanglement of assistance for an arbitrary bipartite state. This yields another interesting result, namely a characterization of the one-shot distillable entanglement of a bipartite pure state. This result is shown to be stronger than that obtained by specializing the one-shot hashing bound to pure states. Finally, we show how the one-shot result yields the operational interpretation of the asymptotic entanglement of assistance proved in [Smolin et al., Phys. Rev. A 72, 052317 (2005)].
We review the problem of discriminating entangled states from separable states for bipartite systems. We formally define what entangled states are, present some important criteria to detect entanglement, and show how they can be classified according to their capability to perform some precisely defined tasks.
A relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol.
We investigate the behavior of bipartite as well as genuine multipartite entanglement of a resonating valence bond state on a ladder. We show that the system possesses significant amounts of bipartite entanglement in the steps of the ladder while no substantial bipartite entanglement is present in the rails. Genuine multipartite entanglement present in the system is negligible. The results are in stark contrast with the entanglement properties of the same state on isotropic lattices in two and higher dimensions, indicating that the geometry of the lattice can have important implications on the…
We show that bipartite and tripartite entangled states cannot be used as catalysis states to enable local transformations inbetween inequivalent classes of three-particle entangled states which are non-interchangeable under local transformations. We find the optimal protocol for conversion of a certain family of the W-states and an EPR-pair into the GHZ-state.
We provide upper bound on the maximal rate at which irreversible quantum dynamics can generate entanglement in a bipartite system. The generator of irreversible dynamics consists of a Hamiltonian and dissipative terms in Lindblad form. The relative entropy of entanglement is chosen as a measure of entanglement in an ancilla-free system. We provide an upper bound on the entangling rate which has a logarithmic dependence on a dimension of a smaller system in a bipartite cut. We also investigate the rate of change of quantum mutual information in an ancilla-assisted system and provide an upper bo…
Entanglement assistance is known to reduce the quantum communication complexity of evaluating functions with distributed inputs. But does the type of entanglement matter, or are EPR pairs always sufficient? This is a natural question because in several other settings maximally entangled states are known to be less useful as a resource than some partially entangled state. These include non-local games, tasks with quantum communication between players and referee, and simulating bipartite unitaries or communication channels. By contrast, we prove that the bounded-error entanglement-assisted quan…
A system-ancilla bipartite state capable of containing the complete information of an unknown quantum channel acting on the system is called faithful. The equivalence between faithfulness of state and invertibility of the corresponding Jamiolkowski map proved by D'Ariano and Presti has been a useful characterization for ancilla-assisted process tomography albeit the proof was incomplete as they assumed trace nonincreasing quantum operations, not quantum channels. We complete the proof of the equivalence and introduce the generalization of faithfulness to various classes of quantum channels. We…
Two particles, initially in a product state, become entangled when they come together and start to interact. Using semiclassical methods, we calculate the time evolution of the corresponding reduced density matrix $ρ_1$, obtained by integrating out the degrees of freedom of one of the particles. To quantify the generation of entanglement, we calculate the purity ${\cal P}(t)={\rm Tr}[ρ_1(t)^2]$. We find that entanglement generation sensitively depends (i) on the interaction potential, especially on its strength and range, and (ii) on the nature of the underlying classical dynamics. Under gener…
We find that the dynamical phase transition (DPT) in nearest-neighbor bipartite entanglement of time-evolved states of the anisotropic infinite quantum XY spin chain, in a transverse time-dependent magnetic field, can be quantitatively characterized by the dynamics of an information-theoretic quantum correlation measure, namely, quantum work-deficit (QWD). We show that only those nonequilibrium states exhibit entanglement resurrection after death, on changing the field parameter during the DPT, for which the cumulative bipartite QWD is above a threshold. The results point to an interesting int…
In this paper, we study theoretically the bipartite and tripartite continuous variable entanglement as well as the normal-mode splitting in a single-atom cavity optomechanical system with intensity-dependent coupling. The system under consideration is formed by a Fabry-Perot cavity with a thin vibrating end mirror and a two-level atom in the Gaussian standing-wave of the cavity mode. We first derive the general form of Hamiltonian describing the tripartite intensity-dependent atom-field-mirror coupling due to the presence of cavity mode structure. We then restrict our treatment to the first vi…
We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the entanglement generating capacity and entanglement-assisted one-way classical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding 1-shot capacities. We give general bounds on other capacities, discuss some examples, and conclude with some open questions.
Quantum coherence, which quantifies the superposition properties of a quantum state, plays an indispensable role in quantum resource theory. A recent theoretical work [Phys. Rev. Lett. \textbf{116}, 070402 (2016)] studied the manipulation of quantum coherence in bipartite or multipartite systems under the protocol Local Incoherent Operation and Classical Communication (LQICC). Here we present the first experimental realization of obtaining maximal coherence in assisted distillation protocol based on linear optical system. The results of our work show that the optimal distillable coherence rate…
We discuss upper bounds on the rate at which unitary evolution governed by a non-local Hamiltonian can generate entanglement in a bipartite system. Given a bipartite Hamiltonian H coupling two finite dimensional particles A and B, the entangling rate is shown to be upper bounded by c*log(d)*norm(H), where d is the smallest dimension of the interacting particles, norm(H) is the operator norm of H, and c is a constant close to 1. Under certain restrictions on the initial state we prove analogous upper bound for the ancilla-assisted entangling rate with a constant c that does not depend upon dime…
We consider the problem of obtaining maximally entangled photon states at distance in the presence of loss. We compare the efficiency of two different schemes in establishing $N$ shared ebits: i) $N$ single ebit states with the qubit encoded on polarization; ii) a single continuous variable entangled state (emode) assisted by optimal local operation and classical communication (LOCC) protocol in order to obtain a $2^N$-dimensional maximally entangled state, with qubits encoded on the photon number.
We analyze implementations of bipartite unitaries by means of local operations and classical communication (LOCC) assisted by shared entanglement. We employ concepts and techniques developed in quantum Shannon theory to study an asymptotic scenario, in which two distant parties perform the same bipartite unitary on infinitely many pairs of inputs. We analyze minimum cost of entanglement and classical communication per copy. For two-round LOCC protocols, we derive a single-letter formula for the minimum cost of entanglement and classical communication, under an additional requirement that the e…
Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki criterion), in contrast to detecting bound entanglement, i.e. a curious form of entanglement that can also not be distilled into maximally (free) entangled states. Only a few bound entangled states have been found, typically by constructing dedicated entanglement witnesses, so naturally the question arises how large is the volume of those states. We define a l…
Bipartite operations underpin both classical communication and entanglement generation. Using a superposition of classical messages, we show that the capacity of a two-qubit operation for error-free entanglement-assisted bidirectional classical communication can not exceed twice the entanglement capability. In addition we show that any bipartite two-qubit operation can increase the communication that may be performed using an ensemble by twice the entanglement capability.
Quantum correlations are expected to respect all the conditions required for them to be good measures of quantumness in the bipartite scenario. In a multipartite setting, sharing entanglement between several parties is restricted by the monogamy of entanglement. We take over the concept of monogamy to an information-theoretic quantum correlation measure, and find that it violates monogamy in general. Using the notion of interaction information, we identify necessary and sufficient conditions for the measure to obey monogamy, for arbitrary pure and mixed quantum states. We show that while three…
The detection of nonlocal correlations in a Bell experiment implies almost by definition some intrinsic randomness in the measurement outcomes. For given correlations, or for a given Bell violation, the amount of randomness predicted by quantum physics, quantified by the guessing probability, can generally be bounded numerically. However, currently only a few exact analytic solutions are known for violations of the bipartite Clauser-Horne-Shimony-Holt Bell inequality. Here, we study the randomness in a Bell experiment where three parties test the tripartite Mermin-Bell inequality. We give tigh…
We consider generic pure $n$-qubit states and a general class of pure states of arbitrary dimensions and arbitrarily many subsystems. We characterize those states which can be reached from some other state via Local Operations assisted by finitely many rounds of Classical Communication ($LOCC_{\mathbb{N}}$). For $n$ qubits with $n>3$ we show that this set of states is of measure zero, which implies that the maximally entangled set is generically of full measure if restricted to the practical scenario of $LOCC_{\mathbb{N}}$. Moreover, we identify a class of states for which any $LOCC_{\mathbb{N…
We examine the powers of entanglement-assisted transformation and multiple-copy entanglement transformation. First, we find a sufficient condition of when a given catalyst is useful in producing another specific target state. As an application of this condition, for any non-maximally entangled bipartite pure state and any integer $n$ not less than 4, we are able to explicitly construct a set of $n\times n$ quantum states which can be produced by using the given state as a catalyst. Second, we prove that for any positive integer $k$, entanglement-assisted transformation with $k\times k$-dimensi…
Entanglement can effectively increase communication channel capacity as evidenced by dense coding that predicts a capacity gain of 1 bit when compared to entanglement-free protocols. However, dense coding relies on Bell states and when implemented using photons the capacity gain is bounded by $0.585$ bits due to one's inability to discriminate between the four optically encoded Bell states. In this paper we study the following question: Are there alternative entanglement-assisted protocols that rely only on linear optics, coincidence photon counting and separable single photon input states and…
Complete complementarity relations, as e.g. $P(ρ_{A})^{2} + C(ρ_{A})^{2} + E(|Ψ\rangle_{AB})^{2}=1$, constrain the local predictability, $P$, and local coherence, $C$, and the entanglement, $E$, of bipartite pure states. For pairs of qubits prepared initially in a particular class of partially entangled pure states with null local coherence, these relations were used in Ref. [Phys. Lett. A, 451, 128414 (2022)] to provide an operational connection between local predictability of the pre-measurement states with the probability of the maximally entangled components of the states after the Bell-ba…
Steering is the entanglement-based quantum effect that embodies the "spooky action at a distance" disliked by Einstein and scrutinized by Einstein, Podolsky, and Rosen. Here we provide a necessary and sufficient characterization of steering, based on a quantum information processing task: the discrimination of branches in a quantum evolution, which we dub subchannel discrimination. We prove that, for any bipartite steerable state, there are instances of the quantum subchannel discrimination problem for which this state allows a correct discrimination with strictly higher probability than in ab…
We consider a quantum relay which is used by two parties to perform several continuous-variable protocols of quantum communication, from entanglement distribution (swapping and distillation), to quantum teleportation, and quantum key distribution. The theory of these protocols is suitably extended to a non-Markovian model of decoherence characterized by correlated Gaussian noise in the bosonic environment. In the worst case scenario where bipartite entanglement is completely lost at the relay, we show that the various protocols can be reactivated by the assistance of classical (separable) corr…
We show that entanglement-assisted transformations of bipartite entangled states can be more efficient than catalysis [D. Jonathan and M. B. Plenio, Phys. Rev. Lett. 83, 3566 (1999)}, i.e., given two incomparable bipartite states not only can the transformation be enabled by performing collective operations with an auxiliary entangled state, but the entanglement of the auxiliary state itself can be enhanced. We refer to this phenomenon as supercatalysis. We provide results on the properties of supercatalysis and its relationship with catalysis. In particular, we obtain a useful necessary and s…
Zurek has derived the quantum probabilities for Schmidt basis states of bipartite quantum systems in pure joint states, from the assumption that they should be not be affected by one party's action if the action can be undone by the other party (``envariance of probability'') and an auxiliary assumption. We argue that a natural generalization of the auxiliary assumption is actually strong enough to yield the Born rule itself, but that Zurek's argument and protocol can be adapted to do without this assumption, at the cost of using envariance of probability in both directions. We consider altern…
We make a detailed comparison between entanglement harvesting for uniformly accelerated detectors in vacuum and static ones in a thermal bath at the Unruh temperature and find that, for a small energy gap relative to the Heisenberg energy of the detectors, static detectors in the thermal bath can harvest more entanglement and possess a comparatively larger harvesting-achievable range than the uniformly accelerated ones; however, as the energy gap grows sufficiently large, the uniformly accelerated detectors are instead likely to harvest more entanglement and possess a relatively larger harvest…
We investigate the polygamy relations related to the concurrence of assistance for any multipartite pure states. General polygamy inequalities given by the $α$th $(0\leq α\leq 2)$ power of concurrence of assistance is first presented for multipartite pure states in arbitrary-dimensional quantum systems. We further show that the general polygamy inequalities can even be improved to be tighter inequalities under certain conditions on the assisted entanglement of bipartite subsystems. Based on the improved polygamy relations, lower bound for distribution of bipartite entanglement is provided in a…
We give a capacity formula for the classical communication over a noisy quantum channel, when local operations and global permutations allowed in the encoding and bipartite states preshared between the sender and the receiver. The two endpoints of this formula are the Holevo capacity (without entanglement assistance) and the entanglement-assisted capacity (with unlimited entanglement assistance). What's more, we show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. We prove …
We analyze correlations between subsystems for an extended Hubbard model exactly solvable in one dimension, which exhibits a rich structure of quantum phase transitions (QPTs). The T=0 phase diagram is exactly reproduced by studying singularities of single-site entanglement. It is shown how comparison of the latter quantity and quantum mutual information allows one to recognize whether two-point or shared quantum correlations are responsible for each of the occurring QPTs. The method works in principle for any number D of degrees of freedom per site. As a by-product, we are providing a benchma…
We consider the maximum bipartite entanglement that can be distilled from a single copy of a multipartite mixed entangled state, where we focus mostly on $d\times d\times n$-dimensional tripartite mixed states. We show that this {\em assisted entanglement}, when measured in terms of the generalized concurrence (named G-concurrence) is (tightly) bounded by an entanglement monotone, which we call the G-concurrence of assistance. The G-concurrence is one of the possible generalizations of the concurrence to higher dimensions, and for pure bipartite states it measures the {\em geometric mean} of t…
We introduce and study the task of assisted coherence distillation. This task arises naturally in bipartite systems where both parties work together to generate the maximal possible coherence on one of the subsystems. Only incoherent operations are allowed on the target system while general local quantum operations are permitted on the other, an operational paradigm that we call local quantum-incoherent operations and classical communication (LQICC). We show that the asymptotic rate of assisted coherence distillation for pure states is equal to the coherence of assistance, an analog of the ent…
We present a quantum logic scheme to detect atomic and molecular ions in different states of angular momentum based on their magnetic $g$-factors. The state-dependent magnetic $g$-factors mean that electronic, rotational or hyperfine states may be distinguished by their Zeeman splittings in a given magnetic field. Driving motional sidebands of a chosen Zeeman splitting enables reading out the corresponding state of angular momentum with an auxillary logic ion. As a proof-of-principle demonstration, we show that we can detect the ground electronic state of a ${^{174}}$Yb$^+$ ion using ${^{171}}…
We consider two ensembles of qubit dissipating into two overlapping environments, that is with a certain number of qubit in common that dissipate into both environments. We then study the dynamics of bipartite entanglement between the two ensembles by excluding the common qubit. To get analytical solutions for an arbitrary number of qubit we consider initial states with a single excitation and show that the largest amount of entanglement can be created when excitations are initially located among side (non common) qubit. Moreover, the stationary entanglement exhibits a monotonic (resp. non-mon…
