Measurement incompatibility and quantum steering via linear programming

• URL: http://arxiv.org/abs/2506.03045v1
• Date: Tue, 03 Jun 2025 16:28:25 GMT
• Title: Measurement incompatibility and quantum steering via linear programming
• Authors: Lucas E. A. Porto, Sébastien Designolle, Sebastian Pokutta, Marco Túlio Quintino,
• Abstract summary: We develop a hierarchy of linear programs that compute upper and lower bounds on the robustness of quantum measurements.<n>We show how our methods can be used to construct local hidden state models for states, or conversely to certify that a given state exhibits steering.
• Score: 18.995314010885533
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The problem of deciding whether a set of quantum measurements is jointly measurable is known to be equivalent to determining whether a quantum assemblage is unsteerable. This problem can be formulated as a semidefinite program (SDP). However, the number of variables and constraints in such a formulation grows exponentially with the number of measurements, rendering it intractable for large measurement sets. In this work, we circumvent this problem by transforming the SDP into a hierarchy of linear programs that compute upper and lower bounds on the incompatibility robustness with a complexity that grows polynomially in the number of measurements. The hierarchy is guaranteed to converge and it can be applied to arbitrary measurements -- including non-projective POVMs -- in arbitrary dimensions. While convergence becomes impractical in high dimensions, in the case of qubits our method reliably provides accurate upper and lower bounds for the incompatibility robustness of sets with several hundred measurements in a short time using a standard laptop. We also apply our methods to qutrits, obtaining non-trivial upper and lower bounds in scenarios that are otherwise intractable using the standard SDP approach. Finally, we show how our methods can be used to construct local hidden state models for states, or conversely, to certify that a given state exhibits steering; for two-qubit quantum states, our approach is comparable to, and in some cases outperforms, the current best methods.

Related papers

• The suboptimality ratio of projective measurements restricted to low-rank subspaces [0.6345523830122168]
  This paper theoretically examines the suboptimality arising from a Procrustes problem for minimizing the average distance between two fixed quantum states.<n>We show that the suboptimality ratio is independent of the dimension of the full space, and is at most polylogarithmic in the dimension of the low-rank subspace.
  arXiv  Detail & Related papers  (2024-12-16T23:35:21Z)
• On compatibility of binary qubit measurements [0.0]
  This work approaches the problem through functions defined on the Boolean hypercube and their Fourier transformations. We show that this reformulation of the problem leads to a complete geometric characterisation of joint measurability of any finite set of unbiased binary qubit measurements. We discuss our results in the realm of quantum steering, where they translate into a family of steering inequalities.
  arXiv  Detail & Related papers  (2024-07-10T14:44:12Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• High-dimensional entanglement certification: bounding relative entropy of entanglement in $2d+1$ experiment-friendly measurements [77.34726150561087]
  Entanglement -- the coherent correlations between parties in a quantum system -- is well-understood and quantifiable. Despite the utility of such systems, methods for quantifying high-dimensional entanglement are more limited and experimentally challenging. We present a novel certification method whose measurement requirements scale linearly with dimension subsystem.
  arXiv  Detail & Related papers  (2022-10-19T16:52:21Z)
• Tight Cram\'{e}r-Rao type bounds for multiparameter quantum metrology through conic programming [61.98670278625053]
  It is paramount to have practical measurement strategies that can estimate incompatible parameters with best precisions possible. Here, we give a concrete way to find uncorrelated measurement strategies with optimal precisions. We show numerically that there is a strict gap between the previous efficiently computable bounds and the ultimate precision bound.
  arXiv  Detail & Related papers  (2022-09-12T13:06:48Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Incompatibility measures in multi-parameter quantum estimation under hierarchical quantum measurements [4.980960723762946]
  We show an approach to study the incompatibility under general $p$-local measurements. We demonstrate the power of the approach by presenting a hierarchy of analytical bounds on the tradeoff.
  arXiv  Detail & Related papers  (2021-09-13T09:33:47Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Improving the accuracy and efficiency of quantum connected moments expansions [4.9834612867114965]
  In quantum chemistry, the variational quantum eigensolver (VQE) algorithm has become ubiquitous. Here we use the ADAPT-VQE algorithm to test shallow circuit construction strategies.
  arXiv  Detail & Related papers  (2021-03-16T15:13:40Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)
• Entanglement distance for arbitrary $M$-qudit hybrid systems [0.0]
  We propose a measure of entanglement which can be computed for pure and mixed states of a $M$-qudit hybrid system. We quantify the robustness of entanglement of a state through the eigenvalues analysis of the metric tensor associated with it.
  arXiv  Detail & Related papers  (2020-03-11T15:16:36Z)

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.