14 Pages, Revtex4. Corrected typos, enlarged content, bigger introduction and more discussions. Final version that will appear in Phys. Rev. A (May, 2003)
Entanglement sharing among sites of one-particle states is considered using the measure of concurrence. These are the simplest in an hierarchy of number-specific states of many qubits and corresponds to ``one-magnon'' states of spins. We study the effects of onsite potentials that are both integrable and nonintegrable. In the integrable case we point to a metal-insulator transition that reflects on the way entanglement is shared. In the nonintegrable case the average entanglement content increases and saturates along with a transition to classical chaos. Such quantum chaotic states are shown to have universal concurrence distributions that are modified Bessel functions derivable within random matrix theory. Time-reversal breaking and time evolving states are shown to possess significantly higher entanglement sharing capacity that eigenstates of time-reversal symmetric systems. We use the ordinary Harper and kicked Harper Hamiltonians as model systems.
Negativity is regarded as an important measure of entanglement in quantum information theory. In contrast to other measures of entanglement, it is easily computable for bipartite states in arbitrary dimensions. In this paper, based on the negativity and realignment, we provide a set of entanglement-sharing constraints for multipartite states, where the entanglement is not necessarily limited to bipartite and pure states, thus aiding in the quantification of constraints for entanglement-sharing. These may find applications in studying many-body systems.
We introduce a new multiparty cryptographic protocol, which we call `entanglement sharing schemes', wherein a dealer retains half of a maximally-entangled bipartite state and encodes the other half into a multipartite state that is distributed among multiple players. In a close analogue to quantum secret sharing, some subsets of players can recover maximal entanglement with the dealer whereas other subsets can recover no entanglement (though they may retain classical correlations with the dealer). We find a lower bound on the share size for such schemes and construct two non-trivial examples b…
Perimeter Institute for Theoretical Physics（理论物理 perimeter 研究所）；Institute for Quantum Computing, Waterloo, Ontario（量子计算研究所）；Department of Physics and Astronomy, University of Waterloo（滑铁卢大学物理与天文学系）；Department of Combinatorics and Optimization, University of Waterloo（滑铁卢大学组合数学与优化系）
Quantum protocols for secret sharing usually rely on multi-party entanglement which with present technology is very difficult to achieve. Recently it has been shown that sequential manipulation and communication of a single $d-$ level state can do the same task of secret sharing between $N$ parties, hence alleviating the need for entanglement. However the suggested protocol which is based on using mutually unbiased bases, works only when $d$ is a prime number. We propose a new sequential protocol which is valid for any $d$.
We discuss limitations to sharing entanglement known as monogamy of entanglement. Our pedagogical approach commences with simple examples of limited entanglement sharing for pure three-qubit states and progresses to the more general case of mixed-state monogamy relations with multiple qudits.
Within the one-excitation context of two identical two-level atoms interacting with a common cavity, we examine the dynamics of all bipartite one-to-other entanglements between each qubit and the remaining part of the whole system. We find a new non-analytic "sudden" dynamical behavior of entanglement. Specifically, the sum of the three one-to-other entanglements of the system can be suddenly frozen at its maximal value or can be suddenly thawed from this value in a periodic manner. We calculate the onset timing of sudden freezing and sudden thawing under several different initial conditions. …
In single-qubit quantum secret sharing, a secret is shared between N parties via manipulation and measurement of one qubit at a time. Each qubit is sent to all N parties in sequence; the secret is encoded in the first participant's preparation of the qubit state and the subsequent participants' choices of state rotation or measurement basis. We present a protocol for single-qubit quantum secret sharing using polarization entanglement of photon pairs produced in type-I spontaneous parametric downconversion. We investigate the protocol's security against eavesdropping attack under common experim…
Entanglement is a key resource of quantum science for tasks that require it to be shared among participants. Within atomic, condensed matter and photonic many-body systems the distribution and sharing of entanglement is of particular importance for information processing by progressively larger and larger quantum networks. Here we report a singly-bipartitioned qubit entanglement inequality that applies to any N-party qubit pure state and is completely tight. It provides the first prescription for a direct calculation of the amount of entanglement sharing that is possible among N qubit parties.…
We study the typical entanglement properties of a system comprising two independent qubit environments interacting via a shuttling ancilla. The initial preparation of the environments is modeled using random-matrix techniques. The entanglement measure used in our study is then averaged over many histories of randomly prepared environmental states. Under a Heisenberg interaction model, the average entanglement between the ancilla and one of the environments remains constant, regardless of the preparation of the latter and the details of the interaction. We also show that, upon suitable kinemati…
We present an economical setup for faithful entanglement sharing against collective noise. It is composed of polarizing beam splitters, half wave plates, polarization independent wavelength division multiplexers, and frequency shifters. An arbitrary qubit error on the polarization state of each photon in a multi-photon system caused by the noisy channel can be rejected, without resorting to additional qubits, fast polarization modulators, and nondestructive quantum nondemolition detectors. Its success probability is in principle 100%, which is independent of the noise parameters, and it can be…
The limitation on the sharing of entanglement is a basic feature of quantum theory. For example, if two qubits are completely entangled with each other, neither of them can be at all entangled with any other object. In this paper we show, at least for a certain standard definition of entanglement, that this feature is lost when one replaces the usual complex vector space of quantum states with a real vector space. Moreover, the difference between the two theories is extreme: in the real-vector-space theory, there exist states of arbitrarily many binary objects, "rebits," in which every rebit i…
Quantum secret sharing (QSS) schemes without entanglement have huge advantages in scalability and are easier to realize as they only require sequential communications of a single quantum system. However, these schemes often come with drawbacks such as exact ($n, n$) structure, security flaws and absences of effective cheating detections. To address these problems, we propose a verifiable framework by utilizing entanglement-free states to construct ($t, n$)-QSS schemes. Our work is the heuristic step towards information-theoretical security in entanglement-free QSS, and it sheds light on how to…
Quantum teleportation by utilizing helical spin chains for sharing entanglement
The University of Queensland（昆士兰大学）；Martin-Luther-Universität Halle-Wittenberg（哈勒-维滕贝格马丁路德大学）；Indian Institute of Technology (Banaras Hindu University)（印度理工学院(贝拿勒斯印度教大学)）
Entanglement Split:Comment on ``Quantum secret sharing based on reusable Greenberger-Horne-Zeilinger states as secure carriers'' [Phys. Rev. A 67, 044302 (2003)]
Protocols for sharing genuine multipartite entanglement by employing copies of biseparable states
International Institute of Information Technology Hyderabad（海德拉巴国际信息技术学院）；Harish-Chandra Research Institute（哈里什-钱德拉研究所）；Homi Bhabha National Institute（霍米·巴巴国立研究所）；VIT-AP University（维特-AP大学）
We propose an entanglement sharing protocol based on separable states. Initially, two parties, Alice and Bob, share a two-mode separable Gaussian state. Alice then splits her mode into two separable modes and distributes them between two players. Bob is separable from the players but he can create entanglement with either of the players if the other player moves to his location and collaborates with him. Any two parties are separable and the creation of entanglement is thus mediated by transmission of a mode which is separable from individual modes on Alice's and Bob's side. For the state shar…
The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it. While several variants of this protocol have been investigated, including realizations using quantum systems, the security of quantum secret sharing schemes still remains unproven almost two decades after their original conception. Here we establish an unconditional security proof for continuous variable entanglement-based quantum secret sharing schemes, in …
We study the existence of absolutely maximally entangled (AME) states in quantum mechanics and its applications to quantum information. AME states are characterized by being maximally entangled for all bipartitions of the system and exhibit genuine multipartite entanglement. With such states, we present a novel parallel teleportation protocol which teleports multiple quantum states between groups of senders and receivers. The notable features of this protocol are that (i) the partition into senders and receivers can be chosen after the state has been distributed, and (ii) one group has to perf…
Suppose a set of $m$-partite, $m\geq3$, pure orthogonal fully separable states is given. We consider the task of distinguishing these states perfectly by local operations and classical communication (LOCC) in different $k$-partitions, $1<k<m$. Based on this task, it is possible to classify the sets of product states into different classes. For tripartite systems, a classification of the sets with explicit examples is presented. Few important cases related to the aforesaid task are also studied when the number of parties, $m\geq4$. These cases never appear for a tripartite system. However, to d…
Perimeter Institute for Theoretical Physics（佩里尔理论物理研究所）；Department of Physics and Astronomy, University of Waterloo（滑铁卢大学物理与天文学系）；Institute for Quantum Computing, University of Waterloo（滑铁卢大学量子计算研究所）；IBM Quantum（IBM量子）；National Research Council Canada（加拿大国家研究委员会）；Department of Physics, Rikkyo University（立教大学物理系）；Dahlem Center for Complex Quantum Systems, Freie Universität Berlin（柏林自由大学达莱姆复杂量子系统中心）
We consider the problem of establishing entangled states of optimal singlet fraction and negativity between two remote parties for every use of a noisy quantum channel and trace-preserving LOCC under the assumption that the parties do not share prior correlations. We show that for a family of quantum channels in every finite dimension $d\geq3$, one-shot optimal singlet fraction and entanglement negativity are attained only with appropriate nonmaximally entangled states. We further show that the generalization of the formula that exactly computes one-shot optimal singlet fraction for qubit chan…
Secret sharing is a multi-party cryptographic primitive that can be applied to a network of partially distrustful parties for encrypting data that is both sensitive (it must remain secure) and important (it must not be lost or destroyed). When sharing classical secrets (as opposed to quantum states), one can distinguish between protocols that leverage bi-partite quantum key distribution (QKD) and those that exploit multi-partite entanglement. The latter class are known to be vulnerable to so-called participant attacks and, while progress has been made recently, there is currently no analysis t…
Maximally entangled states--a resource for quantum information processing--can only be shared through noiseless quantum channels, whereas in practice channels are noisy. Here we ask: Given a noisy quantum channel, what is the maximum attainable purity (measured by singlet fraction) of shared entanglement for single channel use and local trace preserving operations? We find an exact formula of the maximum singlet fraction attainable for a qubit channel and give an explicit protocol to achieve the optimal value. The protocol distinguishes between unital and nonunital channels and requires no loc…
Measurement-device-independent entanglement witness (MDI-EW) will always give an affirmative certification for witnessing entanglement with untrusted measurement apparatuses. Using the MDI-EW method, we propose a measurement-device-independent quantum secret sharing (MDI-QSS) protocol that Charlie can securely distribute a key between the two agents Alice and Bob. A tight bound for collective attacks can provide good bounds on the long-distance MDI-QSS with source flaws. Then we show through numerical simulations that using single-photon source a secure QSS over 136 km can be achieved.
