Quantum Markov Chain Monte Carlo for Cosmological Functions

• URL: http://arxiv.org/abs/2509.09395v1
• Date: Thu, 11 Sep 2025 12:23:59 GMT
• Title: Quantum Markov Chain Monte Carlo for Cosmological Functions
• Authors: Giuseppe Sarracino, Vincenzo Fabrizio Cardone, Roberto Scaramella, Giuseppe Riccio, Andrea Bulgarelli, Carlo Burigana, Luca Cappelli, Stefano Cavuoti, Farida Farsian, Irene Graziotti, Massimo Meneghetti, Giuseppe Murante, Nicolò Parmiggiani, Alessandro Rizzo, Francesco Schillirò, Vincenzo Testa, Tiziana Trombetti,
• Abstract summary: We present an implementation of Quantum Computing for a Markov Chain Monte Carlo method.<n>The algorithm proposes new steps in the parameter space via a quantum circuit.<n>The proposed point is accepted or rejected via the classical Metropolis-Hastings acceptance method.
• Score: 27.301072183603207
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present an implementation of Quantum Computing for a Markov Chain Monte Carlo method with an application to cosmological functions, to derive posterior distributions from cosmological probes. The algorithm proposes new steps in the parameter space via a quantum circuit whose resulting statevector provides the components of the shift vector. The proposed point is accepted or rejected via the classical Metropolis-Hastings acceptance method. The advantage of this hybrid quantum approach is that the step size and direction change in a way independent of the evolution of the chain, thus ideally avoiding the presence of local minima. The results are consistent with analyses performed with classical methods, both for a test function and real cosmological data. The final goal is to generalize this algorithm to test its application to complex cosmological computations.

Related papers

• Classically Prepared, Quantumly Evolved: Hybrid Algorithm for Molecular Spectra [41.99844472131922]
  We introduce a hybrid classical-quantum algorithm to compute dynamical correlation functions and excitation spectra in many-body quantum systems.<n>The method combines classical preparation of a perturbed ground state with short-time quantum evolution of product states sampled from it.
  arXiv  Detail & Related papers  (2025-10-28T19:27:12Z)
• Molecular Properties in Quantum-Classical Auxiliary-Field Quantum Monte Carlo: Correlated Sampling with Application to Accurate Nuclear Forces [1.2189422792863451]
  We extend correlated sampling from classical auxiliary-field quantum Monte Carlo to the quantum-classical (QCAFQMC) framework.<n>We demonstrate significant improvements over single-reference methods in force evaluations for N$ wave$ and stretched linear H$_4$, particularly in strongly correlated regions.<n>We also apply our methodology to the MEA-CO$$ carbon capture reaction, employing quantum information metrics for active space selection and matchgate shadows.
  arXiv  Detail & Related papers  (2025-07-23T23:51:10Z)
• Quantum Markov chain Monte Carlo with programmable quantum simulators [0.0]
  We show how to address the conditions for ergodicity and sampling from distributions of quantum states using the Many-Body Localized phase.<n>The algorithm can be implemented on any quantum hardware capable of simulating the Floquet dynamics of a 1D Ising chain with nearest-neighbor interactions.
  arXiv  Detail & Related papers  (2025-05-27T14:37:35Z)
• Quantum Natural Stochastic Pairwise Coordinate Descent [13.986982036653632]
  Variational quantum algorithms, optimized using gradient-based methods, often exhibit sub-optimal convergence performance.<n>Quantum natural gradient descent (QNGD) is a more efficient method that incorporates the geometry of the state space via a quantum information metric.<n>We formulate a novel quantum information metric and construct an unbiased estimator for this metric using single-shot measurements.
  arXiv  Detail & Related papers  (2024-07-18T18:57:29Z)
• Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schr\"odinger Equation [56.9919517199927]
  "Wasserstein Quantum Monte Carlo" (WQMC) uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it. We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.
  arXiv  Detail & Related papers  (2023-07-06T17:54:08Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Implementation and Learning of Quantum Hidden Markov Models [0.0]
  We use the theory of quantum channels and open quantum systems to provide an efficient unitary characterization of a class of generators known as quantum hidden Markov models (QHMMs)<n>We prove that QHMMs are more compact and more expressive definitions of process languages compared to the equivalent classical hidden Markov models (HMMs)<n>We propose two practical learning algorithms for QHMMs.
  arXiv  Detail & Related papers  (2022-12-07T17:25:02Z)
• Markov Chain Monte-Carlo Enhanced Variational Quantum Algorithms [0.0]
  We introduce a variational quantum algorithm that uses Monte Carlo techniques to place analytic bounds on its time-complexity. We demonstrate both the effectiveness of our technique and the validity of our analysis through quantum circuit simulations for MaxCut instances.
  arXiv  Detail & Related papers  (2021-12-03T23:03:44Z)
• Quantum algorithm for stochastic optimal stopping problems with applications in finance [60.54699116238087]
  The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory. We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
  arXiv  Detail & Related papers  (2021-11-30T12:21:41Z)
• Sampling, rates, and reaction currents through reverse stochastic quantization on quantum computers [0.0]
  We show how to tackle the problem using a suitably quantum computer. We propose a hybrid quantum-classical sampling scheme to escape local minima.
  arXiv  Detail & Related papers  (2021-08-25T18:04:52Z)
• Bernstein-Greene-Kruskal approach for the quantum Vlasov equation [91.3755431537592]
  The one-dimensional stationary quantum Vlasov equation is analyzed using the energy as one of the dynamical variables. In the semiclassical case where quantum tunneling effects are small, an infinite series solution is developed.
  arXiv  Detail & Related papers  (2021-02-18T20:55:04Z)
• Sampling in Combinatorial Spaces with SurVAE Flow Augmented MCMC [83.48593305367523]
  Hybrid Monte Carlo is a powerful Markov Chain Monte Carlo method for sampling from complex continuous distributions. We introduce a new approach based on augmenting Monte Carlo methods with SurVAE Flows to sample from discrete distributions. We demonstrate the efficacy of our algorithm on a range of examples from statistics, computational physics and machine learning, and observe improvements compared to alternative algorithms.
  arXiv  Detail & Related papers  (2021-02-04T02:21:08Z)
• Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule [0.0]
  We study the problem of estimating the gradient of the function to be optimized directly from quantum measurements. We derive a mathematically exact formula that provides an algorithm for estimating the gradient of any multi-qubit parametric quantum evolution. Our algorithm continues to work, although with some approximations, even when all the available quantum gates are noisy.
  arXiv  Detail & Related papers  (2020-05-20T18:24:11Z)

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.