An efficient adaptive MCMC algorithm for pseudo-Bayesian quantum tomography

DOI10.1007/s00180-022-01264-xarXiv2106.00577OpenAlexW4286715987MaRDI QIDQ6177006

The Tien Mai

Publication date: 29 August 2023

Published in: Computational Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.00577

zbMATH Keywords

adaptive MCMCBayesian inferencesubsamplingquantum tomographylow-rank matrix

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal large-scale quantum state tomography with Pauli measurements
• Pseudo-Bayesian quantum tomography with rank-adaptation
• Quantum state estimation.
• Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity
• Reconstruction of quantum states of spin systems: From quantum Bayesian inference to quantum tomography
• Weak convergence and optimal scaling of random walk Metropolis algorithms
• 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation
• Inconsistency of Bayesian inference for misspecified linear models, and a proposal for repairing it
• Subsampling MCMC -- an introduction for the survey statistician
• Informed sub-sampling MCMC: approximate Bayesian inference for large datasets
• A Bayesian approach for noisy matrix completion: optimal rate under general sampling distribution
• Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels
• On the properties of variational approximations of Gibbs posteriors
• Quantum model averaging
• Optimal, reliable estimation of quantum states
• An Invitation to Quantum Tomography
• Bayesian inference for quantum state tomography
• Rank-based model selection for multiple ions quantum tomography
• Monte Carlo sampling from the quantum state space. II
• Spectral thresholding quantum tomography for low rank states
• Near-optimal quantum tomography: estimators and bounds
• Speeding Up MCMC by Efficient Data Subsampling
• Generating random density matrices
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• A General Framework for Updating Belief Distributions
• MCMC methods for functions: modifying old algorithms to make them faster

This page was built for publication: An efficient adaptive MCMC algorithm for pseudo-Bayesian quantum tomography