• Corpus ID: 236882777

Masking of Quantum Information into Restricted Set of states

  title={Masking of Quantum Information into Restricted Set of states},
  author={Tamal Ghosh and Soumya Sarkar and Bikash K. Behera and Prasanta K. Panigrahi},
Tamal Ghosh, ∗ Soumya Sarkar, † Bikash K. Behera, 4, ‡ and Prasanta K. Panigrahi § Physics Department, West Bengal State University, Barasat 700126, West Bengal, India Department of Physics, National Institute of Technology Karnataka, Surathkal 575025, Karnataka, India Bikash’s Quantum (OPC) Pvt. Ltd., Balindi, Mohanpur 741246, West Bengal, India Department of Physical Sciences, Indian Institute of Science Education and Research Kolkata, Mohanpur 741246, West Bengal, India 

Experimental Masking of Real Quantum States

Rui-Qi Zhang,1, 2, ∗ Zhibo Hou,1, 2, ∗ Zihao Li,3, 4, 5, ∗ Huangjun Zhu,3, 4, 5, † Guo-Yong Xiang,1, 2, ‡ Chuan-Feng Li,1, 2 and Guang-Can Guo1, 2 Key Laboratory of Quantum Information,University of

The condition of masking quantum qutric states

In this paper, we obtain a general condition of quantum information masking by studying the quantum states in C3 . This condition suggests that quantum information can be masked, if and only if the

The Quantum Information Masking Condition for Pure and Mixed States

Quantum information encoded in an arbitrary quantum state can be hidden from the reduced subsystem and spread over quantum correlation, which is quantum information masking. In this paper, we discuss

The masking condition for the quantum state in two-dimensional Hilbert space

This paper focuses on quantum information masking for the quantum state in two-dimensional Hilbert space. We present a system of equations as the condition of quantum information masking. It is shown



Masking quantum information in multipartite scenario

Recently, Kavan Modi \emph{et al.} found that masking quantum information is impossible in bipartite scenario in [Phys. Rev. Lett. \textbf{120}, 230501 (2018)]. This adds another item of the no-go

Masking Quantum Information is Impossible.

This work shows that quantum qubit commitment-a stronger version of the quantum bit commitment-is not possible in general, and suggests that classical information encoded in composite quantum states may have potential applications in secret sharing and future quantum communication protocols.

Experimental test of the quantum no-hiding theorem.

An experimental test of the no-hiding theorem with the technique of nuclear magnetic resonance is reported and it is shown that the missing information can be fully recovered up to local unitary transformations in the ancilla qubits.

Demonstration of the no-hiding theorem on the 5-Qubit IBM quantum computer in a category-theoretic framework

The quantum no-hiding theorem is demonstrated using the IBM 5Q quantum processor and the recovery of missing information is confirmed by the application of local unitary operations on the ancillary qubits.

Quantum Locker Using a Novel Verification Algorithm and Its Experimental Realization in IBM Quantum Computer

A verification algorithm based on weak measurement is demonstrated which can achieve the same purpose even if the qubit is not in an equal superposition state, and is applied to propose a Quantum Locker, a protocol in which any legitimate party can verify his/her authenticity by using a newly developed quantum One-Time Password and retrieve the necessary message from the locker.

Automated error correction in IBM quantum computer and explicit generalization

An automated error correction code is experimentally realized and the nondestructive discrimination of GHZ states in IBM 5-qubit quantum computer is demonstrated and generalize the investigated code for maximally entangled n-qudit case.

Demonstration of entanglement purification and swapping protocol to design quantum repeater in IBM quantum computer

This work uses IBM’s real quantum processor ‘ibmqx4’ to create two pair of entangled qubits and design an equivalent quantum circuit which consequently swaps the entanglement between the two pairs, and develops a novel purification protocol which enhances the degree of entanglements in a noisy channel.

Homomorphic encryption experiments on IBM’s cloud quantum computing platform

In their experiments, this demonstration successfully implemented a quantum algorithm for linear equations while protecting the authors' privacy and opens a feasible path to the next stage of development of cloud quantum information technology.

Demonstration of essentiality of entanglement in a Deutsch-like quantum algorithm

This study presents a new quantum algorithm that showsEntanglement could provide advantages over both classical algorithms and quantum algo- rithms without entanglement and suggests that entangler is essential in obtaining quantum speedup for certain problems in quantum computing.

No-Go Theorems and the Foundations of Quantum Physics

The aim of this paper is to reinforce Laudisa's methodological point by critically discussing Malament’s theorem in the context of the philosophical foundation of quantum field theory, and to rehabilitate Gisin's theorem showing that Laudica’S concerns do not apply to it.