Complementary Relationships between Entanglement and Measurement

• URL: http://arxiv.org/abs/2401.17537v3
• Date: Sat, 31 Aug 2024 19:24:40 GMT
• Title: Complementary Relationships between Entanglement and Measurement
• Authors: Michael Steiner, Ronald Rendell,
• Abstract summary: For qubit systems, both measurement on a single system and measurements on a bipartite system are considered in regards to the entanglement. It is proven that $overlineE+Dle 1$ holds where $overlineE$ is the average entanglement after a measurement is made. We conclude that the amount of disturbance and information gain that one can gain are strictly limited by entanglement.
• Score: 0.6261444979025641
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Complementary relationships exist regarding interference properties of particles such as pattern visibility, predictability and distinguishability. Additionally, relationships are known between information gain $G$ and measurement disturbance $F$ for entangled spin pairs. The question of whether a similar complementary relationship between entanglement and measurement occurs is examined herein. For qubit systems, both measurement on a single system and measurements on a bipartite system are considered in regards to the entanglement. It is proven that $\overline{E}+D\le 1$ holds where $\overline{E}$ is the average entanglement after a measurement is made and for which $D$ is a measure of the measurement disturbance of a single measurement. For measurements on a bipartite system shared by Alice and Bob ,it is shown that $\overline{E}+\overline{G}\le 1$ where $\overline{G}$ is the maximum average information gain regarding Alice's result that can be obtained by Bob. These results are generalized for arbitrary initial mixed states and as well to non-Hermitian operators. In the case of maximally entangled initial states, it is found that $D\le E_{L}$ and $\overline{G}\le E_{L}$ where $E_{L}$ is the entanglement loss due to measurement by Alice. We conclude that the amount of disturbance and information gain that one can gain are strictly limited by entanglement.

Related papers

• Quantitative wave-particle duality in uniform multipath interferometers with symmetric which-path detector states [1.0896567381206717]
  A quantum system (quanton) traverses an interferometer with $N$ equally probable paths and interacts with another quantum system (detector) that stores path information in a set of correlations states.<n>We present entropic wave-particle duality relations between quantum coherence, characterized by the relative entropy of coherence of the quanton state, and which-path knowledge, quantified by the mutual information obtained through detector-state discrimination.
  arXiv  Detail & Related papers  (2026-01-19T14:19:06Z)
• Mutually equi-biased bases [0.0]
  In the framework of mutually unbiased bases (MUBs), a measurement in one basis gives emphno information about the outcomes of measurements in another basis.<n>We define the notion of emphmutually equi-biased bases (MEBs) such that within each basis the states are equi-biased with respect to the states of the other basis.<n>We show that not all bases in a set of $L$ MEBs can have contribution for the entanglement detection.
  arXiv  Detail & Related papers  (2025-08-12T14:34:37Z)
• Mesoscopic Fluctuations and Multifractality at and across Measurement-Induced Phase Transition [46.176861415532095]
  We explore statistical fluctuations over the ensemble of quantum trajectories in a model of two-dimensional free fermions.<n>Our results exhibit a remarkable analogy to Anderson localization, with $G_AB$ corresponding to two-terminal conductance.<n>Our findings lay the groundwork for mesoscopic theory of monitored systems, paving the way for various extensions.
  arXiv  Detail & Related papers  (2025-07-15T13:44:14Z)
• Dimension-free Private Mean Estimation for Anisotropic Distributions [55.86374912608193]
  Previous private estimators on distributions over $mathRd suffer from a curse of dimensionality. We present an algorithm whose sample complexity has improved dependence on dimension.
  arXiv  Detail & Related papers  (2024-11-01T17:59:53Z)
• Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition [71.33787410075577]
  We study reinforcement learning with linear function approximation, unknown transition, and adversarial losses. We propose a new algorithm that attains an $widetildeO(dsqrtHS3K + sqrtHSAK)$ regret with high probability.
  arXiv  Detail & Related papers  (2024-03-07T15:03:50Z)
• Robust 1-bit Compressed Sensing with Iterative Hard Thresholding [18.05573480691047]
  In 1-bit compressed sensing, the aim is to estimate a $k$-sparse unit vector $xin Sn-1$ within an $epsilon$ error. In this paper, we study a noisy version where a fraction of the measurements can be flipped, potentially by an adversary. We show that when up to $tau$-fraction of the sign measurements are incorrect, BIHTally provides an estimate of $x$ within an $tildeO(epsilon+tau)$ error.
  arXiv  Detail & Related papers  (2023-10-12T03:41:32Z)
• Entanglement in one-dimensional critical state after measurements [1.0301458191595498]
  We study the effect of weak measurements on the entanglement scaling in the ground state of the one-dimensional critical transverse-field Ising model. We derive the analytical expression of $c_texteff$ as a function of the measurement strength. Using numerical simulations, we show that for the EE averaged over all post-measurement states based on their Born-rule probabilities, the numerically extracted effective central charge appears to be independent of the measurement strength.
  arXiv  Detail & Related papers  (2023-01-19T19:00:00Z)
• Causal Bandits for Linear Structural Equation Models [58.2875460517691]
  This paper studies the problem of designing an optimal sequence of interventions in a causal graphical model. It is assumed that the graph's structure is known and has $N$ nodes. Two algorithms are proposed for the frequentist (UCB-based) and Bayesian settings.
  arXiv  Detail & Related papers  (2022-08-26T16:21:31Z)
• A Law of Robustness beyond Isoperimetry [84.33752026418045]
  We prove a Lipschitzness lower bound $Omega(sqrtn/p)$ of robustness of interpolating neural network parameters on arbitrary distributions. We then show the potential benefit of overparametrization for smooth data when $n=mathrmpoly(d)$. We disprove the potential existence of an $O(1)$-Lipschitz robust interpolating function when $n=exp(omega(d))$.
  arXiv  Detail & Related papers  (2022-02-23T16:10:23Z)
• Variance-Aware Confidence Set: Variance-Dependent Bound for Linear Bandits and Horizon-Free Bound for Linear Mixture MDP [76.94328400919836]
  We show how to construct variance-aware confidence sets for linear bandits and linear mixture Decision Process (MDP) For linear bandits, we obtain an $widetildeO(mathrmpoly(d)sqrt1 + sum_i=1Ksigma_i2) regret bound, where $d is the feature dimension. For linear mixture MDP, we obtain an $widetildeO(mathrmpoly(d)sqrtK)$ regret bound, where
  arXiv  Detail & Related papers  (2021-01-29T18:57:52Z)
• The Generalized Lasso with Nonlinear Observations and Generative Priors [63.541900026673055]
  We make the assumption of sub-Gaussian measurements, which is satisfied by a wide range of measurement models. We show that our result can be extended to the uniform recovery guarantee under the assumption of a so-called local embedding property.
  arXiv  Detail & Related papers  (2020-06-22T16:43:35Z)
• The Uncertainty Principle Revisited [0.0]
  We study the quantum-mechanical uncertainty relation originating from the successive measurement of two observables. We find a general connection of this uncertainty relation with the commutator of the two observables.
  arXiv  Detail & Related papers  (2020-05-30T20:09:02Z)
• Self-Organized Error Correction in Random Unitary Circuits with Measurement [0.0]
  We quantify a universal, subleading logarithmic contribution to the volume law entanglement entropy. We find that measuring a qudit deep inside $A$ will have negligible effect on the entanglement of $A$. We assume that the volume-law state is an encoding of a Page state in a quantum error-correcting code.
  arXiv  Detail & Related papers  (2020-02-27T19:00:42Z)
• Information Constraints in Quantum Measurements and State Collapse [0.0]
  Quantum-mechanical constraints on information transfer in measuring systems and their influence on measurement results studied.<n>It's shown that during the measurement these constraints obstacle the acquisition of information by $cal A$, characterizing purity of $cal S$ ensemble.
  arXiv  Detail & Related papers  (2010-05-20T13:29:24Z)

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.