Scalable bayesian shadow tomography for quantum property estimation with set transformers
- URL: http://arxiv.org/abs/2509.18674v1
- Date: Tue, 23 Sep 2025 05:46:26 GMT
- Title: Scalable bayesian shadow tomography for quantum property estimation with set transformers
- Abstract summary: A scalable Bayesian machine learning framework is introduced for estimating scalar properties of an unknown quantum state from measurement data.<n>This work is the first to integrate the classical shadows protocol with a permutation-invariant set transformer architecture.<n>It achieves always lower mean squared error than classical shadows alone, with more than a 99% reduction in the few copy regime.
- Score: 5.1064573704995055
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: A scalable Bayesian machine learning framework is introduced for estimating scalar properties of an unknown quantum state from measurement data, which bypasses full density matrix reconstruction. This work is the first to integrate the classical shadows protocol with a permutation-invariant set transformer architecture, enabling the approach to predict and correct bias in existing estimators to approximate the true Bayesian posterior mean. Measurement outcomes are encoded as fixed-dimensional feature vectors, and the network outputs a residual correction to a baseline estimator. Scalability to large quantum systems is ensured by the polynomial dependence of input size on system size and number of measurements. On Greenberger-Horne-Zeilinger state fidelity and second-order R\'enyi entropy estimation tasks -- using random Pauli and random Clifford measurements -- this Bayesian estimator always achieves lower mean squared error than classical shadows alone, with more than a 99\% reduction in the few copy regime.
Related papers
- A Block Tensor Train Burer-Monteiro Framework for Low-Rank Quantum State Tomography [0.7349727826230862]
We propose a low-rank tensor-network framework for mixed-state quantum state tomography based on a block tensor train (Block-TT) factorization.<n>We develop single-site and two-site density matrix renormalization group (DMRG) algorithms for estimating quantum states from compressed measurements.<n>The framework is applicable to a broad class of low-rank quantum states, including pure states, nearly pure states, and ground states that admit accurate tensor-network approximations.
arXiv Detail & Related papers (2026-09-08T21:15:52Z) - Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
arXiv Detail & Related papers (2026-08-25T15:07:11Z) - Rank-Adaptive Matrix-Free Atomic Quantum State Tomography [28.619101416652395]
We develop a rank-adaptive matrix-free approach to low-rank quantum state tomography based on rank-one atomic coordinates.<n>The density operator is represented as a convex combination of pure-state atoms, which preserves positivity and unit trace while avoiding dense density, measurement, and gradient matrices.
arXiv Detail & Related papers (2026-07-21T21:08:08Z) - Fault tolerant computation of the static structure factor and finite size effects [43.936586633107396]
We develop a quantum post-processing strategy for the leading two-body finite-size correction.<n>After one-body shell effects are reduced by twist averaging, the dominant residual error is controlled by long-wavelength density fluctuations.<n>We also introduce adaptive global and local binary search procedures for identifying the infrared fitting window used to reconstruct the two-body finite size error correction.
arXiv Detail & Related papers (2026-06-26T05:31:08Z) - Machine learning-aided direct estimation of coherence and entanglement for unknown states [11.587753857811506]
We present a machine learning approach that directly estimates the coherence measures and the geometric measure of quantum entanglement.<n>The proposed technique provides a practical and scalable tool for characterizing quantum resources across computation, communication, and metrology applications.
arXiv Detail & Related papers (2026-01-08T14:26:50Z) - Large-scale implementation of quantum subspace expansion with classical shadows [0.5833117322405447]
We report the first large-scale implementation of quantum subspace expansion (QSE) with informationally complete (IC) measurements.<n>We observe accurate ground state energy recovery and mitigation of local order parameters across system sizes of up to 80 qubits.<n>This represents one of the most significant experimental realizations of classical shadows to date.
arXiv Detail & Related papers (2025-10-29T15:58: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) - Direct reconstruction of the quantum density matrix elements with classical shadow tomography [3.19428095493284]
We introduce a direct estimation framework for reconstructing multiple density matrix elements of an unknown quantum state using classical shadow tomography.<n>We prove that estimating (K) off-diagonal matrix elements up to additive error (epsilon) requires only (mathcalO(log K/epsilon2)) samples.<n>When extended to full state tomography, our method attains trace distance error (le epsilon) with sample complexity (mathcalO(d3 log d/
arXiv Detail & Related papers (2025-05-21T08:19:39Z) - Variation Due to Regularization Tractably Recovers Bayesian Deep Learning [44.16006844888796]
We propose an uncertainty quantification method for large networks based on variation due to regularization.<n>We show that regularization variation (RegVar) provides rigorous uncertainty estimates that, in the infinitesimal limit, exactly recover the Laplace approximation in Bayesian deep learning.<n>Our experiments across multiple datasets show that RegVar not only identifies uncertain predictions effectively but also provides insights into the stability of learned representations.
arXiv Detail & Related papers (2024-03-15T20:47:39Z) - Noise-aware variational eigensolvers: a dissipative route for lattice gauge theories [40.772310187078475]
We propose a novel variational ansatz for the ground-state preparation of the $mathbbZ$ lattice gauge theory (LGT) in quantum simulators.
It combines dissipative and unitary operations in a completely deterministic scheme with a circuit depth that does not scale with the size of the considered lattice.
We find that, with very few variational parameters, the ansatz can achieve $>!99%$ precision in energy in both the confined and deconfined phase of the $mathbbZ$ LGT.
arXiv Detail & Related papers (2023-08-07T14:23:00Z) - Randomized semi-quantum matrix processing [0.0]
We present a hybrid quantum-classical framework for simulating generic matrix functions.
The method is based on randomization over the Chebyshev approximation of the target function.
We prove advantages on average depths, including quadratic speed-ups on costly parameters.
arXiv Detail & Related papers (2023-07-21T18:00:28Z) - Bayesian Renormalization [68.8204255655161]
We present a fully information theoretic approach to renormalization inspired by Bayesian statistical inference.
The main insight of Bayesian Renormalization is that the Fisher metric defines a correlation length that plays the role of an emergent RG scale.
We provide insight into how the Bayesian Renormalization scheme relates to existing methods for data compression and data generation.
arXiv Detail & Related papers (2023-05-17T18:00:28Z) - Estimating many properties of a quantum state via quantum reservoir
processing [2.5432391525687748]
We propose a general framework for constructing classical approximations of arbitrary quantum states with quantum reservoirs.
A key advantage of our method is that only a single local measurement setting is required for estimating arbitrary properties.
This estimation scheme is extendable to higher-dimensional systems and hybrid systems with non-identical local dimensions.
arXiv Detail & Related papers (2023-05-11T15:21:21Z) - Regularized Vector Quantization for Tokenized Image Synthesis [126.96880843754066]
Quantizing images into discrete representations has been a fundamental problem in unified generative modeling.
deterministic quantization suffers from severe codebook collapse and misalignment with inference stage while quantization suffers from low codebook utilization and reconstruction objective.
This paper presents a regularized vector quantization framework that allows to mitigate perturbed above issues effectively by applying regularization from two perspectives.
arXiv Detail & Related papers (2023-03-11T15:20:54Z) - Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
We analyze and optimize an improved quantum algorithm for topological data analysis.
We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation.
We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
arXiv Detail & Related papers (2022-09-27T17:56:15Z) - Neural Jacobian Fields: Learning Intrinsic Mappings of Arbitrary Meshes [38.157373733083894]
This paper introduces a framework designed to accurately predict piecewise linear mappings of arbitrary meshes via a neural network.
The framework is based on reducing the neural aspect to a prediction of a matrix for a single point, conditioned on a global shape descriptor.
By operating in the intrinsic gradient domain of each individual mesh, it allows the framework to predict highly-accurate mappings.
arXiv Detail & Related papers (2022-05-05T19:51:13Z) - Efficient quantum state tomography with convolutional neural networks [0.0]
We develop a quantum state tomography scheme which relies on approxing the probability distribution over the outcomes of an informationally complete measurement.
It achieves a reduction of the estimation error of observables by up to an order of magnitude compared to their direct estimation from experimental data.
arXiv Detail & Related papers (2021-09-28T14:55:54Z) - Bosonic field digitization for quantum computers [62.997667081978825]
We address the representation of lattice bosonic fields in a discretized field amplitude basis.
We develop methods to predict error scaling and present efficient qubit implementation strategies.
arXiv Detail & Related papers (2021-08-24T15:30:04Z) - Unbiased Gradient Estimation for Variational Auto-Encoders using Coupled
Markov Chains [34.77971292478243]
The variational auto-encoder (VAE) is a deep latent variable model that has two neural networks in an autoencoder-like architecture.
We develop a training scheme for VAEs by introducing unbiased estimators of the log-likelihood gradient.
We show experimentally that VAEs fitted with unbiased estimators exhibit better predictive performance.
arXiv Detail & Related papers (2020-10-05T08:11:55Z) - Statistical Inference for Model Parameters in Stochastic Gradient
Descent [45.29532403359099]
gradient descent coefficients (SGD) has been widely used in statistical estimation for large-scale data due to its computational and memory efficiency.
We investigate the problem of statistical inference of true model parameters based on SGD when the population loss function is strongly convex and satisfies certain conditions.
arXiv Detail & Related papers (2016-10-27T07:04:21Z)
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.