Ryutaroh Matsumoto
We propose a quantum key distribution (QKD) protocol that enables three parties agree at once on a shared common random bit string in presence of an eavesdropper without use of entanglement. We prove its unconditional security and analyze the key rate.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We present a multiparty simultaneous quantum identity authentication protocol based on entanglement swapping. In our protocol, the multi-user can be authenticated by a trusted third party simultaneously.
We investigate the tight monogamy and polygamy relations of multiparty entanglement for arbitrary quantum states. By using the power of the bipartite measure of entanglement, we establish a class of tight monogamy relations of multiparty entanglement with larger lower bounds than the existing monogamy relations. We also give a class of tight polygamy relations of multiparty entanglement with smaller upper bounds than the existing polygamy relations, by using the power of the entanglement of assistance. It is shown that these new monogamy and polygamy relations are tighter than the former resul…
Extending the eavesdropping strategy devised by Zhang, Li and Guo [Phys. Rev. A 63, 036301 (2001)], we show that the multiparty quantum communication protocol based on entanglement swapping, which was proposed by Cabello [quant-ph/0009025], is not secure. We modify the protocol so that entanglement swapping can secure multiparty quantum communication, such as multiparty quantum key distribution and quantum secret sharing of classical information, and show that the modified protocol is secure against the Zhang-Li-Guo's strategy for eavesdropping as well as the basic intercept-resend attack.
A general proof of the security against eavesdropping of a previously introduced protocol for two-party quantum key distribution based on entanglement swapping [Phys. Rev. A {\bf 61}, 052312 (2000)] is provided. In addition, the protocol is extended to permit multiparty quantum key distribution and secret sharing of classical information.
Entanglement freezing has been demonstrated existing in various noisy decoherence mechanisms. Here we explore its universality by investigating freezing behavior in a lossless multiparty system, i.e., an $N$-site optical lattice (or equivalently spin-chain) system. Interesting phenomenon of permanent entanglement freezing is found for the infinite-size case ($N\rightarrow\infty$). As the multiparty system size reduces to finite $N$, the interesting behavior of dynamical entanglement "thawing" start to emerge. Especifically, alternative appearances of "freezing" and "thawing" can be identified …
Recently, Yan and Gao proposed a quantum secret sharing protocol between multiparty ($m$ members in group 1) and multiparty ($n$ members in group 2) using a sequence of single photons (Phys. Rev. A \textbf{72}, 012304 (2005)). We find that it is secure if the quantum signal transmitted is only a single photon but insecure with a multi-photon signal as some agents can get the information about the others' message if they attack the communication with a Trojan horse. However, security against this attack can be attained with a simple modification.
For quantum states of two subsystems, entanglement measures are related to capacities of communication tasks -- highly entangled states give higher capacity of transmitting classical as well as quantum information. However, we show that this is no more the case in general: quantum capacities of multi-access channels, motivated by communication in quantum networks, do not have any relation with genuine multiparty entanglement measures. Along with revealing the structural richness of multi-access channel capacities, this gives us a tool to classify multiparty quantum states from the perspective …
We provide a generalization for the polygamy constraint of multiparty entanglement in arbitrary dimensional quantum systems. By using the $β$th-power of entanglement of assistance for $0\leq β\leq1$ and the Hamming weight of the binary vector related with the distribution of subsystems, we establish a class of weighted polygamy inequalities of multiparty entanglement in arbitrary dimensional quantum systems. We further show that our class of weighted polygamy inequalities can even be improved to be tighter inequalities with some conditions on the assisted entanglement of bipartite subsystems.
Computing entanglement of an arbitrary bipartite or multipartite mixed state is in general not an easy task as it usually involves complex optimization. Here we show that exploiting symmetries of certain mixed states, we can compute a genuine multiparty entanglement measure, the generalized geometric measure for these classes of mixed states. The chosen states have different ranks and consist of an arbitrary number of parties.
A multiparty quantum secret sharing (QSS) protocol is proposed by using swapping quantum entanglement of Bell states. The secret messages are imposed on Bell states by local unitary operations. The secret messages are split into several parts and each part is distributed to a party so that no action of a subset of all the parties but their entire cooperation is able to read out the secret messages. In addition, the dense coding is used in this protocol to achieve a high efficiency. The security of the present multiparty QSS against eavesdropping has been analyzed and confirmed even in a noisy …
We establish a universal complementarity relation between the capacity of classical information transmission by employing a multiparty quantum state as a multiport quantum channel, and the genuine multipartite entanglement of the quantum state. The classical information transfer is from a sender to several receivers by using the quantum dense coding protocol with the multiparty quantum state shared between the sender and the receivers. The relation holds for arbitrary pure or mixed quantum states of an arbitrary number of parties in arbitrary dimensions.
In a recent paper [Z. J. Zhang and Z. X. Man, Phys. Rev. A 72, 022303(2005)], a multiparty quantum secret sharing protocol based on entanglement swapping was presented. However, as we show, this protocol is insecure in the sense that an unauthorized agent group can recover the secret from the dealer. Hence, we propose an improved version of this protocol which can stand against this kind of attack.
Recycled detection of genuine multiparty entanglement of unlimitedly stretched array of parties and arbitrarily long series of sequential observers
研究空间分离观测者共享多体纠缠态的场景，提出改进的纠缠见证算子，证明任意数量观测者可循环检测任意数量粒子的真正多体纠缠，并扩展至广义GHZ态与混合态。
Localizing genuine multiparty entanglement in noisy stabilizer states
本文研究了在受噪声的多粒子稳定子态中定位真正的多方纠缠，通过图论方法计算了无噪声和有噪声情况下的下界，并展示了在特定Pauli测量设置下噪声强度临界值的存在。
Monogamy is a nonclassical property that limits the distribution of quantum correlation among subparts of a multiparty system. We show that monogamy scores for different quantum correlation measures are bounded above by functions of genuine multipartite entanglement for a large majority of pure multiqubit states. The bound is universal for all three-qubit pure states. We derive necessary conditions to characterize the states that violate the bound, which can also be observed by numerical simulation for a small set of states, generated Haar uniformly. The results indicate that genuine multipart…
Franson-like setups are inadequate for multiparty Bell experiments with energy-time entanglement because postselected events can depend on the local settings, and local models can exploit this feature to reproduce the quantum predictions, even in the case of ideal devices. We extend a previously introduced interferometric scheme [A. Cabello, et al., Phys. Rev. Lett. 102, 040401 (2009)] to solve this problem in the n-qubit and n-qunit cases. In addition, the proposed setups allow us to prepare and test n-qubit Greenberger-Horne-Zeilinger and $(\sum_{i=1}^n |i ... i>)/\sqrt{n}$ energy-time entan…
We study various distance-like entanglement measures of multipartite states under certain symmetries. Using group averaging techniques we provide conditions under which the relative entropy of entanglement, the geometric measure of entanglement and the logarithmic robustness are equivalent. We consider important classes of multiparty states, and in particular show that these measures are equivalent for all stabilizer states, symmetric basis and antisymmetric basis states. We rigorously prove a conjecture that the closest product state of permutation symmetric states can always be chosen to be …
We propose a scheme of quantum secret sharing between Alices' group and Bobs' group with single photons and unitary transformations. In the protocol, one member in Alices' group prepares a sequence of single photons in one of four different states, while other members directly encode their information on the sequence of single photons via unitary operations, after that the last member sends the sequence of single photons to Bobs' group. Then Bobs except for the last one do work similarly. Finally last member in Bobs' group measures the qubits. If Alices and Bobs guarnnted the security of quant…
Quantum information theory is a multidisciplinary field whose objective is to understand what happens when information is stored in the state of a quantum system. Quantum mechanics provides us with a new resource, called quantum entanglement, which can be exploited to achieve novel tasks such as teleportation and superdense coding. Current technologies allow the transmission of entangled photon pairs across distances up to roughly 100 kilometers. For longer distances, noise arising from various sources degrade the transmission of entanglement to the point that it becomes impossible to use the …
The Greenberger-Horne-Zeilinger (GHZ) entanglement, originally introduced to uncover the extreme violation of local realism against quantum mechanics, is an important resource for multiparty quantum communication tasks. But the low intensity and fragility of the GHZ entanglement source in current conditions have made the practical applications of these multiparty tasks an experimental challenge. Here we propose a feasible scheme for practically distributing the post-selected GHZ entanglement over a distance of more than 100 km for experimentally accessible parameter regimes. Combining the deco…
A single quantum state can be shared by many distant parties. In this thesis, we try to characterize the information contents of such distributed states by defining the multiparty information and the multiparty squashed entanglement, two steps toward a general theory of multiparty quantum information. As a further step in that direction, we partially solve the multiparty distributed compression problem where multiple parties use quantum communication to faithfully transfer their shares of a state to a common receiver. We build a protocol for multiparty distributed compression based on the full…
Based on the two-step protocol [Phys. Rev. A68(03)042317], we propose a $(n,n)$-threshold multiparty quantum secret sharing protocol of secure direct communication. In our protocol only all the sharers collaborate can the sender's secure direct communication message be extracted. We show a variant version of this protocol based on the variant two-step protocol. This variant version can considerably reduce the realization difficulty in experiment. In contrast to the use of multi-particle GHZ states in the case that the sharer number is larger than 3, the use and identification of Bell states ar…
This paper introduces quantum multiparty protocols which allow the use of temporary assumptions. We prove that secure quantum multiparty computations are possible if and only if classical multi party computations work. But these strict assumptions are necessary only during the execution of the protocol and can be loosened after termination of the protocol. We consider two settings: 1. A collusion of players tries to learn the secret inputs of honest players or tries to modify the result of the computation. 2. A collusion of players cheats in the above way or tries to disrupt the protocol, i.e.…
We propose a multiparty quantum cryptographic protocol. Unitary operators applied by Bob and Charlie, on their respective qubits of a tripartite entangled state encodes a classical symbol that can be decoded at Alice's end with the help of a decoding matrix. Eve's presence can be detected by the disturbance of the decoding matrix. Our protocol is secure against intercept-resend attacks. Furthermore, it is efficient and deterministic in the sense that two classical bits can be transferred per entangled pair of qubits. It is worth mentioning that in this protocol same symbol can be used for key …
We propose a 2N qubit entangled channel that can be used to teleport N qubits in a network to a single receiver. We describe the construction of this channel and explicitly demonstrate how the protocol works. The protocol is different from teleportation using $N$ Bell pairs shared between $N$ senders and a single receiver, as it ensures that all parties have to participate in order for the teleportation to be successful. This can be advantageous in various scenarios and we discuss potential application of this protocol to voting.
The distribution of entanglement of typical multiparty quantum states is not uniform over the range of the measure utilized for quantifying the entanglement. We intend to find the response to disorder in the state parameters on this non-uniformity for typical states. We find that the typical entanglement, averaged over the disorder, is taken farther away from uniformity, as quantified by decreased standard deviation, in comparison to the clean case. The feature is seemingly generic, as we see it for Gaussian and non-Gaussian disorder distributions, for varying strengths of the disorder, and fo…
Noise robustness of a multiparty quantum summation protocol
本文研究了多方量子求和协议在退极化和退相位噪声下的鲁棒性，分析了噪声对概率分布的影响，并利用Shamir秘密共享消除了对可信第三方的需求。
Quantum digital signatures (QDSs) promise information-theoretic security against repudiation and forgery of messages. Compared with currently existing three-party QDS protocols, multiparty protocols have unique advantages in the practical case of more than two receivers when sending a mass message. However, complex security analysis, numerous quantum channels and low data utilization efficiency make it intractable to expand three-party to multiparty scenario. Here, based on six-state non-orthogonal encoding protocol, we propose an effective multiparty QDS framework to overcome these difficulti…
An protocol of quantum secret sharing between multiparty and multiparty with four states is presented. We show that this protocol can make the Trojan horse attack with a multi-photon signal, the fake-signal attack with EPR pairs, the attack with single photons, and the attack with invisible photons to be nullification. In addition, we also give the upper bounds of the average success probabilities for dishonest agent eavesdropping encryption using the fake-signal attack with any two-particle entangled states.
A protocol for multiparty quantum secret splitting (MQSS) with an ordered $N$ Einstein-Podolsky-Rosen (EPR) pairs and Bell state measurements is recently proposed by Deng {\rm et al.} [Phys. Lett. A 354(2006)190]. We analyzed the security of the protocol and found that this protocol is secure for any other eavesdropper except for the agent Bob who adopts intercept-and-resend attack. Bob can obtain all the information of Alice's alone without being found. We also propose an improved version of the MQSS protocol.
This paper proposes a multiparty quantum remote control (MQRC) protocol, which allows several controllers to perform remote operations independently on a target state based on a shared entanglement of Greenberger-Home-Zeilinger (GHZ) state.
Quantum information science breaks limitations of conventional information transfer, cryptography and computation by using quantum superpositions or entanglement as resources for information processing. Here, we report on the experimental realization of three-party quantum communication protocols using single three-level quantum system (qutrit) communication: secret sharing, detectable Byzantine agreement, and communication complexity reduction for a three-valued function. We have implemented these three schemes using the same optical fiber interferometric setup. Our realization is easily scal…
Tighter monogamy and polygamy relations in multiparty quantum systems
本文研究了多方量子系统中更严格的单配偶与多配偶关系，通过新数学不等式推导出改进的不等式，并扩展到一般多方系统。
The wedge product of vectors has been shown to yield the generalised entanglement measure I-concurrence, wherein the separability of the multiparty qubit system arises from the parallelism of vectors in the underlying Hilbert space of the subsystems. Here, we demonstrate the geometrical conditions of the post-measurement vectors which maximize the entanglement corresponding to the bi-partitions and can yield non-identical set of maximally entangled states. The Bell states for the two qubit case, GHZ and GHZ like states with superposition of four constituents for three qubits, naturally arise a…
Non-Markovian noise limits for sustaining entanglement in multiparty quantum states
本文研究非马尔可夫环境噪声对多体纠缠的影响，证明退相位信道中 GHZ cat 态与 W 态的纠缠可饱和至非零值，并揭示 W 态的奇偶效应及退极化信道中的纠缠复苏。
Entanglement of Assistance as a measure of multiparty entanglement
针对多方纠缠量化的挑战，提出辅助体积（VoA）度量，通过计算所有潜在参与方辅助纠缠的几何平均值，可区分MPC无法区分的态且为GGM的上界，在量子信息处理中具有实际效用。
We describe various results related to the random distillation of multiparty entangled states - that is, conversion of such states into entangled states shared between fewer parties, where those parties are not predetermined. In previous work [Phys. Rev. Lett. 98, 260501 (2007)] we showed that certain output states (namely Einstein-Podolsky-Rosen (EPR) pairs) could be reliably acquired from a prescribed initial multipartite state (namely the W state) via random distillation that could not be reliably created between predetermined parties. Here we provide a more rigorous definition of what cons…
Fermionic Genuine Multiparty Entanglement
研究费米子系统中真正多方纠缠，引入可有效计算的费米子真正多方负性测量，发现有该性质但无非费米子GME的态，揭示其与二分费米子负性的现象学差异。
A scheme for secure multiparty quantum summation was proposed by Run-hau Shi et al.,(SCIENTIFIC REPORTS, 6:19655, DOI:10.1038/srep19655). IBM Corporation has released a superconductivity based 5-qubit quantum computer named "Quantum Experience" and placed it on "cloud". In this paper we take advantage of the online availability of this real quantum processor(ibmqx2) and carry out the above protocol that has never been experimentally demonstrated earlier. Here, we set up experiments for secure quantum summation of one-qubit secret states . Besides, we propose a protocol for square and cubic sum…
Generalization of quantum information splitting protocol from qubits to qudits (quantum d-dimensional systems) is presented.
Efficient Mediated Multiparty Semi-Quantum Secret Sharing Protocol Based on Single-Qubit Reordering
本文提出首个基于单量子比特重排序的中介多方半量子秘密共享协议，使经典用户Alice与多个经典Bob在不可信第三方协助下共享秘密，仅需两种经典能力，提高了量子比特效率并抵御已知攻击。
Secret sharing and multiparty computation (also called "secure function evaluation") are fundamental primitives in modern cryptography, allowing a group of mutually distrustful players to perform correct, distributed computations under the sole assumption that some number of them will follow the protocol honestly. This paper investigates how much trust is necessary -- that is, how many players must remain honest -- in order for distributed quantum computations to be possible. We present a verifiable quantum secret sharing (VQSS) protocol, and a general secure multiparty quantum computation (MP…
Random access code (RAC), a primitive for many information processing protocols, enables one party to encode n-bit string into one bit of message such that another party can retrieve partial information of that string. We introduce the multiparty version of RAC in which the n-bit string is distributed among many parties. For this task, we consider two distinct quantum communication scenarios: one allows shared quantum entanglement among the parties with classical communication, and the other allows communication through a quantum channel. We present several multiparty quantum RAC protocols tha…
Multiparty quantum communication is an important branch of quantum networks. It enables private information transmission with information-theoretic security among legitimate parties. We propose a sender-controlled measurement-device-independent multiparty quantum communication protocol. The sender Alice divides a private message into several parts and delivers them to different receivers for secret sharing with imperfect measurement devices and untrusted ancillary nodes. Furthermore, Alice acts as an active controller and checks the security of quantum channels and the reliability of each rece…
There are two important paradigms for defining quantum correlations in quantum information theory, viz. the information-theoretic and the entanglement-separability ones. We find an analytical relation between two measures of quantum correlations, one in each paradigm, and show that only a certain cone-like region on the two-dimensional space spanned by these measures is accessible to pure three-qubit states. The information-theoretic multiparty quantum correlation measure is related to the monogamy considerations of a bipartite information-theoretic quantum correlation measure, while the entan…
Multiparty Quantum Sealed-Bid Auction Using Single Photons as Message Carrier
提出一种以单光子承载投标信息的多方量子密封投标拍卖协议，并通过诱骗光子与改进的EPR对事后确认机制保障安全与公平。
Simultaneous Multiparty Quantum Teleportation Supervised by a Controller
本研究设计含Hadamard门和受控非门的17量子比特簇态制备线路，以此为量子信道实现控制器监督下四发送方对四接收方的同时多方量子隐形传态，协议固有效率达21.65%，在资源等维度优于现有相关协议。
We present a way for symmetric multiparty-controlled teleportation of an arbitrary two-particle entangled state based on Bell-basis measurements by using two Greenberger-Horne-Zeilinger states, i.e., a sender transmits an arbitrary two-particle entangled state to a distant receiver, an arbitrary one of the $n+1$ agents via the control of the others in a network. It will be shown that the outcomes in the cases that $n$ is odd or it is even are different in principle as the receiver has to perform a controlled-not operation on his particles for reconstructing the original arbitrary entangled sta…
We present multiparty entanglement purification protocols that are capable of purifying arbitrary graph states directly. We develop recurrence and breeding protocols and compare our methods with strategies based on bipartite entanglement purification in static and communication scenarios. We find that direct multiparty purification is of advantage with respect to achievable yields and minimal required fidelity in static scenarios, and with respect to obtainable fidelity in the case of noisy operations in both scenarios.
We study a protocol in which many parties use quantum communication to transfer a shared state to a receiver without communicating with each other. This protocol is a multiparty version of the fully quantum Slepian-Wolf protocol for two senders and arises through the repeated application of the two-sender protocol. We describe bounds on the achievable rate region for the distributed compression problem. The inner bound arises by expressing the achievable rate region for our protocol in terms of its vertices and extreme rays and, equivalently, in terms of facet inequalities. We also prove an ou…
We analyzed the security of the multiparty quantum secret sharing (MQSS) protocol recently proposed by Zhang, Li and Man [Phys. Rev. A \textbf{71}, 044301 (2005)] and found that this protocol is secure for any other eavesdropper except for the agent Bob who prepares the quantum signals as he can attack the quantum communication with a Trojan horse. That is, Bob replaces the single-photon signal with a multi-photon one and the other agent Charlie cannot find this cheating as she does not measure the photons before they runs back from the boss Alice, which reveals that this MQSS protocol is not …
We investigate tight monogamy relations of multiparty quantum entanglement for any quantum state in this paper. First, we obtain a class of lower bounds for multiparty quantum systems which improve the previous results. Next, we establish a class of tighter monogamy relations in tripartite quantum systems by means of the new inequality. Furthermore, we generalize this relations to multiparty quantum systems. And then we prove the lower bounds we obtained are larger than the existing ones. Detailed examples are provided at last.
Based on a quantum secure direct communication (QSDC) protocol [Phys. Rev. A69(04)052319], we propose a $(n,n)$-threshold scheme of multiparty quantum secret sharing of classical messages (QSSCM) using only single photons. We take advantage of this multiparty QSSCM scheme to establish a scheme of multiparty secret sharing of quantum information (SSQI), in which only all quantum information receivers collaborate can the original qubit be reconstructed. A general idea is also proposed for constructing multiparty SSQI schemes from any QSSCM scheme.
Efficient Simulation of Quantum Secure Multiparty Computation
针对现有量子安全多方求和协议采用$(n,n)$门限存在的安全与效率问题，提出基于$(t,n)$门限、结合经典与量子特性的QSMS协议，仅需t个诚实参与方即可完成计算，更经济实用且安全。
Quantum communication networks are connected by various devices to achieve communication or distributed computing for users in remote locations. In order to solve the problem of generating temporary session key for secure communication in optical-ring quantum networks, a quantum key agreement protocol is proposed. In the key agreement protocols, an attacker can impersonate a legal user to participate in the negotiation process and eavesdrop the agreement key easily. This is often overlooked in most quantum key agreement protocols, which makes them insecure in practical implementation. Consider…
Multipartite quantum correlations are important resources for the development of quantum information and computation protocols. However, the resourcefulness of multipartite quantum correlations in practical settings is limited by its fragility under decoherence due to environmental interactions. Though there exist protocols to protect bipartite entanglement under decoherence, the implementation of such protocols for multipartite quantum correlations has not been sufficiently explored. Here, we study the effect of local amplitude damping channel on the generalized Greenberger-Horne-Zeilinger st…
A Secure Multiparty Quantum Least Common Multiple Computation Protocol
本文提出一种基于Shor量子周期查找算法的安全多方最小公倍数计算协议，利用周期函数连接原理，并辅以一票否决投票验证，在半诚实模型下实现高概率安全且多项式复杂度的计算。
A protocol for multiparty quantum secret splitting is proposed with an ordered $N$ EPR pairs and Bell state measurements. It is secure and has the high intrinsic efficiency and source capacity as almost all the instances are useful and each EPR pair carries two bits of message securely. Moreover, we modify it for multiparty quantum state sharing of an arbitrary $m$-particle entangled state based on quantum teleportation with only Bell state measurements and local unitary operations which make this protocol more convenient in a practical application than others.
Single-state multiparty semiquantum secret sharing with d-dimensional Bell states
本文提出一种基于d维贝尔态的单态多方半量子秘密共享方案，仅用一种初始量子资源且无需纠缠交换和酉操作，即可实现多方协作恢复密钥，并能抵抗外部和参与者攻击。
We present protocols for multiparty data hiding of quantum information that implement all possible threshold access structures. Closely related to secret sharing, data hiding has a more demanding security requirement: that the data remain secure against unrestricted LOCC attacks. In the limit of hiding a large amount of data, our protocols achieve an asymptotic rate of one hidden qubit per local physical qubit. That is, each party holds a share that is the same size as the hidden state to leading order, with accuracy and security parameters incurring an overhead that is asymptotically negligib…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。