Jaroslav Hruby
We define an anti-quantum bit state via analogous way as the anti-state in Particle Physics.We show the quantum information Feymann diagrams for the teleportations and superdense coding, which preserve the information flow. The role of information vacuum and anihilation between error information and anti-information is mentioned for the stability of quantum computing.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We investigate the usefulness of a recently introduced five qubit state by Brown $\it et al. \normalfont$ \cite{Brown} for quantum teleportation, quantum state sharing and superdense coding. It is shown that this five-qubit state can be utilized for perfect teleportation of arbitrary single and two qubit systems. We devise various schemes for quantum state sharing of an arbitrary single and two particle state via cooperative teleportation. We later show that this state can be used for superdense coding as well. It is found that five classical bits can be sent by sending only three quantum bits…
We describe a method to non-obliviously communicate a 2l-qubit quantum state by physically transmitting l+o(l) qubits of communication, and by consuming l ebits of entanglement and some shared random bits. In the non-oblivious scenario, the sender has a classical description of the state to be communicated. Our method can be used to communicate states that are pure or entangled with the sender's system; l+o(l) and 3l+o(l) shared random bits are sufficient respectively.
We introduce a general odd qubit entangled system composed of GHZ and Bell pairs and explicate its usefulness for quantum teleportation, information splitting and superdense coding. After demonstrating the superdense coding protocol on the five qubit system, we prove that '2N +1' classical bits can be sent by sending 'N+1' quantum bits using this channel. It is found that the five-qubit system is also ideal for arbitrary one qubit and two qubit teleportation and quantum information splitting (QIS). For the single qubit QIS, three different protocols are feasible, whereas for the two qubit QIS,…
Superdense Coding using Bragg Diffracted Hyperentangled Atoms
本文提出利用腔QED中布拉格衍射生成的超纠缠原子实现超密编码，使Alice通过单个超纠缠原子传输2比特经典信息，并借助多自由度增强编码信息的安全性。
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…
Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a single qubit. In this paper, the maximum classical channel capacity for states that are not maximally entangled is derived. Particular schemes are then shown to attain this capacity, firstly for pairs of qubits, and secondly for pairs of qutrits.
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…
GKP-inspired high-dimensional superdense coding with energy-time entanglement
本文提出了一种基于能量-时间纠缠态的高维超密集编码协议，利用双光子频率梳实现每光子约8.91比特的传输率，超过现有方案并具有更优光学损耗。
Quantum protocols require access to large-scale entangled quantum states, due to the requirement of channel capacity. As a promising candidate, the high-dimensional orbital angular momentum (OAM) entangled states have been implemented, but only one of four OAM Bell states in each individual subspace can be distinguished. Here we demonstrate the first realization of complete OAM Bell-state measurement (OAM-BSM) in an individual subspace, by seeking the suitable unitary matrix performable using only linear optics and breaking the degeneracy of four OAM Bell states in ancillary polarization dimen…
As we know, the states of triqubit systems have two important classes: GHZ-class and W-class. In this paper, the states of W-class are considered for teleportation and superdense coding, and are generalized to multi-particle systems. First we describe two transformations of the shared resources for teleportation and superdense coding, which allow many new protocols from some known ones for that. As an application of these transformations, we obtain a sufficient and necessary condition for a state of W-class being suitable for perfect teleportation and superdense coding. As another application,…
Rigidity of superdense coding
本文证明超密编码任务的刚性，即任意协议局部等价于Bennett-Wiesner协议，并构造高维不等价协议及分析随机编码性能。
Optimal Superdense Coding Capacity in the Non-Markovian Regime
该研究提出含辅助量子比特的模型诱导非马尔可夫动力学，考察多参数下超密编码等的行为，发现非经典关联与量子Fisher信息显著相关，可探测非马尔可夫区域的最优超密编码容量。
Recently, Harrow et al. [Phys. Rev. Lett. 92, 187901 (2004)] gave a method for preparing an arbitrary quantum state with high success probability by physically transmitting some qubits, and by consuming a maximally entangled state, together with exhausting some shared random bits. In this paper, we discover that some states are impossible to be perfectly prepared by Alice and Bob initially sharing those entangled states that are superposed by the ground states, as the states to be prepared. In particular, we present a sufficient and necessary condition for the states being enabled to be exactl…
Dense coding is arguably the protocol that launched the field of quantum communication. Today, however, more than a decade after its initial experimental realization, the channel capacity remains fundamentally limited as conceived for photons using linear elements. Bob can only send to Alice three of four potential messages owing to the impossibility of carrying out the deterministic discrimination of all four Bell states with linear optics, reducing the attainable channel capacity from 2 to log_2 3 \approx 1.585 bits. However, entanglement in an extra degree of freedom enables the complete an…
Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement
本文将超密编码推广为双向协议，联合管理纠缠对与数据传输，在理想条件下数据速率和资源效率均提升50%，并通过NetSquid仿真验证了其在非极短退相干时间下的性能优势。
The selection of random subspaces plays a role in quantum information theory analogous to the role of random strings in classical information theory. Recent applications have included protocols achieving the quantum channel capacity and methods for extending superdense coding from bits to qubits. In addition, random subspaces have proved useful for studying the structure of bipartite and multipartite entanglement.
Enhancing Quantum Dense Coding Robustness Using Information Entropy-Based Metrics
针对量子密集编码受噪声和退相干影响的问题，提出集成五量子比特完美码与全局自适应纯化的协议，通过监测量子失协QD和形成纠缠EoF提升鲁棒性和吞吐量，为高容量量子互联网提供路径。
Superdense coding proved that entanglement-assisted quantum communications can improve the data transmission rates compared to classical systems. It allows sending 2 classical bits between the parties in exchange of 1 quantum bit and a pre-shared entangled Bell pair. This paper introduces a new protocol which is intended for distributed communication. Using a pre-shared entangled Bell pair and 1 classical bit 2,5 classical bits can be transmitted in average. This means not only valuable increase in capacity but the two-way distributed operation opens new fields of investigation.
In quantum superdense coding, two parties previously sharing entanglement can communicate a two bit message by sending a single qubit. We study this feature in the broader framework of general probabilistic theories. We consider a particular class of theories in which the local state space of the communicating parties corresponds to Euclidean hyperballs of dimension n (the case n = 3 corresponds to the Bloch ball of quantum theory). We show that a single n-ball can encode at most one bit of information, independently of n. We introduce a bipartite extension of such theories for which there exi…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。