Optimising quantum tomography via shadow inversion

• URL: http://arxiv.org/abs/2402.06727v4
• Date: Mon, 16 Sep 2024 14:22:51 GMT
• Title: Optimising quantum tomography via shadow inversion
• Authors: Andrea Caprotti, Joshua Morris, Borivoje Dakić,
• Abstract summary: This work introduces a novel technique for estimating such objects, leveraging an underutilised resource in the inversion map of classical shadows. A generalised framework for computing is given that may be adapted to a variety of near-term problems.
• Score: 0.393259574660092
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In quantum information theory, the accurate estimation of observables is pivotal for quantum information processing, playing a crucial role in compute and communication protocols. This work introduces a novel technique for estimating such objects, leveraging an underutilised resource in the inversion map of classical shadows that greatly refines the estimation cost of target observables without incurring any additional overhead. A generalised framework for computing and optimising additional degrees of freedom in the homogeneous space of the shadow inversion is given that may be adapted to a variety of near-term problems. In the special case of local measurement strategies we show feasible optimisation leading to an exponential separation in sample complexity versus the standard approach and in an exceptional case we give non-trivial examples of optimised post-processing for local measurements, achieving the same efficiency as the global Cliffords shadows.

Related papers

• Optimization-based Unfolding in High-Energy Physics [0.0]
  In High-Energy Physics, unfolding is the process of reconstructing true distributions of physical observables from detector-distorted measurements.<n>We develop a framework to tackle this problem using both classical and quantum-compatible methods.
  arXiv  Detail & Related papers  (2026-02-26T09:11:34Z)
• Classical shadows for sample-efficient measurements of gauge-invariant observables [0.002718525106069543]
  We develop three classical shadow protocols tailored to systems with local (or gauge) symmetries.<n>We demonstrate these trade-offs using a $mathZ$ gauge theory, where a dual formulation enables a rigorous analysis of resource requirements.
  arXiv  Detail & Related papers  (2025-11-04T19:00:01Z)
• Approximate Quantum State Preparation with Tree-Based Bayesian Optimization Surrogates [4.946006905837039]
  We study the problem of approximate state preparation on near-term quantum computers.<n>The goal is to construct a parameterized circuit that reproduces the output distribution of a target quantum state while minimizing resource overhead.<n>We propose CircuitTree, a surrogate-guided optimization framework based on Bayesian Optimization with tree-based models.
  arXiv  Detail & Related papers  (2025-09-30T18:19:37Z)
• Neural Optimal Transport Meets Multivariate Conformal Prediction [58.43397908730771]
  We propose a framework for conditional vectorile regression (CVQR)<n>CVQR combines neural optimal transport with quantized optimization, and apply it to predictions.
  arXiv  Detail & Related papers  (2025-09-29T19:50:19Z)
• Robust and efficient estimation of global quantum properties under realistic noise [5.598445225432505]
  We propose a robust phase shadow scheme based on random circuits with controlled-Z as unique entangling gate type.<n>We show that phase shadows match the performance of full Clifford-based ones.<n>Our results enhance the practicality of shadow-based techniques, providing a robust and scalable route for estimating global properties in noisy quantum systems.
  arXiv  Detail & Related papers  (2025-07-17T15:47:46Z)
• Shadow measurements for feedback-based quantum optimization [0.0]
  We present an implementation of the recently introduced Feedback-based algorithm for quantum optimization (FALQON) with the Ket quantum programming platform. We employ classical shadows for the feedback routine of parameter estimation and compare this approach with the direct estimation of observables. Our results show that depending on the graph geometry for the MaxCut problem, the number of measurements required to estimate expected values of observables with classical shadows can be up to 16 times lower than with direct observable estimation.
  arXiv  Detail & Related papers  (2025-02-27T18:36:30Z)
• Bounds in Wasserstein Distance for Locally Stationary Processes [0.29771206318712146]
  We introduce a novel conditional probability distribution estimator specifically tailored for locally stationary (LSP) data.<n>We rigorously establish convergence rates for the NW-based conditional probability estimator under the Wasserstein metric.<n>We conduct extensive numerical simulations on synthetic datasets and provide empirical validations using real-world data.
  arXiv  Detail & Related papers  (2024-12-04T15:51:22Z)
• Implementing transferable annealing protocols for combinatorial optimisation on neutral atom quantum processors: a case study on smart-charging of electric vehicles [1.53934570513443]
  In this paper, we build on the promising potential of parameter transferability across problem instances with similar local structures. Our study reveals that, for Maximum Independent Set problems on graph families with shared geometries, optimal parameters naturally concentrate. We apply this method to address a smart-charging optimisation problem on a real dataset.
  arXiv  Detail & Related papers  (2024-11-25T18:41:02Z)
• Auxiliary-free replica shadow estimation [9.129051558668854]
  We propose an efficient auxiliary-free replica shadow (AFRS) framework, which leverages the power of the joint entangling operation on a few input replicas. We rigorously prove that AFRS can offer exponential improvements in estimation accuracy compared with the conventional shadow method. We introduce an advanced local-AFRS variant tailored to estimating local observables with even constant-depth local quantum circuits.
  arXiv  Detail & Related papers  (2024-07-30T14:40:29Z)
• 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)
• Holographic Classical Shadow Tomography [1.9818805908789396]
  We introduce "holographic shadows", a new class of randomized measurement schemes for classical shadow tomography. "holographic shadows" achieves the optimal scaling of sample complexity for learning geometrically local Pauli operators at any length scale.
  arXiv  Detail & Related papers  (2024-06-17T17:40:59Z)
• Beyond Single-Model Views for Deep Learning: Optimization versus Generalizability of Stochastic Optimization Algorithms [13.134564730161983]
  This paper adopts a novel approach to deep learning optimization, focusing on gradient descent (SGD) and its variants. We show that SGD and its variants demonstrate performance on par with flat-minimas like SAM, albeit with half the gradient evaluations. Our study uncovers several key findings regarding the relationship between training loss and hold-out accuracy, as well as the comparable performance of SGD and noise-enabled variants.
  arXiv  Detail & Related papers  (2024-03-01T14:55:22Z)
• Distributed Markov Chain Monte Carlo Sampling based on the Alternating Direction Method of Multipliers [143.6249073384419]
  In this paper, we propose a distributed sampling scheme based on the alternating direction method of multipliers. We provide both theoretical guarantees of our algorithm's convergence and experimental evidence of its superiority to the state-of-the-art. In simulation, we deploy our algorithm on linear and logistic regression tasks and illustrate its fast convergence compared to existing gradient-based methods.
  arXiv  Detail & Related papers  (2024-01-29T02:08:40Z)
• Quantum Kernel t-Distributed Stochastic Neighbor Embedding [0.9002260638342727]
  We propose a quantum data visualization method using quantum kernels, which enables us to offer fast and highly accurate visualization of quantum states. In our numerical experiments, we visualize hand-written digits dataset and apply $k$-nearest neighbor algorithm to the low-dimensional data.
  arXiv  Detail & Related papers  (2023-12-01T05:00:02Z)
• Retrieving space-dependent polarization transformations via near-optimal quantum process tomography [55.41644538483948]
  We investigate the application of genetic and machine learning approaches to tomographic problems. We find that the neural network-based scheme provides a significant speed-up, that may be critical in applications requiring a characterization in real-time. We expect these results to lay the groundwork for the optimization of tomographic approaches in more general quantum processes.
  arXiv  Detail & Related papers  (2022-10-27T11:37:14Z)
• Optimization of Annealed Importance Sampling Hyperparameters [77.34726150561087]
  Annealed Importance Sampling (AIS) is a popular algorithm used to estimates the intractable marginal likelihood of deep generative models. We present a parameteric AIS process with flexible intermediary distributions and optimize the bridging distributions to use fewer number of steps for sampling. We assess the performance of our optimized AIS for marginal likelihood estimation of deep generative models and compare it to other estimators.
  arXiv  Detail & Related papers  (2022-09-27T07:58:25Z)
• The Probabilistic Normal Epipolar Constraint for Frame-To-Frame Rotation Optimization under Uncertain Feature Positions [53.478856119297284]
  We introduce the probabilistic normal epipolar constraint (PNEC) that overcomes the limitation by accounting for anisotropic and inhomogeneous uncertainties in the feature positions. In experiments on synthetic data, we demonstrate that the novel PNEC yields more accurate rotation estimates than the original NEC. We integrate the proposed method into a state-of-the-art monocular rotation-only odometry system and achieve consistently improved results for the real-world KITTI dataset.
  arXiv  Detail & Related papers  (2022-04-05T14:47:11Z)
• 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)
• Zeroth-Order Hybrid Gradient Descent: Towards A Principled Black-Box Optimization Framework [100.36569795440889]
  This work is on the iteration of zero-th-order (ZO) optimization which does not require first-order information. We show that with a graceful design in coordinate importance sampling, the proposed ZO optimization method is efficient both in terms of complexity as well as as function query cost.
  arXiv  Detail & Related papers  (2020-12-21T17:29:58Z)

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.