Masking of Quantum Information is Possible (original) (raw)
Related papers
Masking of Quantum Information into Restricted Set of states
2020
Masking of data is a method to protect information by shielding it from a third party, however keeping it usable for further usages like application development, building program extensions to name a few. Whereas it is possible for classical information encoded in composite quantum states to be completely masked from reduced sub-systems, it has to be checked if quantum information can also be masked when the future possibilities of a quantum computer are increasing day by day. Newly proposed no-masking theorem [Phys. Rev. Lett. 120, 230501 (2018)], one of the no-go theorems, demands that except for some restricted sets of non-orthogonal states, it's impossible to mask arbitrary quantum states. Here, we explore the possibility of masking in the IBM quantum experience platform by designing the quantum circuits and running them on the 5-qubit quantum computer. We choose two particular states considering both the orthogonal and non-orthogonal basis states and illustrate their maskin...
Masking of Quantum Information for Restricted Set of States
2019
Masking of data is a method to protect information by shielding it from a third party, however keeping it usable for further usages like application development, building program extensions to name a few. Whereas it is possible for classical information encoded in composite quantum states to be completely masked from reduced sub-systems, it has to be checked if quantum information can also be masked when the future possibilities of a quantum computer are increasing day by day. Newly proposed no-masking theorem [Phys. Rev. Lett. 120, 230501 (2018)], one of the no-go theorems, demands that except for some restricted sets of non-orthogonal states, it’s impossible to mask arbitrary quantum states. Here, we explore the possibility of masking in the IBM quantum experience platform by designing the quantum circuits, and running them on the 5-qubit quantum computer. We choose two particular states considering both the orthogonal and non-orthogonal basis states and illustrate their masking t...
Entanglement is indispensable for masking arbitrary set of quantum states
We question the role of entanglement in masking quantum information contained in a set of mixed quantum states. We first show that a masker that can mask any two single-qubit pure states, can mask the entire set of mixed states comprising of the classical mixtures of those two pure qubit states as well. We then try to find the part played by entanglement in masking two different sets: One, a set of mixed states formed by the classical mixtures of two single-qubit pure commuting states, and another, a set of mixed states obtained by mixing two single-qubit pure non-commuting states. For both cases, we show that the masked states remain entangled unless the input state is an equal mixture of the two pure states. This in turn reveals that entanglement is necessary as well as sufficient for masking an arbitrary set of two single qubit states, regardless of their mixednesses and mutual commutativity.
IEEE Transactions on Information Theory, 2002
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.
2009
Though security is nothing new, the way that security has become a part of our daily lives today is unprecedented. Today, steganography is most often associated with the high-tech variety, where data is hidden within other data in an electronic file. Steganography is hidden writing, whether it consists of invisible ink on paper or copyright information hidden in an audio or video file. This work has as purpose to expand the field of applicability of the steganography from the classical informatics to the quantum one.
Experimental Test of the Quantum No-Hiding Theorem
Physical Review Letters, 2011
The no-hiding theorem says that if any physical process leads to bleaching of quantum information from the original system, then it must reside in the rest of the Universe with no information being hidden in the correlation between these two subsystems. Here, we report an experimental test of the no-hiding theorem with the technique of nuclear magnetic resonance. We use the quantum state randomization of a qubit as one example of the bleaching process and show that the missing information can be fully recovered up to local unitary transformations in the ancilla qubits.
Hide Secrets Using the Power of Quantum Computers
2009
Secret communication is everywhere around us today. Cryptography is being used to encrypt messages so that they can be read only by someone who has the key. Combining the art of steganography with the powers of computers has brought a method of hiding information to a whole new level. Steganography hides messages so that their very existence is undetectable. The idea of embedding some information within a digital media, in such a way that the inserted data are intrinsically part of the media itself, has aroused a considerable interest in different fields. This work has as a purpose to expand the field of applicability of the embedded information within a digital media from the classical informatics to the quantum one.
The quantum no-hiding theorem, first proposed by Braunstein and Pati [Phys. Rev. Lett. 98, 080502 (2007)], was verified experimentally by Samal et al. [Phys. Rev. Lett. 186, 080401 (2011)] using NMR quantum processor. Till then, this fundamental test has not been explored in any other experimental architecture. Here, we demonstrate the above no-hiding theorem using the IBM 5Q quantum processor. Categorical algebra developed by Coecke and Duncan [New J. Phys. 13, 043016 (2011)] has been used for better visualization of the no-hiding theorem by analyzing the quantum circuit using the ZX calculus. The experimental results confirm the recovery of missing information by the application of local unitary operations on the ancillary qubits.
2007
We study the teleportation scheme performed by means of a partially entangled pure state. We found that the information belonging to the quantum channel can be distributed into both the system of the transmitter and the system of the receiver. Thus, in order to complete the teleportation process it is required to perform an "unambiguous non-orthogonal quantum states discrimination" and an "extraction of the quantum information" processes. This general scheme allows one to design a strategy for concealing the unknown information of the teleported state. Besides, we showed that the teleportation and the "concealing the quantum information" process, can be probabilistically performed even though the bipartite quantum channel is maximally entangled.
Hiding Quantum States in a Superposition
Arxiv preprint arXiv:0807.4732, 2008
Establishing a secure channel is of interest. There have been efforts to provide a way to exploit quantum mechanical systems to achieve this goal. For example, quantum key distribution [1, 3, 5] has been there for some time. Methods to hide classical data using quantum states ...