Qiu-Bo Fan, Shou Zhang
We investigate probabilistic dense coding in non-symmetric Hilbert spaces of the sender's and the receiver's particles. The sender and the receiver share the multipartite non-maximally quantum channel. We also discuss the average information.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A highly entangled bipartite quantum state is more advantageous for the quantum dense coding protocol than states with low entanglement. Such a correspondence, however, does not exist even for pure quantum states in the multipartite domain. We establish a connection between the multiparty capacity of classical information transmission in quantum dense coding and several multipartite quantum correlation measures of the shared state, used in the dense coding protocol. In particular, we show that for the noiseless channel, if multipartite quantum correlations of an arbitrary multipartite state of…
We present an explicit protocol ${\cal E}_0$ for faithfully teleporting an arbitrary two-qubit state via a genunie four-qubit entangled state. By construction, our four-partite state is not reducible to a pair of Bell states. Its properties are compared and contrasted with those of the four-party GHZ and W states. We also give a dense coding scheme ${\cal D}_0$ involving our state as a shared resource of entanglement. Both ${\cal D}_0$ and ${\cal E}_0$ indicate that our four-qubit state is a likely candidate for the genunine four-partite analogue to a Bell state.
We consider generalisations of the dense coding protocol with an arbitrary number of senders and either one or two receivers, sharing a multiparty quantum state, and using a noiseless channel. For the case of a single receiver, the capacity of such information transfer is found exactly. It is shown that the capacity is not enhanced by allowing the senders to perform joint operations. We provide a nontrivial upper bound on the capacity in the case of two receivers. We also give a classification of the set of all multiparty states in terms of their usefulness for dense coding. We provide example…
We investigate the effect of noisy channels in a classical information transfer through a multipartite state which acts as a substrate for the distributed quantum dense coding protocol between several senders and two receivers. The situation is qualitatively different from the case with one or more senders and a single receiver. We obtain an upper bound on the multipartite capacity which is tightened in case of the covariant noisy channel. We also establish a relation between the genuine multipartite entanglement of the shared state and the capacity of distributed dense coding using that state…
We show that with the fourpartite quantum channel used to teleport an arbitrary two qubit state, we can construct a superdense coding protocol where it is possible to transmit 4 bits of classical information sending only 2 qubits. Alice and Bob initially share a four qubit maximally entangled state and by locally manipulating her two qubits Alice can generate 16 orthogonal maximally entangled states, which are used to encode the message transmitted to Bob. He reads the 4 bit message by a generalized Bell state measurement. A generalized protocol in which 2N bits of classical information is tra…
We proposed novel schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed scheme. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.
We show that violation of genuine multipartite Bell inequalities can be obtained with sampled, probabilistic phase space methods. These genuine Bell violations cannot be replicated if any part of the system is described by a local hidden variable theory. The Bell violations are simulated probabilistically using quantum phase-space representations. We treat mesoscopically large Greenberger-Horne-Zeilinger (GHZ) states having up to 60 qubits, using both a multipartite SU(2) Q-representation and the positive P-representation. Surprisingly, we find that sampling with phase-space distributions can …
Causality and Duality in Multipartite Generalized Probabilistic Theories
本文通过展示无信号原理与经典过程的对偶性，建立广义概率论与过程矩阵框架的联系，并提出四体经典过程及量子变体的设备无关认证。
Non-signalling quantum channels -- relevant in, e.g., the study of Bell and Einstein-Podolsky-Rosen scenarios -- may be simulated via affine combinations of local operations in bipartite scenarios. Moreover, when these channels correspond to stochastic maps between classical variables, such simulation is possible even in multipartite scenarios. These two results have proven useful when studying the properties of these channels, such as their communication and information processing power, and even when defining measures of the non-classicality of physical phenomena (such as Bell non-classicali…
Superdense coding uses entanglement as a resource to communicate classical information securely through quantum channels. A superdense coding method is optimal when its capacity reaches Holevo bound. We show that for optimality, maximal entanglement is a necessity across the bipartition of Alice and Bob, but neither absolute nor genuine multipartite entanglement is required. Unlike the previous schemes, which can transmit either even or odd bits of information, we have demonstrated a generalized dense coding protocol using the genuine multipartite entangled GHZ state to send arbitrary informat…
We present a scheme of probabilistic dense coding via a quantum channel of non-maximally entangled three-particle state. The quantum dense coding will be succeeded with a certain probability if the sender introduces an auxiliary particle and performs a collective unitary transformation. Furthermore, the average information transmitted in this scheme is calculated.
Multipartite entanglement measures: a review
本文综述了多方纠缠度量的理论，探讨了其真实意义和操作意义，并旨在启发研究人员开发新的表征方法。
Improving the probabilistic quantum teleportation efficiency of arbitrary superposed coherent state using multipartite even and odd j-spin coherent states as resource
提出利用多体偶奇j自旋相干态作为纠缠资源，通过重复GHZ态测量实现任意叠加相干态的高效概率量子隐形传态，显著提升平均保真度与成功概率。
We discuss properties of probabilistic coding of two qubits to one qutrit and generalize the scheme to higher dimensions. We show that the protocol preservers entanglement between qubits to be encoded and environment and can be also applied to mixed states. We present the protocol which enables encoding of n qudits to one qudit of dimension smaller than the Hilbert space of the original system and then probabilistically but error-free decode any subset of k qudits. We give a formula for the probability of successful decoding.
Characterizing pairwise swapping capabilities of dense coding channels
该研究提出稠密编码交换任务，推导三量子比特纯态支持该任务的充要条件，确定最优两量子比特幺正算子，证明其抗噪性及所需真正多体纠缠量随系统规模增大而降低。
We present a quantum probabilistic encryption algorithm for a private-key encryption scheme based on conjugate coding of the qubit string. A probabilistic encryption algorithm is generally adopted in public-key encryption protocols. Here we consider the way it increases the unicity distance of both classical and quantum private-key encryption schemes. The security of quantum probabilistic private-key encryption schemes against two kinds of attacks is analyzed. By using the no-signalling postulate, we show that the scheme can resist attack to the key. The scheme's security against plaintext att…
Generation of Scalable Genuine Multipartite Gaussian Entanglement with a Parametric Amplifier Network
本文提出利用参量放大器网络生成可扩展的真正多体连续变量光纠缠态，并通过PPT判据和α-形成纠缠验证了四体、六体、八体纠缠及向任意2N方的可扩展性。
We consistently formalize the probabilistic description of multipartite joint measurements performed on systems of any nature. This allows us: (1) to specify in probabilistic terms the difference between nonsignaling, the Einstein- Podolsky-Rosen (EPR) locality and Bell's locality; (2) to introduce the notion of an LHV model for an S_{1}x...xS_{N}-setting N-partite correlation experiment, with outcomes of any spectral type, discrete or continuous, and to prove both general and specific "quantum" statements on an LHV simulation in an arbitrary multipartite case; (3) to classify LHV models for a…
We study the performance of the super dense coding protocol in the presence of quantum channels with covariant noise. We first consider the bipartite case and review in a unified way the case of general Pauli channels. We discuss both the cases of unitary and non-unitary encoding. We also study the multipartite scenario and investigate the case of many senders and one receiver.
We study multipartite super dense coding in the presence of a covariant noisy channel. We investigate the case of many senders and one receiver, considering both unitary and non-unitary encoding. We study the scenarios where the senders apply local encoding or global encoding. We show that, up to some pre-processing on the original state, the senders cannot do better encoding than local, unitary encoding. We then introduce general Pauli channels as a significant example of covariant maps. Considering Pauli channels, we provide examples for which the super dense coding capacity is explicitly de…
An interesting aspect of multipartite entanglement is that for perfect teleportation and superdense coding, not the maximally entangled W states but a special class of non-maximally entangled W-like states are required. Therefore, efficient preparation of such W-like states is of great importance in quantum communications, which has not been studied as much as the preparation of W states. In this letter, we propose a simple optical scheme for efficient preparation of large-scale polarization based entangled W-like states by fusing two W-like states or expanding a W-like state with an ancilla p…
We introduce a probabilistic version of the one-shot quantum dense coding protocol in both two- and multiport scenarios, and refer to it as conclusive quantum dense coding. Specifically, we analyze the corresponding capacities of two-qubit, two-qutrit, and three-qubit shared states. We identify cases where Pauli and generalized Pauli operators are not sufficient as encoders to attain the optimal one-shot conclusive quantum dense coding capacities. We find that there is a rich connection between the capacities, and the bipartite and multipartite entanglements of the shared state.
Multipartite entanglement is an essential resource for quantum communication, quantum computing, quantum sensing, and quantum networks. The utility of a quantum state, $|ψ\rangle$, for these applications is often directly related to the degree or type of entanglement present in $|ψ\rangle$. Therefore, efficiently quantifying and characterizing multipartite entanglement is of paramount importance. In this work, we introduce a family of multipartite entanglement measures, called Concentratable Entanglements. Several well-known entanglement measures are recovered as special cases of our family of…
We explore the possibility of performing super dense coding with non-maximally entangled states as a resource. Using this we find that one can send two classical bits in a probabilistic manner by sending a qubit. We generalize our scheme to higher dimensions and show that one can communicate 2log_2 d classical bits by sending a d-dimensional quantum state with a certain probability of success. The success probability in super dense coding is related to the success probability of distinguishing non-orthogonal states. The optimal average success probabilities are explicitly calculated. We consid…
We propose a novel form of classification of multipartite states, in terms of the maximum degree of non-locality they can exhibit under any choice of local observables. This uses the hierarchy of notions previously introduced by Abramsky and Brandenburger: strong contextuality, logical contextuality, and probabilistic contextuality. We study n-qubit pure states. We conjecture that for more than 2 parties, all entangled states are logically contextual. We prove a number of results in support of this conjecture: (1) We show that all permutation-symmetric states are logically non-local. (2) We st…
Contextuality is a particular quantum phenomenon that has no analogue in classical probability theory. Given two independent systems, a natural question is how to represent such a situation as a single test space. In other words, how separate contextuality scenarios combine into a joint scenario. Under the premise that the the allowed probabilistic models satisfy the No Signalling principle, Foulis and Randall defined the unique possible way to compose two contextuality scenarios. When composing strictly-more than two test spaces, however, a variety of possible composition methods have been co…
We introduce the class of Genuinely Local Operation and Shared Randomness (LOSR) Multipartite Nonlocal correlations, that is, correlations between N parties that cannot be obtained from unlimited shared randomness supplemented by any composition of (N-1)-shared causal Generalized-Probabilistic-Theory (GPT) resources. We then show that noisy N-partite GHZ quantum states as well as the 3-partite W quantum state can produce such correlations. This proves, if the operational predictions of quantum theory are correct, that Nature's nonlocality must be boundlessly multipartite in any causal GPT. We …
We carry out probabilistic phase-space sampling of mesoscopic Schrödinger cat quantum states, demonstrating multipartite Bell violations for up to 60 qubits. We use states similar to those generated in photonic and ion-trap experiments. These results show that mesoscopic quantum superpositions are directly accessible to probabilistic sampling, and we analyze the properties of sampling errors. We also demonstrate dynamical simulation of super-decoherence in ion traps. Our computer simulations can be either exponentially faster or slower than experiment, depending on the correlations measured.
We propose a set of protocols for quantum anonymous veto (QAV) broadly categorized under the probabilistic, iterative, and deterministic schemes. The schemes are based upon different types of quantum resources. Specifically, they may be viewed as single photon-based, bipartite and multipartite entangled states-based, orthogonal state-based and conjugate coding-based. The set of the proposed schemes is analyzed for all the requirements of a valid QAV scheme (e.g., privacy, verifiability, robustness, binding, eligibility and correctness). The proposed schemes are observed to be more efficient in…
The generation of continuous-variable multipartite entangled states is important for several protocols of quantum information processing and communication, such as one-way quantum computation or controlled dense coding. In this article we theoretically show that multimode optical parametric oscillators can produce a great variety of such states by an appropriate control of the parametric interaction, what we accomplish by tailoring either the spatio-temporal shape of the pump, or the geometry of the nonlinear medium. Specific examples involving currently available optical parametric oscillator…
We study a continuous variable (CV) dense-coding protocol, originally proposed to employ a two-mode squeezed state, using a general two-mode Gaussian state as a quantum channel. We particularly obtain conditions to manifest quantum advantage by beating two well-known single-mode schemes, namely, the squeezed-state scheme (best Gaussian scheme) and the number-state scheme (optimal scheme achieving the Holevo bound). We then extend our study to a multipartite Gaussian state and investigate the monogamy of operational entanglement measured by the communication capacity under the dense-coding prot…
Dense coding with non-maximally entangled states has been investigated in many different scenarios. We revisit this problem for protocols adopting the standard encoding scheme. In this case, the set of possible classical messages cannot be perfectly distinguished due to the non-orthogonality of the quantum states carrying them. So far, the decoding process has been approached in two ways: (i) The message is always inferred, but with an associated (minimum) error; (ii) the message is inferred without error, but only sometimes; in case of failure, nothing else is done. Here, we generalize on the…
We consider the scenario of deterministic classical information transmission between multiple senders and a single receiver, when they a priori share a multipartite quantum state -- an attempt towards building a deterministic dense coding network. Specifically, we prove that in the case of two or three senders and a single receiver, generalized Greenberger-Horne-Zeilinger (gGHZ) states are not beneficial for sending classical information deterministically beyond the classical limit, except when the shared state is the GHZ state itself. On the other hand, three- and four-qubit generalized W (gW…
We show that the classical capacity of quantum states, as quantified by its ability to perform dense coding, respects an exclusion principle, for arbitrary pure or mixed three-party states in any dimension. This states that no two bipartite states which are reduced states of a common tripartite quantum state can have simultaneous quantum advantage in dense coding. The exclusion principle is robust against noise. Such principle also holds for arbitrary number of parties. This exclusion principle is independent of the content and distribution of entanglement in the multipartite state. We also fi…
The paper presents the detailed study of controlled dense coding scheme for different types of $3$ and $4-$ particle states. It consists of GHZ state, GHZ type states, Maximal Slice state, Four particle GHZ state and W class of states. It is shown that GHZ-type states can be used for controlled dense coding in a probabilistic sense. We have shown relations among parameter of GHZ type state, concurrence of the shared bipartite state by two parties with respect to GHZ type and Charlie's measurement angle $θ$. We have seen that tripartite W state and quadripartite W state cannot be used in contro…
Sources of entangled electromagnetic radiation are a cornerstone in quantum information processing and offer unique opportunities for the study of quantum many-body physics in a controlled experimental setting. While multi-mode entangled states of radiation have been generated in various platforms, all previous experiments are either probabilistic or restricted to generate specific types of states with a moderate entanglement length. Here, we demonstrate the fully deterministic generation of purely photonic entangled states such as the cluster, GHZ, and W state by sequentially emitting microwa…
Quantum channels are known to provide qualitatively better information transfer capacities over their classical counterparts. Examples include quantum cryptography, quantum dense coding, and quantum teleportation. This is a short review on paradigmatic quantum communication protocols in both bipartite as well as multipartite scenarios.
Genuine multipartite Rains entanglement
本文提出了一种新的多体纠缠度量GMRE，并展示了其作为纠缠单调量的性质及对GHZ分离的上界限制。
A non-standard teleportation scheme is proposed, wherein probabilistic teleportation is achieved in conventionally non-teleporting channels. We make use of entanglement monogamy to incorporate an unknown state in a multipartite entangled channel, such that the receiver partially gets disentangled from the network. Subsequently, the sender performs local measurement based teleportation protocol in an appropriate measurement basis, which results with the receiver in the possession of an unknown state, connected by local unitary transformation with the state to be teleported. This procedure succe…
A Hierarchy of Multipartite Correlations Based on Concentratable Entanglement
本文证明了可浓缩纠缠（CE）能在纯态上诱导出可认证不同纠缠结构的层级，发现几乎所有真正多体纠缠态均可通过CE验证，揭示了CE与编码理论的深刻联系，并提供了多达31个量子比特下绝对最大纠缠态不存在的替代证明。
Superdense Coding and Stabiliser Codes with Ising-coupled Entanglement
本文提出推广 Bell 态的 $n$-耦合态，分析其纠缠分类，并据此构造多方安全稠密编码与稳定子码协议。
We exhibit the intriguing phenomena of "Less is More" using a set of multipartite entangled states. We consider the quantum communication protocols for the {\em exact} teleportation, superdense coding, and quantum key distribution. We find that sometimes {\em less} entanglement is {\em more} useful. To understand this phenomena we obtain a condition that a resource state must satisfy to communicate a $n$-qubit pure state with $m$ terms. We find that the an appropriate partition of the resource state should have a von-Neumann entropy of ${\rm log}_{2} m$. Furthermore, it is shown that some stat…
Continuous-variable (CV) encoding allows information to be processed compactly and efficiently on quantum processors. Recently developed techniques such as controlled beam-splitter operations and the near deterministic phonon subtractions make trapped ion systems attractive for exploring CV quantum computing. Here we propose a probabilistic scheme based on the boson sculpting technique for generating multipartite highly entangled states of motional modes of trapped ion systems. We also investigate the effects of decoherence on the fidelity of the generated state by performing numerical simulat…
Quantum secret sharing schemes encrypting a quantum state into a multipartite entangled state are treated. The lower bound on the dimension of each share given by Gottesman [Phys. Rev. A \textbf{61}, 042311 (2000)] is revisited based on a relation between the reversibility of quantum operations and the Holevo information. We also propose a threshold ramp quantum secret sharing scheme and evaluate its coding efficiency.
A Causal Model for Quantifying Multipartite Classical and Quantum Correlations
本文提出一种因果模型用于量化多边经典与量子相关性，引入资源速率概念以捕获分布式计算中经典保密性之外的额外资源，并建立其与总相关性扩展之间的关系。
Thermal-dephasing-tolerant generation of Schrödinger cat states with Rydberg dressed blockade
本研究提出基于里德堡缀饰原子的抗热退相介观纠缠态生成方案，将逻辑态编码在缀饰态上，使多体纠缠相干寿命提升至里德堡态编码的约3倍，为大规模量子计算与多体里德堡量子模拟提供理论支撑。
We study when a multipartite non--local unitary operation can deterministically or probabilistically simulate another one when local operations of a certain kind -in some cases including also classical communication- are allowed. In the case of probabilistic simulation and allowing for arbitrary local operations, we provide necessary and sufficient conditions for the simulation to be possible. Deterministic and probabilistic interconversion under certain kinds of local operations are used to define equivalence relations between gates. In the probabilistic, bipartite case this induces a finite …
The more than thirty years old issue of the information capacity of quantum communication channels was dramatically clarified during the last period, when a number of direct quantum coding theorems was discovered. To considerable extent this progress is due to an interplay between the quantum communication theory and quantum information ideas related to more recent development in quantum computing. It is remarkable, however, that many probabilistic tools underlying the treatment of quantum case have their roots, and in some cases direct prototypes, in classical Shannon's theory. This paper pre…
Quantum entanglement between an arbitrary number of remote qubits is examined analytically. We show that there is a non-probabilistic way to address in one context the management of entanglement of an arbitrary number of mixed-state qubits by engaging quantitative measures of entanglement and a specific external control mechanism. Both all-party entanglement and weak inseparability are considered. We show that for $N\ge4$, the death of all-party entanglement is permanent after an initial collapse. In contrast, weak inseparability can be deterministically managed for an arbitrarily large number…
To apply network coding for quantum computation, we study the distributed implementation of unitary operations over all separated input and output nodes of quantum networks. We consider a setting of networks where quantum communication between nodes is restricted to sending just a qubit, but classical communication is unrestricted. We analyze which N-qubit unitary operations are implementable over cluster networks by investigating transformations of a given cluster network into quantum circuits. We show that any two-qubit unitary operation is implementable over the butterfly network and the gr…
In order to understand the resourcefulness of a natural quantum system in quantum communication tasks, we study the dense coding capacity (DCC) and teleportation fidelity (TF) of Haar uniformly generated random multipartite states of various ranks. We prove that when a rank-2 two-qubit state, a Werner state, and a pure state possess the same amount of entanglement, the DCC of a rank-2 state belongs to the envelope made by pure and Werner states. In a similar way, we obtain an upper bound via the generalized Greenberger-Horne-Zeilinger state for rank-2 three-qubit states when the dense coding w…
By sending a classical two-level system, one can transfer information about only \emph{two} distinguishable outcomes. Here we show that in quantum mechanics, using both the spin and path degrees of freedom of a spin-1/2 particle, and a Mach-Zehnder type interferometric arrangement with two suitable Stern-Gerlach detectors, it is possible to transfer information about \emph{four} distinguishable outcomes. This procedure does \emph{not} require using quantum entanglement as a resource as in the well-known protocol of dense coding, but instead hinges entirely on the quantum superposition principl…
Last years, bounds on the maximal quantum violation of general Bell inequalities were intensively discussed in the literature via different mathematical tools. In the present paper, we analyze quantum violation of general Bell inequalities via the LqHV (local quasi hidden variable) modelling framework, correctly reproducing the probabilistic description of every quantum correlation scenario. The LqHV mathematical framework allows us to derive for all d and N a new upper bound (2d-1)^{N-1} on the maximal violation by an N-qudit state of all general Bell inequalities, also, new upper bounds on t…
An expansion of row Markov matrices in terms of matrices related to permutations with repetitions, is introduced.It generalises the Birkhoff-von Neumann expansion of doubly stochastic matrices in terms of permutation matrices (without repetitions).An interpretation of the formalism in terms of sequences of integers that open random safes described by the Markov matrices, is presented. Various quantities that describe probabilities and correlations in this context, are discussed. The Gini index is used to quantify the sparsity (certainty) of various probability vectors. The formalism is used in…
By studying quantum information masking in non-Hermitian quantum systems, we show that mutually orthogonal quantum states can be deterministically masked, while an arbitrary set of quantum states cannot be masked in non-Hermitian quantum systems. We further demonstrate that a set of linearly independent states which are mutually $η$-orthogonal can be deterministically masked by a pseudo-unitary operator. Moreover, we study robustness of quantum information masking against noisy environments. The robustness of deterministic and probabilistic quantum information masking under different quantum n…
Being able to implement effective entanglement distribution in noisy environments is a key step towards practical quantum communication, and long-term efforts have been made on the development of it. Recently, it has been found that the null-result weak measurement (NRWM) can be used to enhance probabilistically the entanglement of a single copy of amplitude-damped entangled state. This paper investigates remote distributions of bipartite and multipartite entangled states in the amplitudedamping environment by combining NRWMs and entanglement distillation protocols (EDPs). We show that the NRW…
Quantum Compression for Distributed Entanglement
针对量子态划分不确定下的多体纠缠分布，提出联合设计资源态与压缩族的方法，通过加权Dicke态对称性优化，在固定传输预算下提升跨划分纠缠量，并给出非渐近界与实用构造。
Generalized Concentratable Entanglement via Parallelized Permutation Tests
本文提出广义可浓缩纠缠（GCE）度量，揭示其与量子Tsallis熵的关联，利用并行化置换测试在量子计算机中高效测量GCE，并证明其在LOCC下保持纠缠单调性。
The additivity problem asks if the use of entanglement can boost the information-carrying capacity of a given channel beyond what is achievable by coding with simple product states only. This has recently been shown not to be the case for phase-insensitive one-mode Gaussian channels, but remains unresolved in general. Here we consider two general classes of bosonic noise channels, which include phase-insensitive Gaussian channels as special cases: these are beamsplitters with general, potentially non-Gaussian environment states and classical noise channels with general probabilistic noise. We …
In quantum mechanics, outcomes of measurements on a state have a probabilistic interpretation while the evolution of the state is treated deterministically. Here we show that one can also treat the evolution as being probabilistic in nature and one can measure `which unitary' happened. Likewise, one can give an information-theoretic interpretation to evolutions by defining the entropy of a completely positive map. This entropy gives the rate at which the informational content of the evolution can be compressed. One cannot compress this information and still have the evolution act on an unknown…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。