Randomness-free Detection of Non-projective Measurements: Qubits & beyond

• URL: http://arxiv.org/abs/2412.00213v2
• Date: Mon, 31 Mar 2025 14:10:02 GMT
• Title: Randomness-free Detection of Non-projective Measurements: Qubits & beyond
• Authors: Sumit Rout, Some Sankar Bhattacharya, Paweł Horodecki,
• Abstract summary: Non-projective measurements play a crucial role in various information-processing protocols.<n>We propose an operational task to identify measurements that are neither projective nor classical post-processing.<n>We show that detecting qubit non-projective measurements is robust under it arbitrary depolarising noise.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Non-projective measurements play a crucial role in various information-processing protocols. In this work, we propose an operational task to identify measurements that are neither projective nor classical post-processing of data obtained from projective measurements. Our setup involves space-like separated parties with access to a shared state with bounded local dimensions. Specifically, in the case of qubits, we focus on a bipartite scenario with different sets of target correlations. While some of these correlations can be obtained through non-projective measurements on a shared two-qubit state, it is impossible to generate these correlations using {\it projective simulable} measurements on bipartite qubit states, or equivalently, by using one bit of shared randomness and local post-processing. For certain target correlations, we show that detecting qubit non-projective measurements is robust under {\it arbitrary} depolarising noise, except in the limiting case. We extend this task for qutrits and demonstrate that some correlations achievable via local non-projective measurements cannot be reproduced by both parties performing the same qutrit {\it projective simulable} measurements on their pre-shared state. We provide numerical evidence for the robustness of this scheme under {\it arbitrary} depolarising noise. For a more generic consideration (bipartite and tripartite scenario), we provide numerical evidence for a projective-simulable bound on the reward function for our task. We also show a violation of this bound by using qutrit POVMs. From a foundational perspective, we extend the notion of non-projective measurements to general probabilistic theories (GPTs) and use a randomness-free test to demonstrate that a class of GPTs, called {\it square-bits or box-world} are unphysical.

Related papers

• Pretty-good simulation of all quantum measurements by projective measurements [0.0]
  In quantum theory general measurements are described by so-called Positive Operator-Valued Measures (POVMs) We show that in $d$-dimensional quantum systems an application of depolarizing noise with constant (independent of $d$) visibility parameter makes any POVM simulable by a randomized implementation of projective measurements. This result significantly limits the advantage that POVMs can offer over projective measurements in various information-processing tasks.
  arXiv  Detail & Related papers  (2025-01-16T07:47:24Z)
• Sharing Asymmetric Einstein-Podolsky-Rosen Steering with Projective Measurements [9.798839832137508]
  Einstein-Podolsky-Rosen (EPR) steering exhibits distinct asymmetric characteristics. EPR steering serves as the necessary quantum resource for one-sided device-independent quantum information tasks. Our work deepens the understanding of the role of projective measurements in sharing quantum correlations.
  arXiv  Detail & Related papers  (2024-05-10T05:46:51Z)
• Unbounded Sharing of Nonlocality Using Projective Measurements [0.0]
  A sharp projective measurement in one side of the Bell experiment destroys the entanglement of the shared state. We introduce a local randomness-assisted projective measurement protocol, enabling the sharing of nonlocality by an arbitrary number of sequential observers.
  arXiv  Detail & Related papers  (2023-11-14T08:09:16Z)
• ProbVLM: Probabilistic Adapter for Frozen Vision-Language Models [69.50316788263433]
  We propose ProbVLM, a probabilistic adapter that estimates probability distributions for the embeddings of pre-trained vision-language models. We quantify the calibration of embedding uncertainties in retrieval tasks and show that ProbVLM outperforms other methods. We present a novel technique for visualizing the embedding distributions using a large-scale pre-trained latent diffusion model.
  arXiv  Detail & Related papers  (2023-07-01T18:16:06Z)
• Just One Byte (per gradient): A Note on Low-Bandwidth Decentralized Language Model Finetuning Using Shared Randomness [86.61582747039053]
  Language model training in distributed settings is limited by the communication cost of exchanges. We extend recent work using shared randomness to perform distributed fine-tuning with low bandwidth.
  arXiv  Detail & Related papers  (2023-06-16T17:59:51Z)
• Randomness-free Test of Non-classicality: a Proof of Concept [0.0]
  Existing schemes to certify such non-classical resources in a device-independent manner require seed randomness. We propose and experimentally implement a semi-device independent certification technique for both quantum correlations and non-projective measurements without seed randomness.
  arXiv  Detail & Related papers  (2023-03-13T10:44:16Z)
• Some Entanglement Survives Most Measurements [1.3812010983144802]
  We investigate the limitations of repeated non-projective measurements in preparing a quantum system. We show that some entanglement remains unless one of the measurement operators becomes perfectly projective. We present results for $n$-qubit and $n$-dimensional input states.
  arXiv  Detail & Related papers  (2023-02-14T08:02:27Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Boosting Few-shot Fine-grained Recognition with Background Suppression and Foreground Alignment [53.401889855278704]
  Few-shot fine-grained recognition (FS-FGR) aims to recognize novel fine-grained categories with the help of limited available samples. We propose a two-stage background suppression and foreground alignment framework, which is composed of a background activation suppression (BAS) module, a foreground object alignment (FOA) module, and a local to local (L2L) similarity metric. Experiments conducted on multiple popular fine-grained benchmarks demonstrate that our method outperforms the existing state-of-the-art by a large margin.
  arXiv  Detail & Related papers  (2022-10-04T07:54:40Z)
• Experimentally determining the incompatibility of two qubit measurements [55.41644538483948]
  We describe and realize an experimental procedure for assessing the incompatibility of two qubit measurements. We demonstrate this fact in an optical setup, where the qubit states are encoded into the photons' polarization degrees of freedom.
  arXiv  Detail & Related papers  (2021-12-15T19:01:44Z)
• Neural Methods for Point-wise Dependency Estimation [129.93860669802046]
  We focus on estimating point-wise dependency (PD), which quantitatively measures how likely two outcomes co-occur. We demonstrate the effectiveness of our approaches in 1) MI estimation, 2) self-supervised representation learning, and 3) cross-modal retrieval task.
  arXiv  Detail & Related papers  (2020-06-09T23:26:15Z)
• Distributed, partially collapsed MCMC for Bayesian Nonparametrics [68.5279360794418]
  We exploit the fact that completely random measures, which commonly used models like the Dirichlet process and the beta-Bernoulli process can be expressed as, are decomposable into independent sub-measures. We use this decomposition to partition the latent measure into a finite measure containing only instantiated components, and an infinite measure containing all other components. The resulting hybrid algorithm can be applied to allow scalable inference without sacrificing convergence guarantees.
  arXiv  Detail & Related papers  (2020-01-15T23:10:13Z)

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.