Informationally Overcomplete POVMs for Quantum State Estimation and Binary Detection

• URL: http://arxiv.org/abs/2012.05355v1
• Date: Wed, 9 Dec 2020 22:59:03 GMT
• Title: Informationally Overcomplete POVMs for Quantum State Estimation and Binary Detection
• Authors: Catherine Medlock, Alan Oppenheim, Petros Boufounos
• Abstract summary: We show how robustness can be shown to exist in the context of quantum state estimation. We show that there is a tradeoff in estimation performance between the number of copies of the unknown system and the number of POVM elements.
• Score: 3.9533044769534444
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is well-known in classical frame theory that overcomplete representations of a given vector space provide robustness to additive noise on the frame coefficients of an unknown vector. We describe how the same robustness can be shown to exist in the context of quantum state estimation. A key element of the discussion is the application of classical frame theory to operator-valued vector spaces, or operator spaces, which arise naturally in quantum mechanics. Specifically, in the problem we describe the frame vectors are represented by the elements of an informationally complete or overcomplete (IC or IOC) POVM, the frame coefficients are represented by the outcome probabilities of a quantum measurement made on an unknown state, and the error on the frame coefficients arises from finite sample size estimations of the probabilities. We show that with this formulation of the problem, there is a tradeoff in estimation performance between the number of copies of the unknown system and the number of POVM elements. Lastly, we present evidence through simulation that the same tradeoff is present in the context of quantum binary state detection -- the probability of error can be reduced either by increasing the number of copies of the unknown system or by increasing the number of POVM elements.

Related papers

• Sample-Optimal Quantum State Tomography for Structured Quantum States in One Dimension [25.333797381352973]
  We study whether the number of state copies can saturate the information theoretic bound (i.e., $O(n)$) using physical quantum measurements. We propose a projected gradient descent (PGD) algorithm to solve the constrained least-squares problem and show that it can efficiently find an estimate with bounded recovery error.
  arXiv  Detail & Related papers  (2024-10-03T15:26:26Z)
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits [37.84307089310829]
  Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit. Despite their promise, the trainability of these algorithms is hindered by barren plateaus. We present a general Lie algebra that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits.
  arXiv  Detail & Related papers  (2023-09-17T18:14:10Z)
• Quantum State Tomography for Matrix Product Density Operators [28.799576051288888]
  Reconstruction of quantum states from experimental measurements is crucial for the verification and benchmarking of quantum devices. Many physical quantum states, such as states generated by noisy, intermediate-scale quantum computers, are usually structured. We establish theoretical guarantees for the stable recovery of MPOs using tools from compressive sensing and the theory of empirical processes.
  arXiv  Detail & Related papers  (2023-06-15T18:23:55Z)
• Quantum reservoir computing in finite dimensions [5.406386303264086]
  This paper shows that alternative representations can provide better insights when dealing with design and assessment questions. It is shown that these vector representations yield state-affine systems previously introduced in the classical reservoir computing literature.
  arXiv  Detail & Related papers  (2022-12-01T09:58:03Z)
• Witnessing non-Markovianity by Quantum Quasi-Probability Distributions [0.0]
  We employ frames consisting of rank-one projectors (i.e. pure quantum states) and their induced informationally complete quantum measurements (IC-POVMs) to represent generally mixed quantum states by quasi-probability distributions. We explain that the Kolmogorov distances between these quasi-probability distributions lead to upper and lower bounds of the trace distance which measures the distinguishability of quantum states.
  arXiv  Detail & Related papers  (2022-10-12T10:02:23Z)
• Fusion-based quantum computation [43.642915252379815]
  Fusion-based quantum computing (FBQC) is a model of universal quantum computation in which entangling measurements, called fusions, are performed on qubits of small constant-sized entangled resource states. We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes. This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics.
  arXiv  Detail & Related papers  (2021-01-22T20:00:22Z)
• Detecting and quantifying entanglement on near-term quantum devices [12.77267196289718]
  We propose two variational quantum algorithms for detecting and quantifying entanglement on near-term quantum devices. VED makes use of the positive map criterion and works as follows. VLNE builds upon a linear decomposition of the map into Pauli terms and the recently proposed trace distance estimation algorithm.
  arXiv  Detail & Related papers  (2020-12-28T15:47:44Z)
• Quantum Tomography of Pure States with Projective Measurements Distorted by Experimental Noise [0.0]
  The article undertakes the problem of pure state estimation from projective measurements based on photon counting. Two generic frames for qubit tomography are considered -- one composed of the elements of the SIC-POVM and the other defined by the vectors from the mutually unbiased bases (MUBs)
  arXiv  Detail & Related papers  (2020-12-24T18:59:58Z)
• Quantum particle across Grushin singularity [77.34726150561087]
  We study the phenomenon of transmission across the singularity that separates the two half-cylinders. All the local realisations of the free (Laplace-Beltrami) quantum Hamiltonian are examined as non-equivalent protocols of transmission/reflection. This allows to comprehend the distinguished status of the so-called bridging' transmission protocol previously identified in the literature.
  arXiv  Detail & Related papers  (2020-11-27T12:53:23Z)
• The role of boundary conditions in quantum computations of scattering observables [58.720142291102135]
  Quantum computing may offer the opportunity to simulate strongly-interacting field theories, such as quantum chromodynamics, with physical time evolution. As with present-day calculations, quantum computation strategies still require the restriction to a finite system size. We quantify the volume effects for various $1+1$D Minkowski-signature quantities and show that these can be a significant source of systematic uncertainty.
  arXiv  Detail & Related papers  (2020-07-01T17:43:11Z)
• Inaccessible information in probabilistic models of quantum systems, non-contextuality inequalities and noise thresholds for contextuality [0.0]
  We quantify the inaccessible information of a model in terms of the maximum distinguishability of probability distributions. These bounds can be interpreted as a new class of robust preparation non-contextuality inequalities.
  arXiv  Detail & Related papers  (2020-03-12T19:23:14Z)

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.