Models of quantum systems faithfully map system parameters to observations, but the inverse problem of parameter inference from measurement data presents a fundamental challenge: computationally intractable likelihoods due to an exponentially large Hilbert space. Here, we introduce simulation-based quantum system inference, a unified, likelihood-free framework that learns parameter posteriors directly from classical simulation data. The central idea is to pair polynomial-cost classical simulators, such as Pauli propagation and tensor networks, with normalizing flows or other neural density estimators for accurate, reusable inference. A single model, trained once, maps any new measurement record to its posterior in one forward pass---turning per-experiment inference into a fixed, up-front cost. We numerically demonstrate the framework's versatility across Pauli noise learning, quantum error mitigation, quantum state tomography, and Hamiltonian learning, with examples involving 81-qubit shallow circuits and 735-parameter inference. In each case, the approach yields accurate estimates of identifiable parameters, while posterior uncertainty provides additional diagnostics of non-identifiability and indicates where further characterization is needed. Our framework reduces data-acquisition requirements in quantum experiments and accelerates parameter inference, providing a practical route to characterizing and improving large-scale quantum systems.
AI Summary
The paper studies amortized Bayesian inference of quantum-system parameters from measurement observables without explicit likelihood evaluation. It pairs classically tractable forward simulators—Pauli propagation, matrix product states, and stabilizer simulation—with conditional normalizing flows trained on simulated parameter–observation pairs. A trained estimator generates approximate posterior samples for new observations without per-instance optimization; sequential refinement is also considered.
Numerical demonstrations cover noise learning, error mitigation, tomography, and Hamiltonian learning. For a 50-qubit shallow brickwall circuit with 735 two-qubit Pauli-error probabilities, an estimator trained on 30,000 simulations achieves $R^2=0.996$ on the 447 coefficients classified as gauge-free. Broad posteriors identify coefficients affected by composite-channel gauge ambiguity. Sequential-training budgets grow approximately linearly over 10–50 qubits. Inferred noise models give PEC and ZNE performance comparable to ground-truth models. A simulator-trained digital-twin denoiser reduces observable MAE by $5.3\times$ in 12-qubit Trotterized Ising dynamics, versus $2.1\times$ for quadratic ZNE. For a restricted 12-parameter family of 12-qubit pure states, median reconstruction infidelity reaches approximately $2\times10^{-3}$. Inferring 162 positional-displacement components in simulated $9\times9$ Rydberg arrays gives $R^2=0.983$ and MAE $12.2$ nm.
All demonstrations are simulation-based; experimental transfer remains unvalidated. Scalability depends on classically simulable structure or controlled approximations. Noise learning assumes ideal SPAM and single-qubit gates plus stationary Markovian Pauli noise; tomography is restricted to the chosen ansatz. The paper identifies simulator–device mismatch and posterior-uncertainty calibration as unresolved deployment issues. Amortized estimators are fixed-size and require substantial upfront simulation and training.
Little sign of AI-generated textAI use disclosedOverclaimsMissing comparisonStrong assumptions
Claude Opus 4.8 and ChatGPT 5.6 Sol were used to improve the readability of the manuscript and to suggest supplementary references, all of which were reviewed and verified by the authors.
Error found: The headline Pauli-noise and Rydberg inference accuracies are evaluated on simulated expectation values without a specified finite-shot measurement model.
The claimed reduction in experimental data acquisition is not established by a comparative quantum-measurement budget.
The approximately linear training-simulation scaling is demonstrated for observation-specific SNPE, not for the reusable amortized estimator.
The uncertainty demonstrations do not verify credible-region coverage, leaving posterior calibration unestablished.
The stated unweighted sequential-training objective generally learns the posterior under the accumulated proposal mixture rather than the original prior, undermining the Bayesian interpretation of the SNPE convergence and scaling results.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Models of quantum systems faithfully map system parameters to observations, but the inverse problem of parameter inference from measurement data presents a fundamental challenge: computationally intractable likelihoods due to an exponentially large Hilbert space. Here, we introduce simulation-based quantum system inference, a unified, likelihood-free framework that learns parameter posteriors directly from classical simulation data. The central idea is to pair polynomial-cost classical simulators, such as Pauli propagation and tensor networks, with normalizing flows or other neural density estimators for accurate, reusable inference. A single model, trained once, maps any new measurement record to its posterior in one forward pass---turning per-experiment inference into a fixed, up-front cost. We numerically demonstrate the framework's versatility across Pauli noise learning, quantum error mitigation, quantum state tomography, and Hamiltonian learning, with examples involving 81-qubit shallow circuits and 735-parameter inference. In each case, the approach yields accurate estimates of identifiable parameters, while posterior uncertainty provides additional diagnostics of non-identifiability and indicates where further characterization is needed. Our framework reduces data-acquisition requirements in quantum experiments and accelerates parameter inference, providing a practical route to characterizing and improving large-scale quantum systems.
The paper studies amortized Bayesian inference of quantum-system parameters from measurement observables without explicit likelihood evaluation. It pairs classically tractable forward simulators—Pauli propagation, matrix product states, and stabilizer simulation—with conditional normalizing flows trained on simulated parameter–observation pairs. A trained estimator generates approximate posterior samples for new observations without per-instance optimization; sequential refinement is also considered.
Numerical demonstrations cover noise learning, error mitigation, tomography, and Hamiltonian learning. For a 50-qubit shallow brickwall circuit with 735 two-qubit Pauli-error probabilities, an estimator trained on 30,000 simulations achieves R2=0.996 on the 447 coefficients classified as gauge-free. Broad posteriors identify coefficients affected by composite-channel gauge ambiguity. Sequential-training budgets grow approximately linearly over 10–50 qubits. Inferred noise models give PEC and ZNE performance comparable to ground-truth models. A simulator-trained digital-twin denoiser reduces observable MAE by 5.3× in 12-qubit Trotterized Ising dynamics, versus 2.1× for quadratic ZNE. For a restricted 12-parameter family of 12-qubit pure states, median reconstruction infidelity reaches approximately 2×10−3. Inferring 162 positional-displacement components in simulated 9×9 Rydberg arrays gives R2=0.983 and MAE 12.2 nm.
All demonstrations are simulation-based; experimental transfer remains unvalidated. Scalability depends on classically simulable structure or controlled approximations. Noise learning assumes ideal SPAM and single-qubit gates plus stationary Markovian Pauli noise; tomography is restricted to the chosen ansatz. The paper identifies simulator–device mismatch and posterior-uncertainty calibration as unresolved deployment issues. Amortized estimators are fixed-size and require substantial upfront simulation and training.
Quantum computers can efficiently sample from probability distributions that are believed to be classically intractable, providing a foundation for quantum generative modeling. However, practical training of such models remains challenging, as gradient evaluation via the parameter-shift rule scales linearly with the number of parameters and requires repeated expectation-value estimation under finite-shot noise. We introduce a training framework that extends the principle of contrastive divergence to quantum models. By deriving the circuit structure and providing a general recipe for constructing it, we obtain quantum circuits that generate the samples required for parameter updates, yielding constant scaling with respect to the cost of a forward pass, analogous to backpropagation in classical neural networks. Numerical results demonstrate that it attains comparable accuracy to likelihood-based optimization while requiring substantially fewer samples. The framework thereby establishes a scalable route to training expressive quantum generative models directly on quantum hardware.
To extract complete information about experimental noisy quantum states, as well as correlations among different physical parameters, we develop an efficient machine learning-assisted framework with the normalizing flow based Bayesian parameter estimation (BPE). By embedding a physically interpretable parameter vector, s, into the quantum state ansatzes, ρ(s), the corresponding parameter distribution p(s∣D) is induced from BPE, based on the available experimental data D. The BPE allows us to perform parameter correlation analyses, providing powerful insights about how experimental parameters and related noise sources affect quantum features of the system. As an example, the flexibility of our framework is demonstrated using two different physical ansatzes on the optical cat state experiments, where a noisy single-photon state is added to impure squeezed state. With correlations among the Wigner function negativity, photon-addition fraction, noisy fraction, and pump powers, our framework gives interpretations for complicated experimental mechanisms in generating noisy non-Gaussian states. By leveraging normalizing flow-based neural networks and Bayesian uncertainty estimation, along with physical and experimental constraints incorporated naturally, the valuable information inferred in the posterior learning provides guidelines for experimentalists, as well as theorists, in identifying promising parameters to enhance desirable features.
The advancement and scaling of quantum technology has made the learning and identification of quantum systems and devices in highly multidimensional parameter spaces a pressing task for a variety of applications. In many cases, the integration of real-time feedback control and adaptive choice of measurement settings places strict demands on the speed of this task. Here we present a joint model selection and parameter estimation algorithm that is fast and operable on a large number of model parameters. The algorithm is based on variational Bayesian inference, which approximates the target posterior distribution by optimizing a tractable family of distributions, making it more scalable than exact inference methods relying on sampling and that generally suffer from high variance and computational cost in high-dimensional spaces. We show how a regularizing prior can be used to select between competing models, each comprising a different number of parameters, identifying the simplest model that explains the experimental data. The regularization can further separate the degrees of freedom, e.g., quantum systems in the environment or processes, which contribute to major features in the observed dynamics, with respect to others featuring small coupling, which only contribute to a background. As an application of the introduced framework, we consider the problem of the identification of multiple individual nuclear spins with a single electron spin quantum sensor, relevant for nanoscale nuclear magnetic resonance and for the implementation of multiqubit quantum networking nodes. With the number of environmental spins unknown a priori, our Bayesian approach is able to correctly identify the model, i.e., the number of spins and their couplings. We benchmark the algorithm on both simulated and experimental data, using standard figures of merit, and demonstrate that we can estimate dozens of parameters within minutes. Our methodology is compatible with the implementation of real-time adaptive choice of experimental settings in multiparameter estimation, which has the potential to greatly decrease the estimation time in a variety of metrology, tomography, and characterization tasks by prioritizing the measurements with the highest content of information.
Quantum neural networks generalize classical artificial neural networks into the quantum domain. They are formulated as parameterized quantum circuits which are optimized by measuring and minimizing a suitably chosen loss function. The core challenge in understanding, implementing and ultimately using quantum neural networks is that they represent many-body systems with an exponentially large Hilbert space, in combination with a large parameter search space. Moreover, noise -- which is inherent to any quantum measurement -- sets practical limits for the estimation of training loss. Here, we study physics-informed large-scale quantum neural networks that are trained through a finite number of noisy loss function measurements. We show that this architecture permits the construction of nontrivial decision boundaries that enable the classification of quantum states through measuring an order parameter. Our approach can directly process quantum data that is output from quantum simulators and computers and is well suited for implementation on current hardware. Moreover, owed to a close link between the neural network dynamics and the evolution of Markovian open many-body quantum systems, one may expect a certain robustness to noise, which is ubiquitous in the current NISQ era.
High-dimensional regression problems, prevalent in diverse fields like genomics, finance, and medical diagnostics, pose a significant challenge to classical Bayesian inference. The computational cost of calculating posterior distributions often scales exponentially with the number of parameters, rendering many real-world applications intractable. This paper introduces a novel Bayesian inference algorithm inspired by the principles of quantum mechanics, specifically superposition and interference. We represent the prior distribution as a superposition of states, allowing for simultaneous exploration of the entire parameter space. Inference is then performed through a "quantum-inspired" sampling process that mimics the probabilistic nature of quantum measurements. This approach offers a potential pathway to circumvent the computational bottlenecks inherent in traditional Bayesian methods, particularly in the context of high-dimensional data. We outline the key components of the algorithm, provide a theoretical framework, and discuss its potential advantages and limitations. The core of the method lies in effectively harnessing the parallel exploration capability suggested by quantum mechanics to drastically reduce the computational burden associated with estimating the posterior distribution.
Readout errors are a major bottleneck to extracting reliable information from near-term quantum processors, especially when spatial correlations are non-negligible. We present a unified tensor-network framework that models the readout process as a matrix product operator (MPO), enabling efficient characterization and mitigation beyond uncorrelated approximations. The MPO model is trained via likelihood optimization on calibration data and applies to multiple tasks, including nonlocal observable estimation, random circuit sampling, and random-measurement protocols, such as classical shadows and learning-based tomography. Experiments on a superconducting processor and numerical simulations up to 20 qubits show that the MPO model captures correlated readout errors that uncorrelated models miss, with a sample cost that grows only near-linearly with system size. When extended to two-dimensional systems, the framework can also be integrated with tensor-network quantum error-correction decoders by performing joint inference over data and readout errors. These results establish tensor-network readout error mitigation as a scalable and versatile approach for noise-aware quantum data processing.