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

arXiv:quant-ph/0507162

Quantum Anti-Piracy Storage of Classical Data

Guang-Ping He

Published Jul 18, 2005• 0 citations
arXivHTMLPDF

Abstract

A scheme is proposed which stores classical data in 4-state quantum registers. It can achieve the following goal: the classical data can always be read unambiguously, while the quantum registers cannot be copied. Therefore the data provider can always distinguish the original quantum registers from piracy copies. Examples of application are also given.

DOI
10.48550/arxiv.quant-ph/0507162

Related papers

Novel quantum information solution to copy-protection and secured authentication

László Gyöngyösi, Sándor Imre

The security of the proposed quantum information data protection system lies in the fundamental difference between classical and quantum information. In the proposed quantum copy-protection system, classical data are stored in the secret rotation angles of non-orthogonal quantum states. The decryption of the stored information is not possible in the classical representation and the decryption mechanism of data qubits is realised by secret unitary rotations. The data protection system uses a quantum-based data storage system and quantum media authentication method to distinguish between original and forged data media. This paper discusses the working mechanism of quantum copy protection and analyses the success probabilities of the quantum probabilistic authentication steps.

International Journal of Internet Technology and Secured Transactions•Jan 1, 2011•3 citations

Unduplicable quantum data medium based secret decryption and verification

László Gyöngyösi, Sándor Imre

In classical computer science any data that can be read can be copied an unlimited number of times. In the quantum world, the quantum states cannot be copied perfectly, according to the no-cloning theorem. The major difference between quantum and classical copy protection is the physical resource for data storage. The proposed quantum based data protection system lies in the fundamental difference between classical and quantum information. The classical data is stored in the secret rotation angles of non-orthogonal quantum states. In our paper we show that secret quantum decoding operations can be implemented with some associated error, which decreases exponentially with the number of quantum states of the angle state.

International Conference for Internet Technology and Secured Transactions•Nov 1, 2009•0 citations

A Quantum Copy-Protection Scheme with Authentication

László Gyöngyösi, Sándor Imre

We propose a quantum copy-protection system which protects classical information in the form of non-orthogonal quantum states. The decryption of the stored information is not possible in the classical representation and the decryption mechanism of data qubits is realized by secret unitary rotations. We define an authentication method for the proposed copy-protection scheme and analyse the success probabilities of the authentication process. A possible experimental realization of the scheme is also presented.

arXiv:1207.4462•Jul 18, 2012•0 citations

New Approaches for Quantum Copy-Protection.

Scott Aaronson, Jiahui Liu, Qipeng Liu +2 more

Quantum copy-protection uses the unclonability of quantum states to construct quantum software that provably cannot be pirated. copy-protection would be immensely useful, but unfortunately, little is known about achieving it in general. In this work, we make progress on this goal, by giving the following results: We show how to copy-protect any program that cannot be learned from its input-output behavior relative to a classical oracle. This construction improves on Aaronson (CCC 2009), which achieves the same relative to a quantum oracle. By instantiating the oracle with post-quantum candidate obfuscation schemes, we obtain a heuristic construction of copy-protection. We show, roughly, that any program which can be watermarked can be copy detected, a weaker version of copy-protection that does not prevent copying, but guarantees that any copying can be detected. Our scheme relies on the security of the assumed watermarking, plus the assumed existence of public-key quantum money. Our construction is publicly detectable and applicable to many recent watermarking schemes.

•Jan 1, 2020•1 citation

New Approaches for Quantum Copy-Protection

Scott Aaronson, Jiahui Liu, Qipeng Liu +2 more

Quantum copy protection uses the unclonability of quantum states to construct quantum software that provably cannot be pirated. Copy protection would be immensely useful, but unfortunately little is known about how to achieve it in general. In this work, we make progress on this goal, by giving the following results: - We show how to copy protect any program that cannot be learned from its input/output behavior, relative to a classical oracle. This improves on Aaronson [CCC'09], which achieves the same relative to a quantum oracle. By instantiating the oracle with post-quantum candidate obfuscation schemes, we obtain a heuristic construction of copy protection. -We show, roughly, that any program which can be watermarked can be copy detected, a weaker version of copy protection that does not prevent copying, but guarantees that any copying can be detected. Our scheme relies on the security of the assumed watermarking, plus the assumed existence of public key quantum money. Our construction is general, applicable to many recent watermarking schemes.

arXiv:2004.09674•Apr 20, 2020•10 citations

Information Storage and Retrieval Through Quantum Phase

Jaewook Ahn, T. C. Weinacht, P. H. Bucksbaum

Information was stored as quantum phase in an N-state Rydberg atom data register. One or more flipped states stored in an eight-state atomic wave packet could be retrieved in a single operation, in agreement with a recent proposal by Grover.

Science•Jan 21, 2000•287 citations
A scheme is proposed which stores classical data in 4-state quantum registers. It can achieve the following goal: the classical data can always be read unambiguously, while the quantum registers cannot be copied. Therefore the data provider can always distinguish the original quantum registers from piracy copies. Examples of application are also given.
The security of the proposed quantum information data protection system lies in the fundamental difference between classical and quantum information. In the proposed quantum copy-protection system, classical data are stored in the secret rotation angles of non-orthogonal quantum states. The decryption of the stored information is not possible in the classical representation and the decryption mechanism of data qubits is realised by secret unitary rotations. The data protection system uses a quantum-based data storage system and quantum media authentication method to distinguish between original and forged data media. This paper discusses the working mechanism of quantum copy protection and analyses the success probabilities of the quantum probabilistic authentication steps.
In classical computer science any data that can be read can be copied an unlimited number of times. In the quantum world, the quantum states cannot be copied perfectly, according to the no-cloning theorem. The major difference between quantum and classical copy protection is the physical resource for data storage. The proposed quantum based data protection system lies in the fundamental difference between classical and quantum information. The classical data is stored in the secret rotation angles of non-orthogonal quantum states. In our paper we show that secret quantum decoding operations can be implemented with some associated error, which decreases exponentially with the number of quantum states of the angle state.
We propose a quantum copy-protection system which protects classical information in the form of non-orthogonal quantum states. The decryption of the stored information is not possible in the classical representation and the decryption mechanism of data qubits is realized by secret unitary rotations. We define an authentication method for the proposed copy-protection scheme and analyse the success probabilities of the authentication process. A possible experimental realization of the scheme is also presented.
Quantum copy-protection uses the unclonability of quantum states to construct quantum software that provably cannot be pirated. copy-protection would be immensely useful, but unfortunately, little is known about achieving it in general. In this work, we make progress on this goal, by giving the following results: We show how to copy-protect any program that cannot be learned from its input-output behavior relative to a classical oracle. This construction improves on Aaronson (CCC 2009), which achieves the same relative to a quantum oracle. By instantiating the oracle with post-quantum candidate obfuscation schemes, we obtain a heuristic construction of copy-protection. We show, roughly, that any program which can be watermarked can be copy detected, a weaker version of copy-protection that does not prevent copying, but guarantees that any copying can be detected. Our scheme relies on the security of the assumed watermarking, plus the assumed existence of public-key quantum money. Our construction is publicly detectable and applicable to many recent watermarking schemes.
Quantum copy protection uses the unclonability of quantum states to construct quantum software that provably cannot be pirated. Copy protection would be immensely useful, but unfortunately little is known about how to achieve it in general. In this work, we make progress on this goal, by giving the following results: - We show how to copy protect any program that cannot be learned from its input/output behavior, relative to a classical oracle. This improves on Aaronson [CCC'09], which achieves the same relative to a quantum oracle. By instantiating the oracle with post-quantum candidate obfuscation schemes, we obtain a heuristic construction of copy protection. -We show, roughly, that any program which can be watermarked can be copy detected, a weaker version of copy protection that does not prevent copying, but guarantees that any copying can be detected. Our scheme relies on the security of the assumed watermarking, plus the assumed existence of public key quantum money. Our construction is general, applicable to many recent watermarking schemes.