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

Tiny Trans. Comput. Sci.

Towards Provable Remote Data Deletion Through Quantum Entanglement.

Jon Crowcroft, Gerard Briscoe

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

A continuing challenge in computing is how to retain control of shared information, given the ease of loss-less copying that is possible. This challenge is becoming increasingly acute as the ease of distributing information continues to grow exponentially. Quantum Computing, which makes use of quantum mechanical phenomena, may offer a solution through the property of quantum entanglement. This property occurs when particles interact physically and then become separated, resulting in each of the pair having the same quantum mechanical description (state). So, we could utilise quantum bits (qubits), which are a unit of quantum information and analogous to classical bits, with the property of quantum entanglement to control the distribution of information. Therefore, if two qubits are connected via quantum entanglement [3], the value of one could be controlled by the other so that shared secrets can be destroyed (deleted) remotely. The approach becomes feasible as the number of qubits constructed continues to grow, with a qubyte (composed of eight quantum bits) being constructed in 2005. However, scaling to multiple remote copies would require multiple source copies, because the quantum-no-deleting principle implies that the ability to delete can drop exponentially with the number of copies to be deleted [1]. Also, given that quantum entanglement is yet to exceed 144 km [2], the approach would not yet scale globally. BODY If we connect two qubits via quantum entanglement, the fate of one can be controlled by the other so shared secrets can be deleted remotely.

Related papers

Quantum deletion: Beyond the no-deletion principle

Satyabrata Adhikari

Suppose we are given two identical copies of an unknown quantum state and we wish to delete one copy from among the given two copies. The quantum no-deletion principle restricts us from perfectly deleting a copy but it does not prohibit us from deleting a copy approximately. Here we construct two types of a ``universal quantum deletion machine'' which approximately deletes a copy such that the fidelity of deletion does not depend on the input state. The two types of universal quantum deletion machines are (1) a conventional deletion machine described by one unitary operator and (2) a modified deletion machine described by two unitary operators. Here it is shown that the modified deletion machine deletes a qubit with fidelity $3∕4$, which is the maximum limit for deleting an unknown quantum state. In addition to this we also show that the modified deletion machine retains the qubit in the first mode with average fidelity 0.77 (approx.) which is slightly greater than the fidelity of measurement for two given identical states, showing how precisely one can determine its state [S. Massar and S. Popescu, Phys. Rev. Lett. 74, 1259 (1995)]. We also show that the deletion machine itself is input state independent, i.e., the information is not hidden in the deleting machine, and hence we can delete the information completely from the deletion machine.

arXiv:quant-ph/0510182•Physical Review A•Nov 18, 2005•14 citations

Quantum Cloning and Deletion in Quantum Information Theory

Satyabrata Adhikari

Quantum mechanics put restriction on performing some task which we can do classically. One such restriction is that we cannot copy an arbitrary quantum state. This is known as No-cloning theorem. Although quantum mechanics forbid us to construct a perfect cloner, there is no restriction to construct an imperfect cloner. Therefore, we have constructed and studied a special kind of quantum cloning machine named as Hybrid quantum cloning machine which is nothing but a different combination of pre-existing quantum cloning machines. We showed that this hybrid quantum cloning machine sometime gives better quality copy than the pre-existing quantum cloners. Quantum entanglement is a very astonishing property in a multi-partite system and it is a very useful ingredient of quantum information theory. Therefore broadcasting (cloning) of entanglement is a very important subject to study. In this regard we have studied the broadcasting of entanglement using state dependent quantum cloning machine. Further, we have investigated the problem of secretly broadcasting of three-qubit entangled state between two distant partners. Linearity of quantum mechanics put another restriction on deletion of an arbitrary quantum state i.e. an arbitrary quantum state against a copy cannot be perfectly deleted. Like cloning machine one can construct an approximate deletion machine also. Therefore, we have constructed an universal deletion machine in the sense that the fidelity of deletion does not depend on the input state and showed that the fidelity of deletion is 3/4 . Further we showed that the fidelity of deletion depends on the blank state at the output and it can be improved from the value 3/4 for certain blank state. Moreover, we have studied the case where two cloned copies are given at the input of the deletion machine.

arXiv:0902.1622•Feb 10, 2009•3 citations

Quantum Entanglement Information Encryption Algorithm

Jincheng Zhang

Quantum entanglement, a bizarre phenomenon where two or more particles become linked in such a way that they share the same fate, is increasingly recognized as a potential cornerstone for secure communication. This paper explores the design of a novel cryptographic algorithm based on quantum entanglement, aiming to achieve absolute security against potential attacks from quantum computers. The core principle revolves around establishing a quantum entangled state, representing a shared secret, and utilizing its properties within a novel encryption protocol employing quantum measurements for key decryption. This approach offers a promising solution to the challenges posed by quantum computing, providing a foundation for robust data security. We delve into the algorithm's design, the underlying quantum mechanics, and the potential for high tolerance to measurement errors.

•Sep 2, 2026•0 citations

Quantum no-deleting principle and some of its implications

Arun Kumar Pati, Samuel L. Braunstein

Unmeasureability of a quantum state has important consequences in practical implementation of quantum computers. Like copying, deleting of an unknown state from among several copies is prohibited. This is called no-deletion prinicple. Here, we present a no deleting principle for qudits. We obtain a bound on $N$-to-$M$ deleting and show that the quality of deletion drops exponentially with the number of copies to be deleted. In addition, we investigate conditional, state-dependent and approximate quantum deleting of unknown states. We prove that unitarity does not allow us to delete copies from an alphabet of two non-orthogonal states exactly. Further, we show that no-deleting principle is consistent with no-signalling.

arXiv:quant-ph/0007121•Jul 31, 2000•28 citations

Quantum Remote Entanglement for Medium-Free Secure Communication?

Wesley Joon-Wie Tann

Present-day quantum communication predominantly depends on trusted relays (e.g., quantum repeaters, low-Earth-orbit satellite) connected by optical fiber cables to transmit information. However, recent evidence supports a decades-old concept that quantum entanglement, harnessed by current quantum communication systems, does not necessarily rely on a physical relay medium. In modern quantum communication networks, this trusted relay infrastructure is (1) susceptible to security attacks, (2) limited by the channel capacity, (3) subject to decoherence loss, and (4) expensive to set up. The instantaneous and faster-than-light activities of quantum entanglement occurring in quantum communication have suggested guidance by some non-locality nature. On the contrary, neither ground nor space-relays have shown or been demonstrated to embody it. It is proposed in this paper that the non-locality nature of quantum theory governs quantum entanglement; elementary particles, components of a universal quantum body, can achieve remote entanglement regardless of a physical medium or spatial proximity. Evidence and theory supporting remote entanglement in superconducting quantum systems (entanglement fidelities for communication in particular) are presented. One such particle, the photon, representing a basic unit of quantum information, qubit $|ψ\rangle = α|0\rangle + β|1\rangle$, consists of real continuous values in complex numbers $(α, β)$ with infinite precision. These values $(α, β)$ can account for the distinctiveness of qubits and result in an identity $QuID$ that possibly supports remote entanglement. New approaches to medium-free secure quantum communication are suggested by running simulations and actual quantum computations on a quantum circuit.

arXiv:2202.00830•Feb 2, 2022•2 citations

Scaling quantum information processing using distributed remote entanglement

Peter Maunz, Taehyun Kim, Caleb W. Knoernschild +3 more

Entanglement of remote quantum memories provides an alternative way to scale quantum information processing. We present progress toward improved remote entanglement generation, useful for distributed quantum computing.

IEEE/LEOS Summer Topical Meetings•Jul 1, 2011•0 citations
A continuing challenge in computing is how to retain control of shared information, given the ease of loss-less copying that is possible. This challenge is becoming increasingly acute as the ease of distributing information continues to grow exponentially. Quantum Computing, which makes use of quantum mechanical phenomena, may offer a solution through the property of quantum entanglement. This property occurs when particles interact physically and then become separated, resulting in each of the pair having the same quantum mechanical description (state). So, we could utilise quantum bits (qubits), which are a unit of quantum information and analogous to classical bits, with the property of quantum entanglement to control the distribution of information. Therefore, if two qubits are connected via quantum entanglement [3], the value of one could be controlled by the other so that shared secrets can be destroyed (deleted) remotely. The approach becomes feasible as the number of qubits constructed continues to grow, with a qubyte (composed of eight quantum bits) being constructed in 2005. However, scaling to multiple remote copies would require multiple source copies, because the quantum-no-deleting principle implies that the ability to delete can drop exponentially with the number of copies to be deleted [1]. Also, given that quantum entanglement is yet to exceed 144 km [2], the approach would not yet scale globally. BODY If we connect two qubits via quantum entanglement, the fate of one can be controlled by the other so shared secrets can be deleted remotely.
Suppose we are given two identical copies of an unknown quantum state and we wish to delete one copy from among the given two copies. The quantum no-deletion principle restricts us from perfectly deleting a copy but it does not prohibit us from deleting a copy approximately. Here we construct two types of a ``universal quantum deletion machine'' which approximately deletes a copy such that the fidelity of deletion does not depend on the input state. The two types of universal quantum deletion machines are (1) a conventional deletion machine described by one unitary operator and (2) a modified deletion machine described by two unitary operators. Here it is shown that the modified deletion machine deletes a qubit with fidelity 3∕43∕43∕4, which is the maximum limit for deleting an unknown quantum state. In addition to this we also show that the modified deletion machine retains the qubit in the first mode with average fidelity 0.77 (approx.) which is slightly greater than the fidelity of measurement for two given identical states, showing how precisely one can determine its state [S. Massar and S. Popescu, Phys. Rev. Lett. 74, 1259 (1995)]. We also show that the deletion machine itself is input state independent, i.e., the information is not hidden in the deleting machine, and hence we can delete the information completely from the deletion machine.
Quantum mechanics put restriction on performing some task which we can do classically. One such restriction is that we cannot copy an arbitrary quantum state. This is known as No-cloning theorem. Although quantum mechanics forbid us to construct a perfect cloner, there is no restriction to construct an imperfect cloner. Therefore, we have constructed and studied a special kind of quantum cloning machine named as Hybrid quantum cloning machine which is nothing but a different combination of pre-existing quantum cloning machines. We showed that this hybrid quantum cloning machine sometime gives better quality copy than the pre-existing quantum cloners. Quantum entanglement is a very astonishing property in a multi-partite system and it is a very useful ingredient of quantum information theory. Therefore broadcasting (cloning) of entanglement is a very important subject to study. In this regard we have studied the broadcasting of entanglement using state dependent quantum cloning machine. Further, we have investigated the problem of secretly broadcasting of three-qubit entangled state between two distant partners. Linearity of quantum mechanics put another restriction on deletion of an arbitrary quantum state i.e. an arbitrary quantum state against a copy cannot be perfectly deleted. Like cloning machine one can construct an approximate deletion machine also. Therefore, we have constructed an universal deletion machine in the sense that the fidelity of deletion does not depend on the input state and showed that the fidelity of deletion is 3/4 . Further we showed that the fidelity of deletion depends on the blank state at the output and it can be improved from the value 3/4 for certain blank state. Moreover, we have studied the case where two cloned copies are given at the input of the deletion machine.
Quantum entanglement, a bizarre phenomenon where two or more particles become linked in such a way that they share the same fate, is increasingly recognized as a potential cornerstone for secure communication. This paper explores the design of a novel cryptographic algorithm based on quantum entanglement, aiming to achieve absolute security against potential attacks from quantum computers. The core principle revolves around establishing a quantum entangled state, representing a shared secret, and utilizing its properties within a novel encryption protocol employing quantum measurements for key decryption. This approach offers a promising solution to the challenges posed by quantum computing, providing a foundation for robust data security. We delve into the algorithm's design, the underlying quantum mechanics, and the potential for high tolerance to measurement errors.
Unmeasureability of a quantum state has important consequences in practical implementation of quantum computers. Like copying, deleting of an unknown state from among several copies is prohibited. This is called no-deletion prinicple. Here, we present a no deleting principle for qudits. We obtain a bound on NNN-to-MMM deleting and show that the quality of deletion drops exponentially with the number of copies to be deleted. In addition, we investigate conditional, state-dependent and approximate quantum deleting of unknown states. We prove that unitarity does not allow us to delete copies from an alphabet of two non-orthogonal states exactly. Further, we show that no-deleting principle is consistent with no-signalling.
Present-day quantum communication predominantly depends on trusted relays (e.g., quantum repeaters, low-Earth-orbit satellite) connected by optical fiber cables to transmit information. However, recent evidence supports a decades-old concept that quantum entanglement, harnessed by current quantum communication systems, does not necessarily rely on a physical relay medium. In modern quantum communication networks, this trusted relay infrastructure is (1) susceptible to security attacks, (2) limited by the channel capacity, (3) subject to decoherence loss, and (4) expensive to set up. The instantaneous and faster-than-light activities of quantum entanglement occurring in quantum communication have suggested guidance by some non-locality nature. On the contrary, neither ground nor space-relays have shown or been demonstrated to embody it. It is proposed in this paper that the non-locality nature of quantum theory governs quantum entanglement; elementary particles, components of a universal quantum body, can achieve remote entanglement regardless of a physical medium or spatial proximity. Evidence and theory supporting remote entanglement in superconducting quantum systems (entanglement fidelities for communication in particular) are presented. One such particle, the photon, representing a basic unit of quantum information, qubit ∣ψ⟩=α∣0⟩+β∣1⟩|ψ\rangle = α|0\rangle + β|1\rangle∣ψ⟩=α∣0⟩+β∣1⟩, consists of real continuous values in complex numbers (α,β)(α, β)(α,β) with infinite precision. These values (α,β)(α, β)(α,β) can account for the distinctiveness of qubits and result in an identity QuIDQuIDQuID that possibly supports remote entanglement. New approaches to medium-free secure quantum communication are suggested by running simulations and actual quantum computations on a quantum circuit.