Masking quantum information encoded in pure and mixed states

• URL: http://arxiv.org/abs/2004.14572v1
• Date: Thu, 30 Apr 2020 03:50:41 GMT
• Title: Masking quantum information encoded in pure and mixed states
• Authors: Huaixin Cao, Yuxing Du, Zhihua Guo, Kanyuan Han and Chuan Yang
• Abstract summary: Masking of quantum information means that information is hidden from a subsystem and spread over a composite system. We discuss the problem of masking quantum information encoded in pure and mixed states, respectively.
• Score: 0.7349727826230862
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Masking of quantum information means that information is hidden from a subsystem and spread over a composite system. Modi et al. proved in [Phys. Rev. Lett. 120, 230501 (2018)] that this is true for some restricted sets of nonorthogonal quantum states and it is not possible for arbitrary quantum states. In this paper, we discuss the problem of masking quantum information encoded in pure and mixed states, respectively. Based on an established necessary and sufficient condition for a set of pure states to be masked by an operator, we find that there exists a set of four states that can not be masked, which implies that to mask unknown pure states is impossible. We construct a masker $S^\sharp$ and obtain its maximal maskable set, leading to an affirmative answer to a conjecture proposed in Modi's paper mentioned above. We also prove that an orthogonal (resp. linearly independent) subset of pure states can be masked by an isometry (resp. injection). Generalizing the case of pure states, we introduce the maskability of a set of mixed states and prove that a commuting subset of mixed states can be masked by an isometry $S^{\diamond}$ while it is impossible to mask all of mixed states by any operator. We also find the maximal maskable sets of mixed states of the isometries ${S^{\sharp}}$ and ${S^{\diamond}}$, respectively.

Related papers

• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Polynomial-depth quantum algorithm for computing matrix determinant [46.13392585104221]
  We propose an algorithm for calculating the determinant of a square matrix, and construct a quantum circuit realizing it. Each row of the matrix is encoded as a pure state of some quantum system. The admitted matrix is therefore arbitrary up to the normalization of quantum states of those systems.
  arXiv  Detail & Related papers  (2024-01-29T23:23:27Z)
• Pseudorandom and Pseudoentangled States from Subset States [49.74460522523316]
  A subset state with respect to $S$, a subset of the computational basis, is [ frac1sqrt|S|sum_iin S |irangle. We show that for any fixed subset size $|S|=s$ such that $s = 2n/omega(mathrmpoly(n))$ and $s=omega(mathrmpoly(n))$, a random subset state is information-theoretically indistinguishable from a Haar random state even provided
  arXiv  Detail & Related papers  (2023-12-23T15:52:46Z)
• Constructions of $k$-uniform states in heterogeneous systems [65.63939256159891]
  We present two general methods to construct $k$-uniform states in the heterogeneous systems for general $k$. We can produce many new $k$-uniform states such that the local dimension of each subsystem can be a prime power.
  arXiv  Detail & Related papers  (2023-05-22T06:58:16Z)
• Entanglement is indispensable for masking arbitrary set of quantum states [0.0]
  We show that entanglement is necessary for masking an arbitrary set of two single qubit states, regardless of their mixednesses and mutual commutativity. This in turn reveals that entanglement is necessary for masking an arbitrary set of two single qubit states, regardless of their mixednesses and mutual commutativity.
  arXiv  Detail & Related papers  (2023-05-04T17:13:09Z)
• Experimental demonstration of optimal unambiguous two-out-of-four quantum state elimination [52.77024349608834]
  A core principle of quantum theory is that non-orthogonal quantum states cannot be perfectly distinguished with single-shot measurements. Here we implement a quantum state elimination measurement which unambiguously rules out two of four pure, non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2022-06-30T18:00:01Z)
• Quantum Information Masking of Hadamard Sets [0.0]
  We study quantum information masking of arbitrary dimensional states. We define the so called Hadamard set of quantum states whose Gram-Schmidt matrix can be diagonalized by Hadamard unitary matrices.
  arXiv  Detail & Related papers  (2021-09-30T02:54:45Z)
• Experimental Masking of Real Quantum States [2.2813103350092248]
  We experimentally realize a masking protocol of the real ququart by virtue of a photonic quantum walk. Our experiment clearly demonstrates that quantum information of the real ququart can be completely hidden in bipartite correlations of two-qubit hybrid entangled states. The hidden information is not accessible from each qubit alone, but can be faithfully retrieved with a fidelity of about 99% from correlation measurements.
  arXiv  Detail & Related papers  (2021-07-04T10:46:03Z)
• Quantum information masking basing on quantum teleportation [0.0]
  No-masking theorem says that masking quantum information is impossible in a bipartite scenario. We present two four-partite maskers and a tripartite masker. The information can be extracted naturally in their reverse processes.
  arXiv  Detail & Related papers  (2021-03-04T15:53:34Z)
• Photonic implementation of quantum information masking [16.34212056758587]
  Masking of quantum information spreads it over nonlocal correlations and hides it from the subsystems. We show that the resource of maskable quantum states are far more abundant than the no-go theorem seemingly suggests. We devise a photonic quantum information masking machine to experimentally investigate the properties of qubit masking.
  arXiv  Detail & Related papers  (2020-11-10T08:01:26Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.