Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

中国科学通报：英文版

An efficient scheme for multi-party quantum state sharing via non-maximally entangled states

Jiang, Min Min, Huang, Xu, Zhou Zhou, LiuLei, YiMing, Zeng, Jia Jia

Published Jan 1, 2012• 0 citations
OpenAlex

Abstract

我们在场为为以一种简单、漂亮的方式分享的多党的量状态调查 non-maximally 纠缠的状态的实用性的一个新计划。在我们的计划，发送者，各种各样的概率的隧道在一个网络与 n 代理人 non-maximally 纠缠的状态填写了的艾莉斯份额 n。我们的协议包含单一的转变由免费可选的代理人操作了的仅仅钟基础大小，单个 qubit 大小，和 two-qubit。因为没有另外的多国参加的联合大小被需要，我们的计划是一条更方便的认识。而且，在我们的计划，各种各样的概率的隧道为量隧道减少要求，它为物理实现使它更实际。

Related papers

An efficient scheme for multi-party quantum state sharing of an arbitrary multi-qubit state with one GHZ channel

Min Jiang, Daoyi Dong

Quantum Information Processing•Jun 18, 2012•10 citations

Efficient Three-Party Quantum Secret Sharing with Single Photons

周萍, 李熙涵, Fu‐Guo Deng +1 more

为三聚会的量秘密分享一把私人钥匙的一个计划与单个光子被介绍。代理人鲍勃首先与二个偏导的基地准备单个光子的一个序列然后送他们给与大小检查传播的安全并且由重排生产一些圈套光子的老板艾莉斯一些样品光子的订单。Aliceencodes 她有光子上的二单一的操作的位然后把他们送到另外的代理人。这个计划的安全在修改 Bennet 臂章等价于那 1984 量钥匙分发协议。而且，每个光子能带一位私人钥匙和内在的效率因为当在钥匙中的位的数字是时， qubits 和全部的效率两个都百分之百接近最大的价值大。

Chinese Physics Letters•Jan 1, 2007•0 citations

An efficient scheme for multi-party quantum state sharing via non-maximally entangled states

Min Jiang, Xu Huang, Liulei Zhou +2 more

We present a new scheme for investigating the usefulness of non-maximally entangled states for multi-party quantum state sharing in a simple and elegant manner. In our scheme, the sender, Alice shares n various probabilistic channels composed of non-maximally entangled states with n agents in a network. Our protocol involves only Bell-basis measurements, single qubit measurements, and a two-qubit unitary transformation operated by free optional agents. Our scheme is a more convenient realization because no other multipartite joint measurements are needed. Furthermore, in our scheme various probabilistic channels lessen the requirement for quantum channels, which makes it more practical for physical implementation.

Chinese Science Bulletin•Mar 20, 2012•14 citations

Efficient multi-party quantum state sharing of an arbitrary two-qubit state

Runhua Shi, Liusheng Huang, Wei Yang +1 more

Optics Communications•Mar 21, 2010•17 citations

Deterministic hierarchical sharing of a partially known quantum operation via a non-maximally entangled state

Siqi Zhou, Nueraminaimu Maihemuti

Abstract Recent studies have demonstrated the critical role of hierarchical quantum operation sharing in enhancing security and efficiency within quantum information systems. This approach enables the structured distribution of quantum operations among multiple parties, facilitating collaborative tasks essential for various practical applications. In this paper, we explore the hierarchical sharing of a partially known single-qubit operation, and propose a four-party hierarchical sharing scheme utilizing a non-maximally entangled six-qubit state as the quantum channel. This scheme can be regarded as two sub-schemes, wherein three agents are divided into two power levels for information access: one at a higher power level and the other at a lower level. Each agent can reconstruct the target state with complete certainty, independent of the coefficients of the non-maximally entangled channel, through the cooperation of some or all other agents. Additionally, we extend this framework to accommodate m + n agents, where n agents operate at the higher power level while the remaining m agents function at the lower power level.

Laser Physics Letters•Feb 5, 2025•7 citations

Quantum Secret Sharing Protocol Using Maximally Entangled Multi-qudit States

Mostafa Mansour, Zakaria Dahbi

International Journal of Theoretical Physics•Nov 5, 2020•35 citations
我们在场为为以一种简单、漂亮的方式分享的多党的量状态调查 non-maximally 纠缠的状态的实用性的一个新计划。在我们的计划，发送者，各种各样的概率的隧道在一个网络与 n 代理人 non-maximally 纠缠的状态填写了的艾莉斯份额 n。我们的协议包含单一的转变由免费可选的代理人操作了的仅仅钟基础大小，单个 qubit 大小，和 two-qubit。因为没有另外的多国参加的联合大小被需要，我们的计划是一条更方便的认识。而且，在我们的计划，各种各样的概率的隧道为量隧道减少要求，它为物理实现使它更实际。
为三聚会的量秘密分享一把私人钥匙的一个计划与单个光子被介绍。代理人鲍勃首先与二个偏导的基地准备单个光子的一个序列然后送他们给与大小检查传播的安全并且由重排生产一些圈套光子的老板艾莉斯一些样品光子的订单。Aliceencodes 她有光子上的二单一的操作的位然后把他们送到另外的代理人。这个计划的安全在修改 Bennet 臂章等价于那 1984 量钥匙分发协议。而且，每个光子能带一位私人钥匙和内在的效率因为当在钥匙中的位的数字是时， qubits 和全部的效率两个都百分之百接近最大的价值大。
We present a new scheme for investigating the usefulness of non-maximally entangled states for multi-party quantum state sharing in a simple and elegant manner. In our scheme, the sender, Alice shares n various probabilistic channels composed of non-maximally entangled states with n agents in a network. Our protocol involves only Bell-basis measurements, single qubit measurements, and a two-qubit unitary transformation operated by free optional agents. Our scheme is a more convenient realization because no other multipartite joint measurements are needed. Furthermore, in our scheme various probabilistic channels lessen the requirement for quantum channels, which makes it more practical for physical implementation.
Abstract Recent studies have demonstrated the critical role of hierarchical quantum operation sharing in enhancing security and efficiency within quantum information systems. This approach enables the structured distribution of quantum operations among multiple parties, facilitating collaborative tasks essential for various practical applications. In this paper, we explore the hierarchical sharing of a partially known single-qubit operation, and propose a four-party hierarchical sharing scheme utilizing a non-maximally entangled six-qubit state as the quantum channel. This scheme can be regarded as two sub-schemes, wherein three agents are divided into two power levels for information access: one at a higher power level and the other at a lower level. Each agent can reconstruct the target state with complete certainty, independent of the coefficients of the non-maximally entangled channel, through the cooperation of some or all other agents. Additionally, we extend this framework to accommodate m + n agents, where n agents operate at the higher power level while the remaining m agents function at the lower power level.