Universal method for optimized robustness in self-testing of quantum resources

• URL: http://arxiv.org/abs/2603.19612v1
• Date: Fri, 20 Mar 2026 03:37:20 GMT
• Title: Universal method for optimized robustness in self-testing of quantum resources
• Abstract summary: We introduce a universal method for conducting robustness analysis in the self-testing of various quantum resources.<n>We demonstrate the method's capability to surpass previously reported robustness bounds across a range of concrete examples.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Self-testing is a phenomenon where the use of specific quantum states or measurements can be inferred solely from the correlations they generate. We introduce a universal method for conducting robustness analysis in the self-testing of various quantum resources. Unlike previous numerical approaches, which rely on selecting specific isometries, our method optimizes over equivalence transformations, thereby leading to tighter robustness bounds. This optimization employs the well-established technique of semidefinite programming relaxations for non-commuting polynomial optimization. Our method can be universally applied to diverse self-testing settings, including steerable assemblages in the Bell scenario, constellations of quantum states in the prepare-and-measure scenario, and entangled states in the steering scenario. We demonstrate the method's capability to surpass previously reported robustness bounds across a range of concrete examples.

Related papers

• Unified and computable approach to optimal strategies for multiparameter estimation [0.7161783472741748]
  We present a unified and computable approach for the simultaneous estimation of multiple parameters.<n>The core of our approach is to integrate the quantum tester formalism into the recently proposed tight Cramér-Rao type bound.<n>We revisit three-dimensional magnetic-field estimation, uncovering the strengths and limitations of existing analytical results.
  arXiv  Detail & Related papers  (2026-03-06T13:05:19Z)
• Measurement-driven Quantum Approximate Optimization [2.5514179157254877]
  A recently proposed method makes use of ancilla qubits and controlled unitary operators to implement weak measurements related to imaginary-time evolution.<n>We first generalize the algorithm from exact to approximate optimization, taking advantage of several properties unique to classical problems.<n>We show how to adapt our paradigm to the setting of constrained optimization for a number of important classes of hard problem constraints.
  arXiv  Detail & Related papers  (2025-12-24T08:27:32Z)
• Generalization Bounds of Surrogate Policies for Combinatorial Optimization Problems [53.03951222945921]
  We analyze smoothed (perturbed) policies, adding controlled random perturbations to the direction used by the linear oracle.<n>Our main contribution is a generalization bound that decomposes the excess risk into perturbation bias, statistical estimation error, and optimization error.<n>We illustrate the scope of the results on applications such as vehicle scheduling, highlighting how smoothing enables both tractable training and controlled generalization.
  arXiv  Detail & Related papers  (2024-07-24T12:00:30Z)
• A Unified Theory of Stochastic Proximal Point Methods without Smoothness [52.30944052987393]
  Proximal point methods have attracted considerable interest owing to their numerical stability and robustness against imperfect tuning. This paper presents a comprehensive analysis of a broad range of variations of the proximal point method (SPPM)
  arXiv  Detail & Related papers  (2024-05-24T21:09:19Z)
• Benchmarking Optimizers for Qumode State Preparation with Variational Quantum Algorithms [10.941053143198092]
  There has been a growing interest in qumodes due to advancements in the field and their potential applications. This paper aims to bridge this gap by providing performance benchmarks of various parameters used in state preparation with Variational Quantum Algorithms.
  arXiv  Detail & Related papers  (2024-05-07T17:15:58Z)
• Likelihood Ratio Confidence Sets for Sequential Decision Making [51.66638486226482]
  We revisit the likelihood-based inference principle and propose to use likelihood ratios to construct valid confidence sequences. Our method is especially suitable for problems with well-specified likelihoods. We show how to provably choose the best sequence of estimators and shed light on connections to online convex optimization.
  arXiv  Detail & Related papers  (2023-11-08T00:10:21Z)
• GloptiNets: Scalable Non-Convex Optimization with Certificates [61.50835040805378]
  We present a novel approach to non-cube optimization with certificates, which handles smooth functions on the hypercube or on the torus. By exploiting the regularity of the target function intrinsic in the decay of its spectrum, we allow at the same time to obtain precise certificates and leverage the advanced and powerful neural networks.
  arXiv  Detail & Related papers  (2023-06-26T09:42:59Z)
• Quantum algorithm for robust optimization via stochastic-gradient online learning [0.0]
  We consider the online robust optimization meta-algorithm by Ben-Tal et al. and show that for a large range of subgradients, this algorithm has the same guarantee as the original non-stochastic version. We develop a quantum version of this algorithm and show that an at most quadratic improvement in terms of the dimension can be achieved.
  arXiv  Detail & Related papers  (2023-04-05T07:25:07Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Certificates of quantum many-body properties assisted by machine learning [0.0]
  We propose a novel approach combining the power of relaxation techniques with deep reinforcement learning. We illustrate the viability of the method in the context of finding the ground state energy of many transfer systems. We provide tools to generalize the approach to other common applications in the field of quantum information processing.
  arXiv  Detail & Related papers  (2021-03-05T17:47:26Z)
• A Dynamical Systems Approach for Convergence of the Bayesian EM Algorithm [59.99439951055238]
  We show how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based. The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM) We show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S&C approach.
  arXiv  Detail & Related papers  (2020-06-23T01:34: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.