Quantum Information Masking of Hadamard Sets

• URL: http://arxiv.org/abs/2109.14819v1
• Date: Thu, 30 Sep 2021 02:54:45 GMT
• Title: Quantum Information Masking of Hadamard Sets
• Authors: Bao-Zhi Sun, Shao-Ming Fei, and Xianqing Li-Jost
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study quantum information masking of arbitrary dimensional states. Given a set of fixed reducing pure states, we study the linear combinations of them, such that they all have the same marginal states with the given ones. We define the so called Hadamard set of quantum states whose Gram-Schmidt matrix can be diagonalized by Hadamard unitary matrices. We show that any Hadamard set can be deterministically masked by a unitary operation. We analyze the states which can be masked together with the given Hadamard set using the result about the linear combinations of fixed reducing states. Detailed examples are given to illustrate our results.

Related papers

• Unsupervised state learning from pairs of states [0.0]
  We show that if an additional copy of each qubit is supplied, that is, one receives pairs of qubits, both in the same state, rather than single qubits. We then simulate numerically the measurement of a sequence of qubit pairs and show that the unknown states and their respective probabilities of occurrence can be found with high accuracy.
  arXiv  Detail & Related papers  (2024-09-17T12:19:56Z)
• Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
  We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states. It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems. The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• 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)
• Approximate orthogonality of permutation operators, with application to quantum information [0.9790236766474201]
  Consider the $n!$ different unitary matrices that permute $n$ $d$-dimensional quantum systems. If $dgeq n$ then they are linearly independent. This simple point has several applications in quantum information and random matrix theory.
  arXiv  Detail & Related papers  (2023-09-01T19:45:30Z)
• Weakly Hadamard diagonalizable graphs and Quantum State Transfer [0.0]
  We study Hadamard diagonalizable graphs in the context of quantum state transfer. We provide numerous properties and constructions of weak Hadamard matrices and weakly Hadamard diagonalizable graphs.
  arXiv  Detail & Related papers  (2023-07-04T18:04:47Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• Quantum state tomography with tensor train cross approximation [84.59270977313619]
  We show that full quantum state tomography can be performed for such a state with a minimal number of measurement settings. Our method requires exponentially fewer state copies than the best known tomography method for unstructured states and local measurements.
  arXiv  Detail & Related papers  (2022-07-13T17:56:28Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Masking quantum information encoded in pure and mixed states [0.7349727826230862]
  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.
  arXiv  Detail & Related papers  (2020-04-30T03:50:41Z)
• Impossibility of masking a set of quantum states of nonzero measure [17.297680102923888]
  We study the quantum information masking based on isometric linear operators that distribute the information encoded in pure states to the correlations in bipartite states. It is shown that a isometric linear operator can not mask any nonzero measure set of pure states.
  arXiv  Detail & Related papers  (2020-04-20T23:03:52Z)
• Optimal Iterative Sketching with the Subsampled Randomized Hadamard Transform [64.90148466525754]
  We study the performance of iterative sketching for least-squares problems. We show that the convergence rate for Haar and randomized Hadamard matrices are identical, andally improve upon random projections. These techniques may be applied to other algorithms that employ randomized dimension reduction.
  arXiv  Detail & Related papers  (2020-02-03T16:17:50Z)

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.