The block-coherence measures and the coherence measures based on positive-operator-valued measures

• URL: http://arxiv.org/abs/2108.04405v1
• Date: Tue, 10 Aug 2021 02:25:24 GMT
• Title: The block-coherence measures and the coherence measures based on positive-operator-valued measures
• Authors: Liangxue Fu, Fengli Yan, Ting Gao
• Abstract summary: We study the block-coherence measures based on resource theory of block-coherence and the coherence measures based on positive-operator-valued measures (POVM) We propose a POVM-based coherence measure by using the known scheme of building POVM-based coherence measures from block-coherence measures, and the one-shot block coherence cost under the maximally POVM-incoherent operations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We mainly study the block-coherence measures based on resource theory of block-coherence and the coherence measures based on positive-operator-valued measures (POVM). Several block-coherence measures including a block-coherence measure based on maximum relative entropy, the one-shot block coherence cost under the maximally block-incoherent operations, and a coherence measure based on coherent rank have been introduced and the relationships between these block-coherence measures have been obtained. We also give the definition of the maximally block-coherent state and describe the deterministic coherence dilution process by constructing block-incoherent operations. Based on the POVM coherence resource theory, we propose a POVM-based coherence measure by using the known scheme of building POVM-based coherence measures from block-coherence measures, and the one-shot block coherence cost under the maximally POVM-incoherent operations. The relationship between the POVM-based coherence measure and the one-shot block coherence cost under the maximally POVM-incoherent operations is analysed.

Related papers

• Last-Iterate Global Convergence of Policy Gradients for Constrained Reinforcement Learning [62.81324245896717]
  We introduce an exploration-agnostic algorithm, called C-PG, which exhibits global last-ite convergence guarantees under (weak) gradient domination assumptions. We numerically validate our algorithms on constrained control problems, and compare them with state-of-the-art baselines.
  arXiv  Detail & Related papers  (2024-07-15T14:54:57Z)
• Towards Universal Dense Blocking for Entity Resolution [49.06313308481536]
  We propose UniBlocker, a dense blocker that is pre-trained on a domain-independent, easily-obtainable corpus. By conducting domain-independent pre-training, UniBlocker can be adapted to various downstream blocking scenarios without requiring domain-specific fine-tuning. Our experiments show that the proposed UniBlocker, without any domain-specific learning, significantly outperforms previous self- and unsupervised dense blocking methods.
  arXiv  Detail & Related papers  (2024-04-23T08:39:29Z)
• Provably Efficient UCB-type Algorithms For Learning Predictive State Representations [55.00359893021461]
  The sequential decision-making problem is statistically learnable if it admits a low-rank structure modeled by predictive state representations (PSRs) This paper proposes the first known UCB-type approach for PSRs, featuring a novel bonus term that upper bounds the total variation distance between the estimated and true models. In contrast to existing approaches for PSRs, our UCB-type algorithms enjoy computational tractability, last-iterate guaranteed near-optimal policy, and guaranteed model accuracy.
  arXiv  Detail & Related papers  (2023-07-01T18:35:21Z)
• Bounds on positive operator-valued measure based coherence of superposition [4.536603451832357]
  POVM-based coherence measures have been proposed with respect to the relative entropy of coherence. We derive analytically the lower and upper bounds on these POVM-based coherence of an arbitrary given superposed pure state. Our results can be used to estimate range of quantum coherence of superposed states.
  arXiv  Detail & Related papers  (2023-05-11T10:31:04Z)
• Nearly Optimal Latent State Decoding in Block MDPs [74.51224067640717]
  In episodic Block MDPs, the decision maker has access to rich observations or contexts generated from a small number of latent states. We are first interested in estimating the latent state decoding function based on data generated under a fixed behavior policy. We then study the problem of learning near-optimal policies in the reward-free framework.
  arXiv  Detail & Related papers  (2022-08-17T18:49:53Z)
• Detecting coherence with respect to general quantum measurements [4.585247747779235]
  We present witnesses for block coherence and POVM-based coherence. We discuss possible realizations of some block coherence and POVM-based coherence witnesses in experiments. We prove that the quantum Fisher information of any block incoherent state is equal to zero.
  arXiv  Detail & Related papers  (2022-08-10T04:04:39Z)
• Efficient Reinforcement Learning in Block MDPs: A Model-free Representation Learning Approach [73.62265030773652]
  We present BRIEE, an algorithm for efficient reinforcement learning in Markov Decision Processes with block-structured dynamics. BRIEE interleaves latent states discovery, exploration, and exploitation together, and can provably learn a near-optimal policy. We show that BRIEE is more sample efficient than the state-of-art Block MDP algorithm HOMER RL and other empirical baselines on challenging rich-observation combination lock problems.
  arXiv  Detail & Related papers  (2022-01-31T19:47:55Z)
• Proximal Reinforcement Learning: Efficient Off-Policy Evaluation in Partially Observed Markov Decision Processes [65.91730154730905]
  In applications of offline reinforcement learning to observational data, such as in healthcare or education, a general concern is that observed actions might be affected by unobserved factors. Here we tackle this by considering off-policy evaluation in a partially observed Markov decision process (POMDP) We extend the framework of proximal causal inference to our POMDP setting, providing a variety of settings where identification is made possible.
  arXiv  Detail & Related papers  (2021-10-28T17:46:14Z)
• Quantifying dynamical coherence with coherence measures [2.446672595462589]
  Quantum coherence, like entanglement, is a fundamental resource in quantum information. It is difficult to define incoherent operations directly, without requiring incoherent states. We introduce an alternate definition of incoherent operations, induced via coherence measures, and quantify dynamical coherence.
  arXiv  Detail & Related papers  (2021-03-31T15:09:33Z)
• Coherence measures with respect to general quantum measurements [0.4588028371034407]
  We first establish an alternative framework for the block coherence and provide several block coherence measures. We then present several coherence measures with respect to POVM measurements, and prove a conjecture on the $l_1$-norm related POVM coherence measure.
  arXiv  Detail & Related papers  (2020-07-19T04:21:18Z)

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.