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

International Conference on Computer Engineering and Applications

Hiding information in orthogonal product quantum states

Dexi Zhang, Xiaoyu Li

Published Jan 1, 2007• 1 citation
OpenAlex

Abstract

Abstract: This paper provide a quantum information hiding protocol using orthogonal product states. It is based on the non-locality of an complete orthogonal set of product states in a two-particle quantum system in which each particle has three states. Information is coded in a integral state of the two-particle system. Then the two particles are distributed to two persons who can only perform local operations and classical communications. So the origin information is hidden and it’s impossible for two persons to recover it. We show that our protocol is secure and give a detailed procedure to hide data in computers. Key–Words: Typing manuscripts, LATEX Quantum information science is field which inte-grates quantum physics with information science. It may provide surprising force for people to do things which are impossible in classical information science so far, such as decomposing a large number in polyno-mial time(Shor’s algorithm)[1] and so on. One of the most important applications of quantum information science is quantum cryptography. Quantum cryptog-

Related papers

Quantum information hiding scheme using non-maximally entangled states

Xiaoyu Li

Quantum cryptography is an active field of modern computer science.Quantum information hiding is an important problem in quantum cryptography.The scheme based on the non-locality of non-maximally entangled states in a two-particle quantum system.Involves coding information in a integral state of the two-particle system in which the two particles are distributed to two persons who are only allowed to perform local operations and classical communications so that the origin information is hidden and it's impossible for two persons to recover it.This paper provides a quantum data hiding scheme using non-maximally entangled states.It's easier to carry out in relative to schemes using maximally entangled states.It is shown that the protocol is more secure and tends to offer a detailed procedure to hide data in computers and the protocol may be useful to keeping secret in network.

Journal of Heilongjiang Institute of Science and Technology•Jan 1, 2006•0 citations

Multiparty data hiding of quantum information

Patrick M. Hayden, Debbie Leung, Graeme Smith

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 attacks via local operation and classical communication. 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 negligible. The data-hiding states have very unusual entanglement properties, which we briefly discuss.

arXiv:quant-ph/0407152•Physical Review A•Jun 30, 2005•53 citations

Multi-party quantum secret sharing protocol based on orthogonal product states

Yun Chen, LI Xuanbing, Shuai Li

Quantum secret sharing (QSS) is a cryptographic protocol that utilizes fundamental principles of quantum mechanics to securely distribute and reconstruct secret information among multiple participants. Most existing protocols rely on entangled states (such as Bell and GHZ states), but in practical applications. The preparation of entangled state is constrained by a short quantum coherence time, low state fidelity, etc., which makes it difficult to implement entangled resource-dependent QSS protocols. In this work, a novel practical and verifiable multi-party QSS protocol is proposed based on orthogonal product states, which are easier to prepare than entangled states. During the protocol preparation stage, the secret distributor first converts pre-shared classical secret information into the corresponding orthogonal product states according to the encoding rules, and pre-shares a communication key with participants via quantum key distribution (QKD), which is used to hide the initial quantum sequence information through subsequent particle transformation operations. After preparing the orthogonal product states, the distributor reorganizes the particles by position, extracting particles at the same position from each state to form new sequences, shuffling their order, then applying Hadamard operations using a pre-shared key, inserting decoy particles, and sending the sequences to the participants. After receiving it, participants conduct eavesdropping detection, use the same key for the inverse transformations, retain one particle from each sequence, and sequentially pass the remaining particles until the last participant receives a complete set, triggering state verification with the arbiter distributor. If the verification is successful, the particles will be returned to the first participant and the return stage will follow the same procedure. Only after both the transmission and return stage verifications have passed, will the distributor reveal the initial particle positions, allowing participants to collaboratively reconstruct the secret. In the protocol, the secret distributor acts as an arbitrator to verify the particle state information together with participants at designated points (the end of the transmission stage and the end of the return stage) in order to determine whether the particle-state information is error-free during transmission. If the verification fails at either stage, the protocol will be terminated immediately. Meanwhile, considering that the number of participants may change during the execution of the protocol, a dynamic scheme for personnel changes is designed to ensure the flexibility of the protocol. Through the analysis of possible internal and external attacks, It can be proven that our protocol can effectively resist the existing common attack. Using Qiskit simulation experiments, the core quantum procedures of the protocol can be successfully modeled. The experimental results provide strong computational validation of the theoretical feasibility of the protocol.

Acta Physica Sinica•Jan 1, 2025•0 citations

Quantum Key Distribution Protocol Using Orthogonal Product Quantum States

Dexi Zhang

Quantum key distribution is the most secure technology to distribute a secret key. There is a set of orthogonal product states in a two-qubit three-state quantum system which can show nonlocality. This paper provides a quantum key distribution protocol based otn the nonlocality of such system. The two parties establish the key by exchanging quantum qubits and performing the collective measurement on them. The laws of quantum mechanics guarantee that this protocol is unconditionally secure. No other people can get the key without being found. There are no entangled states and quantum operations needed in the protocol. So it is easier to carry out in practice. And it can gain high reliability and robustness.

•Jan 1, 2008•2 citations

An efficient quantum key distribution protocol with orthogonal product states

Yu‐Guang Yang, Wen Qiao-yan

An efficient quantum key distribution (QKD) protocol with orthogonal product states in the 3 ⊗ 3 Hilbert space is presented. The sender, Alice, disorders the orthogonal product state sequence and sends it to Bob. After Alice has published the matching information of the particle sequence, Bob recovers the correct correspondences and makes an orthogonal measurement on the orthogonal product states to obtain the information sent by Alice. Finally, security analysis is also made.

Chinese Physics•Aug 1, 2007•2 citations

Quantum Data Hiding

David Peter Divincenzo, Debbie Leung, Barbara M. Terhal

Abstract — We expand on our work on Quantum Data Hiding [1] – hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.

•Mar 16, 2001•240 citations
Abstract: This paper provide a quantum information hiding protocol using orthogonal product states. It is based on the non-locality of an complete orthogonal set of product states in a two-particle quantum system in which each particle has three states. Information is coded in a integral state of the two-particle system. Then the two particles are distributed to two persons who can only perform local operations and classical communications. So the origin information is hidden and it’s impossible for two persons to recover it. We show that our protocol is secure and give a detailed procedure to hide data in computers. Key–Words: Typing manuscripts, LATEX Quantum information science is field which inte-grates quantum physics with information science. It may provide surprising force for people to do things which are impossible in classical information science so far, such as decomposing a large number in polyno-mial time(Shor’s algorithm)[1] and so on. One of the most important applications of quantum information science is quantum cryptography. Quantum cryptog-
Quantum cryptography is an active field of modern computer science.Quantum information hiding is an important problem in quantum cryptography.The scheme based on the non-locality of non-maximally entangled states in a two-particle quantum system.Involves coding information in a integral state of the two-particle system in which the two particles are distributed to two persons who are only allowed to perform local operations and classical communications so that the origin information is hidden and it's impossible for two persons to recover it.This paper provides a quantum data hiding scheme using non-maximally entangled states.It's easier to carry out in relative to schemes using maximally entangled states.It is shown that the protocol is more secure and tends to offer a detailed procedure to hide data in computers and the protocol may be useful to keeping secret in network.
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 attacks via local operation and classical communication. 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 negligible. The data-hiding states have very unusual entanglement properties, which we briefly discuss.
Quantum secret sharing (QSS) is a cryptographic protocol that utilizes fundamental principles of quantum mechanics to securely distribute and reconstruct secret information among multiple participants. Most existing protocols rely on entangled states (such as Bell and GHZ states), but in practical applications. The preparation of entangled state is constrained by a short quantum coherence time, low state fidelity, etc., which makes it difficult to implement entangled resource-dependent QSS protocols. In this work, a novel practical and verifiable multi-party QSS protocol is proposed based on orthogonal product states, which are easier to prepare than entangled states. During the protocol preparation stage, the secret distributor first converts pre-shared classical secret information into the corresponding orthogonal product states according to the encoding rules, and pre-shares a communication key with participants via quantum key distribution (QKD), which is used to hide the initial quantum sequence information through subsequent particle transformation operations. After preparing the orthogonal product states, the distributor reorganizes the particles by position, extracting particles at the same position from each state to form new sequences, shuffling their order, then applying Hadamard operations using a pre-shared key, inserting decoy particles, and sending the sequences to the participants. After receiving it, participants conduct eavesdropping detection, use the same key for the inverse transformations, retain one particle from each sequence, and sequentially pass the remaining particles until the last participant receives a complete set, triggering state verification with the arbiter distributor. If the verification is successful, the particles will be returned to the first participant and the return stage will follow the same procedure. Only after both the transmission and return stage verifications have passed, will the distributor reveal the initial particle positions, allowing participants to collaboratively reconstruct the secret. In the protocol, the secret distributor acts as an arbitrator to verify the particle state information together with participants at designated points (the end of the transmission stage and the end of the return stage) in order to determine whether the particle-state information is error-free during transmission. If the verification fails at either stage, the protocol will be terminated immediately. Meanwhile, considering that the number of participants may change during the execution of the protocol, a dynamic scheme for personnel changes is designed to ensure the flexibility of the protocol. Through the analysis of possible internal and external attacks, It can be proven that our protocol can effectively resist the existing common attack. Using Qiskit simulation experiments, the core quantum procedures of the protocol can be successfully modeled. The experimental results provide strong computational validation of the theoretical feasibility of the protocol.
Quantum key distribution is the most secure technology to distribute a secret key. There is a set of orthogonal product states in a two-qubit three-state quantum system which can show nonlocality. This paper provides a quantum key distribution protocol based otn the nonlocality of such system. The two parties establish the key by exchanging quantum qubits and performing the collective measurement on them. The laws of quantum mechanics guarantee that this protocol is unconditionally secure. No other people can get the key without being found. There are no entangled states and quantum operations needed in the protocol. So it is easier to carry out in practice. And it can gain high reliability and robustness.
Abstract — We expand on our work on Quantum Data Hiding [1] – hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.