Abstract
This paper proposes a scalable three-level hierarchical quantum information splitting (HQIS) protocol with double quantum unknown states. Generally, the traditional HQIS is to distribute the secret to two levels of receivers for purpose of achieving the secret recovery with the help of some receivers to recover the secret. Our proposed protocol uses the product states of two four-particle cluster states and two three-particle GHZ state as quantum channels to transmit the information of double-quantum unknown states, which can face more complex application scenarios and realize the extension of the agent level. By using multi-qubit GHZ state, the proposed protocol can be modified and extended to achieve the change of the number of agents, and it can make the scheme scalable. Finally, we analyzed the efficiency and safety of the scheme and gave a comparison of its similar schemes.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
1 Introduction
The security of classical channel communication depends on complex mathematical calculations, but the difficulty of these calculations decreases as technology improves, so messages become easier to avoid eavesdropping on. Unlike classical channel communication, the security of quantum communication does not depend on complex mathematical calculations, but on the basic knowledge and properties of quantum mechanics. At present, the research directions of quantum communication include quantum teleportation [1,2,3,4,5,6], quantum secure communication [7,9,10,11], quantum dense coding [12–14] and quantum secret sharing (QIS) [15,17,18,19,20,21,22,23,24] and so on.
Quantum entanglement is a very magical phenomenon. With its help, quantum information splitting (QIS) protocol has been developed very well since it was proposed by Hillary et al. [15] in 1999. In the QIS protocol, the sender divides the secret into two or more parts and sends it to different agents for storage. No agent can recover the secret alone, and it must cooperate with other agents to recover the secret. Zheng [16] in their scheme uses the w state as a quantum channel to split a quantum information into two or more, and is robust against decoherence. Zhang [17] proposed two schemes for QIS using tripartite entanglement and demonstrated their security under certain eavesdropping. Yang [18] proposed a (t, n) threshold multi-party QIS protocol, the protocol idea is derived from standard teleportation. The above QIS protocols focus on sharing secrets equally, but this is often not the case in practice. For example, the key of a confidential document is distributed to different people, whose identity levels are often different. For trustworthy people, it needs less help to restore the secret, while for untrustworthy people, it needs more help. Gottesman [20] pointed out that a more extensive QIS protocol is needed, and the power of recovering secrets among different agents is unbalanced, but he did not give a specific implementation method. In 2010, Wang et al. [21] first proposed a layered quantum information splitting (HQIS) scheme to deal with the situation of classification according to the agent's own need for secret recovery. In HQIS, the sender can decide which agents have high and low authority based on the position and credit score of the recipient (agent). This hierarchy of rights is realized through the distribution method of entangled channel particles. Before the communication begins, each agent is informed of his level of authority. If an agent decides to restore the target state after the secret delivery, the other agents will assist him accordingly. According to the quantum non-cloning theorem [25], only the specified receiver can restore the target state, because the recovery operation depends on the measurements of other agents, and these messages are only delivered to the specified receiver. After that, wang proposed a variety of HQIS protocols, including the implementation of HQIS using cluster state [22]. Using six-photon cluster states, he divided agents into two levels, with more than one high-level and more than one low-level. Xu et al. [23] proposed a deterministic HQIS scheme that realizes arbitrary double qubit states through cluster states, and extended the scheme to multiple parties by means of the symmetry of cluster states. In 2022, Tang et al. [24] proposed a general HQIS protocol. Although this protocol extended the unknown state qubit to multiple, it still studied the two-level agent HQIS protocol. According to previous studies, agents are almost divided into two levels, high agent and low agent. Faced with the actual situation, the two levels of agents often have limitations, and the number of different levels is often limited.
In this paper, we use the product states of two 4-particle cluster states and two 3-particle GHZ state as quantum channels to realize hierarchical quantum information splitting of two-particle unknown states. In this scheme, one secret sender and several secret receivers are designed. The authority level of the secret receiver is divided into three levels, and different authority levels of the receivers have different ability to recover the secret. First, the sender makes two Bell measurements of the double quantum unknown state and the assigned two particles, and sends the measurements to the receiver over the classical channel. Due to the different authority levels of different agents, the operations are also different, part of the CNOT gate operation, part of the single bit measurement or Hadamard gate operation. After the Secret Restorer measures its own particles, with the help of some or all agents, the Restorer makes corresponding unitary transformations to the particles in its possession to recover the original quantum information. Not only that, considering the actual situation, the agent of high-level corresponds to the super administrator, often only one, the agent of mid-level and the number of low-level agents is often more. Finally, we extend the protocol partially, which can realize the theoretically infinite expansion of the number of low-level agents.
The rest of this article is organized as follows: Sect. 2 introduces some quantum knowledge used in this article. Section 3 gives our HQIS protocol. Section 4 is our extension of Sect. 3 HQIS protocol. Section 5 is about the analysis of the protocol in this paper. Finally, we conclude in Sect. 6.
2 Quantum techniques
In a two-dimensional Hilbert space, there are three possible states for a quantum state:\(\left| {0} \right\rangle\), \(\left| {1} \right\rangle\), and the superposition of these two states \(\alpha \left| {0} \right\rangle { + }\beta \left| {1} \right\rangle\). But what state this quantum state is in can only be known by measurement. There exists such a set of orthogonal bases \(\left| { + } \right\rangle { = }{\raise0.7ex\hbox{${1}$} \!\mathord{\left/ {\vphantom {{1} {\sqrt {2} }}}\right.\kern-0pt} \!\lower0.7ex\hbox{${\sqrt {2} }$}}\left( {\left| {0} \right\rangle { + }\left| {1} \right\rangle } \right)\) and \(\left| - \right\rangle { = }{\raise0.7ex\hbox{${1}$} \!\mathord{\left/ {\vphantom {{1} {\sqrt {2} }}}\right.\kern-0pt} \!\lower0.7ex\hbox{${\sqrt {2} }$}}\left( {\left| {0} \right\rangle - \left| {1} \right\rangle } \right)\). In the case of a single photon measurement there is a probability of \(\left| {{\raise0.7ex\hbox{${1}$} \!\mathord{\left/ {\vphantom {{1} {\sqrt {2} }}}\right.\kern-0pt} \!\lower0.7ex\hbox{${\sqrt {2} }$}}} \right|^{{2}}\) getting \(\left| {0} \right\rangle\), there is a probability of \(\left| {{\raise0.7ex\hbox{${1}$} \!\mathord{\left/ {\vphantom {{1} {\sqrt {2} }}}\right.\kern-0pt} \!\lower0.7ex\hbox{${\sqrt {2} }$}}} \right|^{{2}}\) getting \(\left| {1} \right\rangle\).
A quantum system consists of two parts: subsystem A and subsystem B. The state of subsystem A is represented by the quantum state \(\left| {\psi_{A} } \right\rangle\), and the state of subsystem B is represented by the quantum state \(\left| {\psi_{B} } \right\rangle\). At this time, the state of the whole system is represented by \(\left| {\psi_{A} } \right\rangle \otimes \left| {\psi_{B} } \right\rangle\).
The GHZ state is a common three-particle entangled state, and the specific form is \(\left| {GHZ} \right\rangle_{123} = {\raise0.7ex\hbox{$1$} \!\mathord{\left/ {\vphantom {1 {\sqrt 2 }}}\right.\kern-0pt} \!\lower0.7ex\hbox{${\sqrt 2 }$}}\left( {\left| {000} \right\rangle + \left| {111} \right\rangle } \right)_{123}\). At present, the GHZ state has been successfully extended to the case of particle number n, that is, the entangled state of n particles is \(\left| {GHZ} \right\rangle_{12...n} = {\raise0.7ex\hbox{$1$} \!\mathord{\left/ {\vphantom {1 {\sqrt 2 }}}\right.\kern-0pt} \!\lower0.7ex\hbox{${\sqrt 2 }$}}\left( {\left| {00...0} \right\rangle + \left| {11...1} \right\rangle } \right)_{12...n}\).
Quantum logic gate plays a very important role in quantum secure communication. It can be classified according to the number of quantum bits processed. The following are the single-qubit logic gate and two-qubit logic gate we use.
2.1 Quantum logic gate
-
1.
Gate I, gate I acting on the qubit will not cause any change in the qubit.
-
2.
Gate X, gate X will reverse the qubit, \(\left| 0 \right\rangle \to \left| 1 \right\rangle\) and \(\left| 1 \right\rangle \to \left| 0 \right\rangle\).
-
3.
Gate Z, gate Z scoped qubit causes the qubit to undergo a phase reversal, where 0 remains unchanged and \(\left| 1 \right\rangle \to - \left| 1 \right\rangle\).
-
4.
Gate Y, iY is usually applied to the corresponding qubit, resulting in phase reversals and bit reversals, \(\left| 0 \right\rangle \to - \left| 1 \right\rangle\) and \(\left| 1 \right\rangle \to \left| 0 \right\rangle\)
-
5.
Hadamard Gate, H gate for short. The H gate converts \(\left| 0 \right\rangle\) to \(\left| + \right\rangle\), \(\left| 1 \right\rangle\) to \(\left| - \right\rangle\), and vice versa, \(\left| + \right\rangle\) to \(\left| 0 \right\rangle\) and \(\left| - \right\rangle\) to \(\left| 1 \right\rangle\).
-
6.
Quantum controlled not gate, or CNOT gate. The CNOT gate operates on two qubits, one as a control qubit that does not change, and the other as a target particle that changes according to the state of the control particle. If the control particle is \(\left| 0 \right\rangle\), the target particle does not change; if the control particle is \(\left| 1 \right\rangle\), the target particle performs bit reversal.
3 Three-level of HQIS protocol
Before introducing this Agreement, take a look at Fig. 1, which shows the architecture of this Agreement. After obtaining the double quantum unknown state, the secret sender makes the Bell measurement with some entangled resources, and then distributes the remaining entangled resources to the secret agent. Next, the HQIS protocol is designed by double four-particle bit cluster state and double three-particle GHZ state. Here, we extend the low-level agents so that three low-level agents can be replaced by n low-level agents, as detailed in Sect. 4.
Note that the sender is Alice, and the permission levels are Bob, Charlie, and David in descending order. The numeric subscript of the agent name indicates that there are multiple agents at the layer, and the number is used to distinguish agents at the same layer.
Suppose Alice has a two-qubit state,
Here, \(\left| \alpha \right|^{2} + \left| \beta \right|^{2} + \left| \gamma \right|^{2} + \left| \delta \right|^{2} = 1\) As the sender, Alice sends a secret state \(\left| \varphi \right\rangle_{xy}\) to the six receivers. The quantum channel between them is composed of 4-qubit cluster states and 3-qubit GHZ state.
Here
Among them, particles x, y, 1 and a belong to Alice, particles 2 and b belong to Bob, particles 3 and c, 4 and d belong to Charlie1 and Charlie2 respectively, particles 5 and e belong to David1, particles 6 and f belong to David2, and particles 7 and g belong to David3.
While the whole system is written as
Here \(\left| \Theta \right\rangle\) uses the fewest quantum resources of the three-layer HQIS protocol, namely \(\left| {C_{1} } \right\rangle\),\(\left| {C_{{2}} } \right\rangle\),\(\left| {G_{1} } \right\rangle\) and \(\left| {G_{{2}} } \right\rangle\). In Sect. 4, we will extend this protocol, and the quantum resources used by the extended protocol will be determined according to the number of low-level agents.
Alice performs two Bell measurements on her qubit (x, 1) and (y, a), respectively. The four Bell states are
She sends the measurement to the agent over the classical channel. What we know is that Alice can get one of the 16 outcomes with equal probability, and the other qubits collapse into one of the 16 states \(\left| {\theta^{i} } \right\rangle_{234567bcdefg} \left( {i = 0,1,...,14,15} \right)\). Please refer to Table 1 for specific Alice measurements and collapse results of other agents.
Without losing generality, let us give an example of how this agreement works. Let's say Alice's measurement is \(\left| {\Phi^{ + } \Phi^{ + } } \right\rangle_{x1y5}\), the other six agents’ state will collapse into the state
Case 1 Agent in high-level recovers the secret state.
See Fig. 2 for a diagram of the operational structure associated with recovering secrets by a high-level agent. Alice chooses Bob to recovery the secret state. First, Bob and David1 jointly take particles 5 and e as control particles, and particles 2 and b as target particles to execute CNOT gate, namely (5, 2) and (e, b) respectively. The system collapses into the following form:
To help Bob reconstruct the original secret state, the other receivers take measurements of their own particles with appropriate measuring bases and publish their measurements. If Charlie1 and Charlie2 choose \(\left\{ {\left| 0 \right\rangle ,\left| 1 \right\rangle } \right\}\) to measure their particles, their measurements will always be the same. Similarly, David1, David2 and David3 also choose \(\left\{ {\left| 0 \right\rangle ,\left| 1 \right\rangle } \right\}\) to measure their own particles, and their results are the same. Therefore, it is only necessary to measure any of Charlie1 and Charlie2 and any of David1, David2 and David3 and send the result to Bob. Bob can reconstruct the unknown state through corresponding unitary operation, so as to recover the secret and complete the communication.
Without loss of generality, assuming that the measurement results of Alice, Charlie1 and David1 are \(\left| {\Phi^{ + } \Phi^{ + } } \right\rangle_{x1y5}\), \(\left| {01} \right\rangle_{3c}\) and \(\left| {01} \right\rangle_{5e}\) respectively, then the measurement results obtained by Bob are
To recovery the original secret state \(\left| \varphi \right\rangle_{xy}\), Bob does unitary operation \(U = I \otimes \sigma_{X} \sigma_{Z}\) on his particle to get formula (1). When the measurement result of Alice is \(\left| {\Phi^{ + } \Phi^{ + } } \right\rangle_{x1y5}\), all the measurement results and unitary operations are shown in Table 2.
Case 2 Agent in mid-level recovers the secret state.
See Fig. 3 for a diagram of the operational structure associated with recovering secrets by a mid-level agent. Here again, formula (7) is chosen as an example. Alice chooses Charlie1 to recovery the secret state. First, David1 and Charlie1 jointly take particles 5 and e as control particles, and particles 3 and c as target particles to execute CNOT gate, namely (5, 3) and (e, c) respectively. Then, Bob and Charlie1 jointly take particles 2 and b as control particles, and particles 3 and c as target particles to execute CNOT gate, namely (2, 3) and (b, c) respectively. Finally, Bob's particles 2 and b perform the Hadamard gate transformation. The system collapses into the following form:
According to formula (11), if \(\left\{ {\left| 0 \right\rangle ,\left| 1 \right\rangle } \right\}\) is selected for measurement, the measurement results of David1, David2 and David3 are always the same. Therefore, we choose the measurement results of David1 as the representative to help Charlie1 carry out secret recovery. In addition, we also need to know the measurement results of Bob and Charlie2 to help Charlie1 perform unitary operation to recover the secret.
Without loss of generality, assuming that the measurement results of Alice, Bob, Charlie2 and David1 are \(\left| {\Phi^{ + } \Phi^{ + } } \right\rangle_{x1y5}\),\(\left| {01} \right\rangle_{2b}\),\(\left| {00} \right\rangle_{4d}\) and \(\left| {10} \right\rangle_{5e}\) respectively, then the measurement results obtained by Charlie1 are
To recovery the original secret state \(\left| \varphi \right\rangle_{xy}\), Bob does the unitary operation \(U = \sigma_{X} \otimes \sigma_{Z}\) on his particle to obtain formula (1). When the measurement result of Alice is \(\left| {\Phi^{ + } \Phi^{ + } } \right\rangle_{x1y5}\), all the measurement results and unitary operations are shown in Table 3.
Case 3 Agent in low-level recovers the secret state.
Figure 4 is a diagram of the operational structure associated with recovering a secret by a low-level agent. Here, Formula (7) is still taken as an example. Alice chooses low-level agent David3 to recover the secret. Firstly, Bob, David2 and David3 jointly take particles 2 and b as control particles and particles 6 and f, 7 and g as target particles to execute CNOT gate, namely (2, 6), (2, 7) and (b, f), (b, g) respectively. Finally, Bob's particles 2 and b and David2's particles 6 and f undergo the Hadamard gate transformation. The system collapses into the following forms:
David3's reconstruction of Alice's secret state requires other receivers to make single-particle measurements of their own particles respectively and send the measurement results to David3 through classical channels. As can be seen from formula (12), when \(\left\{ {\left| 0 \right\rangle ,\left| 1 \right\rangle } \right\}\) is selected as the measurement basis, the measurement results of Charlie1 and Charlie2 are always the same, so only one of them is needed to help, and Charlie1 is chosen here. That is to say, David3 needs the help of Bob, Charlie1, David1 and David2 to restore the secret state.
When the measurement result of Alice is \(\left| {\Phi^{ + } \Phi^{ + } } \right\rangle_{x1y5}\), all the measurement results and unitary operations are shown in Table 4.
Higher-level agents need the least help to recover secrets, and lower-level agents need more help. Therefore, the measurement results and corresponding operations required by lower-level agents to recover secrets are more complex.
4 Scalable three-level of HQIS protocol
Generally speaking, agents of the same level often have multiple agent nodes, which requires better universality of the protocol. Here we propose a universal three-level agent scheme. It can be observed from formula (5) that we usually take out the first particle of the entangled state and do Bell measurement with the particle of the unknown state, and the remaining particles are distributed to agents of different levels respectively. Our general protocol can be written as follows:
Here, \(\left| \Omega \right\rangle\) is that we use a four-particle cluster state, in which the first particle is owned by Alice, and the rest particles are divided into high-level and mid-level proxies. \(\left| {\rm Z} \right\rangle\) is a multi-qubit GHZ state, which can realize the expansion of the number of low-grade agents.
In order to verify the universality of our protocol, formula (5) is substituted into formula (13). \(\left| \Omega \right\rangle\) and \(\left| {\rm Z} \right\rangle\) are product states, so only \(\left| {\rm Z} \right\rangle\) changes in the system state. We observe from Case 1 and Case 2 in Sect. 2 that the states of low-level agents are correlated, when the state of one is known, the state of the other agents is known. Therefore, when we want to verify the correctness of the universal protocol, we only need to verify the low-level proxy recovery secret.
Case 3’ Agent in low-level recovers the secret state.
Here we still assume that Alice's Bell measurement result is \(\left| {\Phi^{ + } \Phi^{ + } } \right\rangle_{x1y5}\), and the corresponding collapse result of the system can be written as:
After the expansion of formula (15), the particles of the low-level agents have correlations. Low-level agent recovery secret requires the help of a high-level agent, a mid-level agent, and all other low-level agents. We chose to use the CNOT gate and the corresponding Hadamard gate operation to break the correlation between low-level agents.
Here we take the N-particle GHZ state as an example,
In the double n particle GHZ state, two particles are responsible for recovering the secret, they and a pair of particles as the target particles to perform the CNOT gate, the rest of the low-level particles and a pair of particles are Hadamard gate transformation. We take {\(\left| 0 \right\rangle\),\(\left| 1 \right\rangle\)} as the measuring basis for single-bit measurement, but part of the base vector of the collapsed state after Hadamard gate transformation is {\(\left| + \right\rangle\), \(\left| - \right\rangle\)}, so we need to use \(\left| + \right\rangle = {\raise0.7ex\hbox{$1$} \!\mathord{\left/ {\vphantom {1 {\sqrt 2 }}}\right.\kern-0pt} \!\lower0.7ex\hbox{${\sqrt 2 }$}}\left( {\left| 0 \right\rangle + \left| 1 \right\rangle } \right)\) and \(\left| - \right\rangle = {\raise0.7ex\hbox{$1$} \!\mathord{\left/ {\vphantom {1 {\sqrt 2 }}}\right.\kern-0pt} \!\lower0.7ex\hbox{${\sqrt 2 }$}}\left( {\left| 0 \right\rangle - \left| 1 \right\rangle } \right)\) to convert the Z base to the X base, and then get the corresponding relationship between the measurement results of the agent helping to recover the secret and the operation needed to recover the secret.
5 Analysis
5.1 Outsider attack
The common attack mode in quantum communication is the attack from the external eavesdrop Eve. By preparing the quantum state \(\left| E \right\rangle\), Eve performs unitary operation on the \(\left| E \right\rangle\) particle and the particles sent in the quantum channel to generate entanglement between the particles. After that, Eve obtains information by measuring \(\left| E \right\rangle\) and then recovers the secret messages. Specific operations are as follows:
Among them, \(\beta \left| {e_{2} } \right\rangle = \gamma \left| {e_{3} } \right\rangle = 0\). Eve can infer a single quantum of information, but we're transmitting two qubits. When Eve gets both quanta at the same time, he cannot get the arrangement of the two quanta, so his eavesdropping will fail.
Eve wants to steal the quantum information \(\left| \varphi \right\rangle_{xy}\) of an unknown state. Let's take case1 in Sect. 3 as an example to illustrate. The job of recovering unknown quantum state information is done by Bob, and Eve has no way of knowing who the agent is (Bob, Charlie, or David). Eve should first determine what level the three-tier agent that restores the secret belongs to, assuming that this process is known to the attacker. Second, Alice's different measurements result in Bob's different measurements. In addition, the different measurement results of Charlie1 and David1 will also cause Bob to perform different operations. Suppose these measurements were stolen by the attacker Eve. At the last unitary operation, Eve, the unknown quantum state \(\left| \varphi \right\rangle_{xy}\) is known, but Bob's measurements are not available. Because this process is done by Bob himself, and there is no need to transmit information. All of the above assumptions require Eve to steal in order to obtain the correct information, but this process has been shown in the previous paragraph is not feasible. When the agent to restore the secret is Charlie or David, the protocol is more secure because Eve has more information to steal.
5.2 Insider attack
A dishonest agent wants to recover the secret alone, so he may resort to a forgery pester attack. Forged entanglement attack refers to the agent of secret recovery. By intercepting the particles sent by the sender to other agents, and creating fake entangled particles to send to other agents, the attacker tests the particles needed for secret recovery, and then completes the recovery of double qubit information. In this agreement, Alice does not specify which is the secret restorer and which is the helper when she sends the particle to the agent. After Eve sends the fake particle to the corresponding agent, the agent assisting the secret recovery performs the corresponding Hadamard gate transform or CNOT gate operation, which is associated with the level of the secret recovery agent. When the high-level agent recovers the secret, Bob acts as the target particle of the CNOT operation; When the low-level agent recovers the secret, Bob is the controlling particle of the CNOT operation and performs the Hadamard transform; As a result, the unitary operations required vary. In addition, Eve has acquired two particles from an agent, but he does not know the order in which the two particles are arranged. All of this causes Eve to fail to recover the secrets properly, and other agents to discover that they have lost their connection to each other when performing CNOT gate and Hadamard operations. Table 5 shows the information stolen and the exposure that agents at different levels want to recover secrets individually.
5.3 Efficiency
Previously, Cabello [26] proposed a formula for calculating the communication efficiency of the quantum key distribution protocol. Since there is no unified standard for calculating the efficiency of quantum information splitting communication protocol, Cabello's scheme is adopted here.
\(q_{s}\) represents the number of unknown state qubits to be shared in the protocol, \(q_{t}\) represents the number of qubits transmitted in the protocol, and \(b_{t}\) represents the number of classical bits transmitted in the protocol. Table 6 shows the efficiency of the protocol proposed in this paper.
5.4 Comparison
Since 2010, when Wang [21] et al. first proposed HQIS protocol, many researchers have studied HQIS and used different entangled resources to achieve different quantum information resolution for quantum channels. This paper compares with other quantum information splitting protocols in terms of hierarchical structure, entangled resources, split quantum information, scalability and recovery operations. See Table 7 for details.
As can be seen from Table 7, three-level of two-particle unknown state HQIS schemes are proposed for the first time. We expanded the number of low-level agents, which is to take into account that in real life, the number of high-level agents is often very limited, while the number of low-level agents tends to be very large and commonly used. For example, the key to the bank vault is secret information, the bank president is the senior agent, the vice president is the middle agent, and the manager is the junior agent. Look at Fig. 5.
6 Conclusion
We propose an extensible three-level HQIS protocol with two quantum unknown states. First, we give a HQIS protocol for double quantum unknown states based on the product states of double four-particle cluster states and double three-particle GHZ states. The secret sender shares the double quantum unknown state with six agents. The sender needs to first make Bell measurements with the particles and the unknown state particles in her hand, and then send her measurement results to the receiver through the classical channel. When the sender decides that a high-level agent will recover the secret, the high-level agent needs the help of a mid-level agent and a low-level agent to recover the secret. When a mid-level agent restores the secret, he needs the help of a high-level agent, a mid-level agent, and a low-level agent to restore the secret. When the low-level agent recovers the secret, he needs the help of a high-level agent, a mid-level agent, and all remaining low-level agents. We then extended the protocol. In real scenarios, the number of agents of high-level and mid-level is often small, while the number of agents of low-level is often large. Therefore, we extend the three-particle GHZ state to the multi-particle GHZ state, and make the product state of the multi-particle GHZ state and the four-particle cluster state constitute the quantum channel to realize the extension of the protocol.
We compared our protocol with previous studies, and the tertiary HQIS protocol was not involved by previous researchers. In the future, we will continue to study the HQIS protocol that transmits more information, is more efficient and has more universality.
Data Availability
The authors confirm that the data supporting the findings of this study are available within the article.
References
Bennett, C.H., Brassard, G., Crepeau, C., Jozsa, R., Peres, A., Wootters, W.K.: Teleporting an unknown quantum state via dual classical and Einstein–Podolsky–Rosen channels. Phys. Rev. Lett. 70, 1895–1899 (1993)
Karthik, M., Lalwani, J., Jajodia, B.: Proposed quantum text teleportation protocol (QTTP) for secure text transfer by using quantum teleportation and Huffman coding. Center for Open Science, (2022)
Gao, T., Yan, F.L., Wang, Z.X.: Controlled quantum teleportation and secure direct communication. Chin. Phys. B 14(5), 893–897 (2005)
Hou, K., Bao, D.Q., Zhu, C.J.: Controlled teleportation of an arbitrary two-qubit entanglement in noises environment. Quantum Inf. Process. 18(4), 104 (2019)
He, M.Y., Ma, S.Y., Kang, K.P.: A universal protocol for bidirectional controlled teleportation with network coding. Commun. Theor. Phys. 73(10), 105104 (2021)
Zhao, Z., Chen, Y.A., Zhang, A.N., Yang, T., Briegel, H.J., Pan, J.W.: Experimental demonstration of five-photon entanglement and open-destination teleportation. Nature 430, 54–58 (2004)
Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. Proc of IEEE International Conference on Computers, Institute of Electrical and Electronics Engineers, (1984)
Bennett, C.H., Brassard, G., et al.: Experimental quantum cryptography. J. Cryptol. 5(1), 3–28 (1992)
Ekert, A.K.: Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett. 67(6), 661 (1991)
Bennett, C.H.: Quantum cryptography using any two nonorthogonal states. Phys. Rev. Lett. 68(21), 3121 (1992)
Huttner, B., Imoto, N., Gisin, N., et al.: Quantum cryptography with coherent states. Phys. Rev. A 51(3), 1863–1869 (1995)
Mattle, K., Weinfurter, H., Kwiat, P.G., et al.: Dense coding in experimental quantum communication. Phys. Rev. Lett. 76(25), 4656–4659 (1996)
Jing, Z., Peng, K.: Quantum teleportation and dense coding by means of bright amplitude-squeezed light and direct measurement of a Bell state. Phys. Rev. A (2000). https://doi.org/10.1103/PhysRevA.62.064302
Dong, L.I., Dong, H.K., Xiu, X.M., et al.: QUANTUM SECURE DIRECT COMMUNICATION USING A SIX-QUBIT MAXIMALLY ENTANGLED STATE WITH DENSE CODING. Int. J. Quantum Information 7(03), 645–651 (2009)
Hillery, M., Buzek, V., Berthiaume, A.: Quantum secret sharing. Phys. Rev. A 59(3), 1829–1834 (1999)
Zheng, S.-B.: Splitting quantum information via w states. Phys. Rev. A 74(5), 054303 (2006)
Zhang, Q.-Y., Zhan, Y.-B., Zhang, L.-L., Ma, P.-C.: Schemes for splitting quantum information via tripartite entangled states. Int. J. Theor. Phys. 48(12), 3331–3338 (2009)
Yang, Y.-G., Wen, Q.-Y.: Threshold multiparty quantum-information splitting via quantum channel encryption. Int. J. Quantum Inf. 7(06), 1249–1254 (2009)
Cleve, R., Gottesman, D., Lo, H.K.: How to share a quantum secret. Phys. Rev. Lett. 83, 648–651 (1999)
Gottesman, D.: Theory of quantum secret sharing. Phys. Rev. A 61, 042311 (2000)
Wang, X.W., Xia, L.X., Wang, Z.Y., Zhang, D.Y.: Hierarchical quantum information splitting. Opt. Commun. 283(6), 1196–1199 (2010)
Wang, X.W., Zhang, D.Y., Tang, S.Q., Zhan, X.G., You, K.M.: Hierarchical Quantum Information Splitting with Six-Photon Cluster States. Int. J. Theor. Phys. 49, 2691–2697 (2010)
Xu, G., Wang, C., Yang, Y.X.: Hierarchical quantum information splitting of an arbitrary two-qubit state via the cluster state. Quantum Inf. Process. 13(1), 43–57 (2014)
Tang, J., Ma, S., Li, Q.: Universal Hierarchical Quantum Information Splitting Schemes of an Arbitrary Multi-Qubit State. Int. J. Theor. Phys. 61, 209 (2022)
Hillery, M., Buzek, V.: Quantum copying: fundamental inequalities. Phys. Rev. A 56(2), 1212–1216 (1997)
Cabello, A.: Quantum Key Distribution in the Holevo Limit. Phys. Rev. Lett. 85, 5635 (2000)
Acknowledgements
This work was supported by the Chongqing Municipal Education Commission Science and Technology Research Program Youth Projects (Grant No. KJQN202302401; Grant No. KJQN202202401).
Funding
Chongqing Municipal Education Commission Science and Technology Research Program Youth Projects, KJQN202302401.
Author information
Authors and Affiliations
Contributions
Sun Yan: Writing the main manuscript text Lu Zhang: Verification and Prepared the tables. Chaonan Wang: Prepared the figures and Design the protocol. Hongfeng Zhu: Creativity and Verification. All authors reviewed the manuscript and discussed some main problems.
Corresponding author
Ethics declarations
Conflict of interest
The authors declared that they have no conflicts of interest to this work.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Sun, Y., Wang, C., Zhang, L. et al. A novel scalable three-level hierarchical quantum information splitting scheme for two-qubit unknown states. Quantum Inf Process 23, 295 (2024). https://doi.org/10.1007/s11128-024-04506-7
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11128-024-04506-7