Quantum circuits for the Metropolis-Hastings algorithm

DOI10.1088/1751-8121/AE8983MaRDI QIDQ7318701zbMATH OpenFDO

Authors Baptiste Claudon, Pablo Rodenas-Ruiz, Jean-Philip Piquemal, Pierre Monmarché

Publication date 25 August 2026

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1088/1751-8121/AE8983

Mathematics Subject Classification ID

Quantum theory (81-XX) Statistical mechanics, structure of matter (82-XX)

Cites work

• A Guide to Monte Carlo Simulations in Statistical Physics
• Efficient quantum circuits for diagonal unitaries without ancillas
• Efficient quantum circuits for Szegedy quantum walks
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• Monte Carlo sampling methods using Markov chains and their applications
• Optimization by simulated annealing
• Quantum computation and quantum information. 10th anniversary edition
• Quantum rejection sampling
• Quantum speed-up of Markov chain based algorithms
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm

This page was built for publication: Quantum circuits for the Metropolis-Hastings algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318701)