Conditions for the existence of positive operator valued measures

• URL: http://arxiv.org/abs/2310.12302v1
• Date: Wed, 18 Oct 2023 20:09:47 GMT
• Title: Conditions for the existence of positive operator valued measures
• Authors: Maximilian Schumacher and Gernot Alber
• Abstract summary: A sufficient condition for the existence of $(N,M)$-POVMs is presented. Necessary conditions are derived for the existence of optimal $(N,M)$-POVMs.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Sufficient and necessary conditions are presented for the existence of $(N,M)$-positive operator valued measures ($(N,M)$-POVMs) valid for arbitrary-dimensional quantum systems. A sufficient condition for the existence of $(N,M)$-POVMs is presented. It yields a simple relation determining an upper bound on the continuous parameter of an arbitrary $(N,M)$-POVM, below which all its POVM elements are guaranteed to be positive semidefinite. Necessary conditions are derived for the existence of optimal $(N,M)$-POVMs. One of these necessary conditions exhibits a close connection between the existence of optimal informationally complete $(N,M)$-POVMs and the existence of isospectral, traceless, orthonormal, hermitian operator bases in cases, in which the parameter $M$ exceeds the dimension of the quantum system under consideration. Another necessary condition is derived for optimal $(N,M)$-POVMs, whose parameter $M$ is less than the dimension of the quantum system. It is shown that in these latter cases all POVM elements necessarily are projection operators of equal rank. This significantly constrains the possible parameters for constructing optimal $(N,M)$-POVMs. For the special case of $M=2$ a necessary and sufficient condition for the existence of optimal $(N,2)$-POVMs is presented.

Related papers

• Quantifying multipartite quantum states by ($k+1$)-partite entanglement measures [2.150800093140658]
  We put forward two families of entanglement measures termed $q$-$(k+1)$-PE concurrence $(q>1)$ and $alpha$-$(k+1)$-PE concurrence $(0leqalpha1)$. We also propose two alternative kinds of entanglement measures, named $q$-$(k+1)$-GPE concurrence $(q>1)$ and $alpha$-$(k+1)$-GPE concurrence $(0leqalpha1)$.
  arXiv  Detail & Related papers  (2024-04-23T13:19:17Z)
• Normalizing flows as approximations of optimal transport maps via linear-control neural ODEs [49.1574468325115]
  "Normalizing Flows" is related to the task of constructing invertible transport maps between probability measures by means of deep neural networks. We consider the problem of recovering the $Wamma$-optimal transport map $T$ between absolutely continuous measures $mu,nuinmathcalP(mathbbRn)$ as the flow of a linear-control neural ODE.
  arXiv  Detail & Related papers  (2023-11-02T17:17:03Z)
• Construction of $\varepsilon_{d}$-ASIC-POVMs via $2$-to-$1$ PN functions and the Li bound [28.746561122145483]
  We prove that all $2$-to-$1$ perfect nonlinear (PN) functions can be used for constructing $varepsilon_q$-ASIC-POVMs. We show that the set of vectors corresponding to the $varepsilon_q$-ASIC-POVM forms a biangular frame. The construction of $varepsilon_q+1$-ASIC-POVMs is based on a multilicative character sum estimate called the Li bound.
  arXiv  Detail & Related papers  (2023-10-10T08:41:22Z)
• Transformers as Support Vector Machines [54.642793677472724]
  We establish a formal equivalence between the optimization geometry of self-attention and a hard-margin SVM problem. We characterize the implicit bias of 1-layer transformers optimized with gradient descent. We believe these findings inspire the interpretation of transformers as a hierarchy of SVMs that separates and selects optimal tokens.
  arXiv  Detail & Related papers  (2023-08-31T17:57:50Z)
• Reward-Mixing MDPs with a Few Latent Contexts are Learnable [75.17357040707347]
  We consider episodic reinforcement learning in reward-mixing Markov decision processes (RMMDPs) Our goal is to learn a near-optimal policy that nearly maximizes the $H$ time-step cumulative rewards in such a model.
  arXiv  Detail & Related papers  (2022-10-05T22:52:00Z)
• Quantum Resources Required to Block-Encode a Matrix of Classical Data [56.508135743727934]
  We provide circuit-level implementations and resource estimates for several methods of block-encoding a dense $Ntimes N$ matrix of classical data to precision $epsilon$. We examine resource tradeoffs between the different approaches and explore implementations of two separate models of quantum random access memory (QRAM) Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
  arXiv  Detail & Related papers  (2022-06-07T18:00:01Z)
• Threshold size for the emergence of a classical-like behaviour [68.8204255655161]
  We design a procedure to estimate the minimum size beyond which a system is amenable to a classical-like description. The specific case of a magnetic system is considered, with details of a gedanken experiment presented and thoroughly commented.
  arXiv  Detail & Related papers  (2022-03-25T11:31:14Z)
• On Multimarginal Partial Optimal Transport: Equivalent Forms and Computational Complexity [11.280177531118206]
  We study the multi-marginal partial optimal transport (POT) problem between $m$ discrete (unbalanced) measures with at most $n$ supports. We first prove that we can obtain two equivalence forms of the multimarginal POT problem in terms of the multimarginal optimal transport problem via novel extensions of cost tensor. We demonstrate that the ApproxMPOT algorithm can approximate the optimal value of multimarginal POT problem with a computational complexity upper bound of the order $tildemathcalO(m3(n+1)m/ var
  arXiv  Detail & Related papers  (2021-08-18T06:46:59Z)
• Quantum Optimal Transport [0.0]
  We analyze a quantum version of the Monge--Kantorovich optimal transport problem. We show that the quantum transport is cheaper than the classical one. We also discuss the quantum optimal transport for general $d$-partite systems.
  arXiv  Detail & Related papers  (2021-05-14T16:11:27Z)
• Finding Global Minima via Kernel Approximations [90.42048080064849]
  We consider the global minimization of smooth functions based solely on function evaluations. In this paper, we consider an approach that jointly models the function to approximate and finds a global minimum.
  arXiv  Detail & Related papers  (2020-12-22T12:59:30Z)
• Polynomial scaling of QAOA for ground-state preparation of the fully-connected p-spin ferromagnet [0.0]
  We show that the quantum approximate optimization algorithm (QAOA) can construct with ferromagnetly scaling resources the ground state of the fully-optimal p-spin Ising. We find that an appropriate QAOA parameter is necessary to achieve a good performance of the algorithm when the number of variational parameters $2rm P$ is much smaller than the system size $rm N$.
  arXiv  Detail & Related papers  (2020-03-16T19:22:58Z)

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.