Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2105.13849

Quantum Computing for Inflationary, Dark Energy and Dark Matter Cosmology

Amy Joseph, Juan-Pablo Varela, Molly Watts, Tristen White, Feng, Yuan, Mohammad Hassan, Michael McGuigan

Published May 28, 2021• 5 citations
arXivHTMLPDF

Abstract

Cosmology is in an era of rapid discovery especially in areas related to dark energy, dark matter and inflation. Quantum cosmology treats the cosmology quantum mechanically and is important when quantum effects need to be accounted for, especially in the very early Universe. Quantum computing is an emerging new method of computing which excels in simulating quantum systems. Quantum computing may have some advantages when simulating quantum cosmology, especially because the Euclidean action of gravity is unbounded from below, making the implementation of Monte Carlo simulation problematic. In this paper we present several examples of the application of quantum computing to cosmology. These include a dark energy model that is related to Kaluza-Klein theory, dark matter models where the dark sector is described by a self interacting gauge field or a conformal scalar field and an inflationary model with a slow roll potential. We implement quantum computations in the IBM QISKit software framework and show how to apply the Variational Quantum Eigensolver (VQE) and Evolution of Hamiltonian (EOH) algorithms to solve the Wheeler-DeWitt equation that can be used to describe the cosmology in the mini-superspace approximation. We find excellent agreement with classical computing results and describe the accuracy of the different quantum algorithms. Finally we discuss how these methods can be scaled to larger problems going beyond the mini-superspace approximation where the quantum computer may exceed the performance of classical computation.

DOI
10.48550/arxiv.2105.13849

Related papers

Simulating 0+1 Dimensional Quantum Gravity on Quantum Computers: Mini-Superspace Quantum Cosmology and the World Line Approach in Quantum Field Theory

Charles D. Kocher, Michael McGuigan

Quantum computers are promising candidates to radically expand the domain of computational science by their increased computing power and more effective algorithms. In particular, quantum computing could have a tremendous impact on the field of quantum cosmology. The goal of quantum cosmology is to describe the evolution of the universe through the Wheeler-DeWitt equation or path integral methods without having to first formulate a full theory of quantum gravity. The quantum computer provides an advantage in this endeavor because it can perform path integrals directly in Lorentzian space and does not require constructing contour integrations in Euclidean gravity. Also, quantum computers can provide advantages in systems with fermions which are difficult to simulate on classical computers. In this study, we first employed classical computational methods to analyze a Friedmann-Robertson-Walker mini-superspace with a scalar field and visualize the calculated wavefunction of the universe for a variety of different values of the curvature of the universe and the cosmological constant. We then used IBM's Quantum Information Science Kit Python library and the variational quantum eigensolver algorithm to study the same systems on a quantum computer. The framework was extended to the world line approach to quantum field theory.

arXiv:1812.08107•New York Scientific Data Summit (NYSDS)•Aug 1, 2018•10 citations

Quantum computing for astrophysics and cosmology: Results from the INAF activities

Andrea A. Bulgarelli, C. Burigana, Luca Cappelli +15 more

Quantum computing is emerging as a promising tool for astrophysics and cosmology, with the potential to address computationally intensive problems more efficiently than classical approaches. In this review, we report recent advances from the INAF Spoke-10 initiative within the Italian National Research Center for High Performance Computing, Big Data and Quantum Computing (ICSC), focused on quantum algorithms and machine learning techniques for astronomical data analysis. We concentrate on two application areas: (1) quantum machine learning for high-energy transients, specifically the detection of Gamma-Ray Bursts (GRBs) with quantum deep-learning models; and (2) quantum algorithms for cosmology, including Quantum Markov Chain Monte Carlo and Quantum Genetic Algorithms, together with developments of Quantum Fourier Transform methods. Quantum machine learning models for GRB detection, such as autoencoders, are tested on simulated space telescope data, achieving performance comparable to classical deep learning methods and indicating potential benefits in data-limited or constrained scenarios. For cosmology, hybrid quantum–classical algorithms have been developed to determine best-fit parameters, sample posterior distributions for standard cosmological models, and perform Quantum Fast Fourier transforms for the Cosmic Microwave Background (CMB) radiation. These methods are validated on benchmark problems, providing results consistent with established classical methods. We discuss the implications for astrophysical and cosmological analysis. While the field is still in its early stages and no quantum advantage has yet been demonstrated in the presented problems, the progress summarized here highlights both the current capabilities of Noisy Intermediate-Scale Quantum (NISQ) devices and the open challenges. For quantum machine learning, we demonstrated that these algorithms are more effective when data is scarce or highly complex, which might hint at future quantum advantages. We outline future directions for integrating quantum processors into astronomical pipelines and the steps required to realize practical quantum advantages in data-intensive astrophysics and cosmology.

Astronomy and Computing•Mar 28, 2026•3 citations

Quantum variational solving of the Wheeler-DeWitt equation

Grzegorz Czelusta, Jakub Mielczarek A B

One of the central difficulties in the quantization of the gravitational interactions is that they are described by a set of constraints. The standard strategy for dealing with the problem is the Dirac quantization procedure, which leads to the Wheeler-DeWitt equation. However, solutions to the equation are known only for specific symmetry-reduced systems, including models of quantum cosmology. Novel methods, which enable solving the equation for complex gravitational configurations, are therefore worth seeking. Here, we propose and investigate a new method of solving the Wheeler-DeWitt equation for minisuperspace models (with a finite number of classical degrees of freedom). The approach employs variational quantum algorithms and is possible to implement on quantum computers. For this purpose, the gravitational system is regularized, by performing spherical compactification of the phase space. This makes the system's Hilbert space finite dimensional and allows to use $SU(2)$ variables, which are easy to handle in quantum computing. The validity of the method is examined in the case of the flat de Sitter universe. Both an emulator of a quantum computer and the IBM superconducting quantum computer have been used. The advantages and limitations of the approach are discussed.

arXiv:2111.03038•Physical review. D/Physical review. D.•Jun 2, 2022•4 citations

DEVELOPMENT OF ALGORITHMS AND SIMULATIONS FOR QUANTUM COMPUTERS AND THEIR POTENTIAL APPLICATIONS IN SOLVING QUANTUM PROBLEMS

K. Sabeeh, Gul Rahman

Quantum computing has emerged as a transformative paradigm capable of solving complex computational problems that are intractable for classical computers. Central to the advancement of this technology is the development of efficient quantum algorithms and high fidelity simulations that enable the design, testing, and optimization of quantum solutions before deployment on physical hardware. This study focuses on the design and implementation of quantum algorithms tailored for solving a variety of quantum problems, including quantum chemistry, optimization, and cryptography. Using state of the art simulation platforms such as Qiskit, Cirq, and Pennylane, algorithm performance was evaluated in terms of accuracy, execution time, scalability, and resilience to noise. Benchmarks demonstrate that algorithms such as the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) achieve significant speedups in problem specific domains, while hybrid quantum–classical methods provide robust pathways for near term quantum advantage. Simulation results reveal that algorithmic efficiency can be significantly improved through optimized circuit depth, qubit connectivity mapping, and advanced error mitigation techniques. The findings highlight the potential of simulation driven quantum algorithm development in accelerating the practical realization of quantum computing applications across disciplines such as materials discovery, molecular modeling, secure communications, and complex optimization tasks.

•Dec 1, 2025•0 citations

Quantum computing applications in cosmology

Cecilia Carmagnola

Quantum computing has become increasingly popular in recent years, since it has the potential to outperform classical computation, at least in specific tasks. In principle, this advantage could help many fields of physics research, such as cosmology. Numerical simulations of cosmological observables have become more and more complex and demanding in terms of resources. Quantum computers might help and this thesis is devoted to develop this idea within the NISQ era and its limitations. The work focuses both on introducing quantum algorithms in existing classical codes and on developing a hybrid code to simulate the evolution of DM. The first analysis substitutes the Fast Fourier Transform with the Quantum Fourier Transform to compute the matter power spectrum and shows that the current generation of quantum computers is not enough to produce physically relevant results. The second analysis considers the development of a hybrid classical-quantum code to solve Schr\"{o}dinger-Poisson equations in one dimension. Results in ideal simulators prove that the code can be used to find the correct solution, while real quantum computers allow recovering part of the expected signal only at the price of introducing approximations.

•Sep 24, 2026•0 citations

Quantum computation for early universe cosmology

Alexander Kaufman, Daniel Sundy, Michael McGuigan

With the emergence of quantum computing we can, in theory, run complex simulations with many variables. For the field of cosmology, this could lend itself to applications in modeling the early universe as a quantum system to better understand large scale properties of the universe today. Here we utilize the hybrid variational quantum eigensolver (VQE) algorithm applied to an anharmonic oscillator system using QISKit to examine it's effectiveness for these cosmological questions. We then analyze a 1+1 dimensional ring of scalar bosons acting on a lattice as a naive model of the early universe. We chose to focus on rings of 3 and 5 massive scalars in 1+1 dimensions for our study to test the effectiveness of our approach.

New York Scientific Data Summit (NYSDS)•Jun 1, 2019•2 citations
Cosmology is in an era of rapid discovery especially in areas related to dark energy, dark matter and inflation. Quantum cosmology treats the cosmology quantum mechanically and is important when quantum effects need to be accounted for, especially in the very early Universe. Quantum computing is an emerging new method of computing which excels in simulating quantum systems. Quantum computing may have some advantages when simulating quantum cosmology, especially because the Euclidean action of gravity is unbounded from below, making the implementation of Monte Carlo simulation problematic. In this paper we present several examples of the application of quantum computing to cosmology. These include a dark energy model that is related to Kaluza-Klein theory, dark matter models where the dark sector is described by a self interacting gauge field or a conformal scalar field and an inflationary model with a slow roll potential. We implement quantum computations in the IBM QISKit software framework and show how to apply the Variational Quantum Eigensolver (VQE) and Evolution of Hamiltonian (EOH) algorithms to solve the Wheeler-DeWitt equation that can be used to describe the cosmology in the mini-superspace approximation. We find excellent agreement with classical computing results and describe the accuracy of the different quantum algorithms. Finally we discuss how these methods can be scaled to larger problems going beyond the mini-superspace approximation where the quantum computer may exceed the performance of classical computation.
Quantum computers are promising candidates to radically expand the domain of computational science by their increased computing power and more effective algorithms. In particular, quantum computing could have a tremendous impact on the field of quantum cosmology. The goal of quantum cosmology is to describe the evolution of the universe through the Wheeler-DeWitt equation or path integral methods without having to first formulate a full theory of quantum gravity. The quantum computer provides an advantage in this endeavor because it can perform path integrals directly in Lorentzian space and does not require constructing contour integrations in Euclidean gravity. Also, quantum computers can provide advantages in systems with fermions which are difficult to simulate on classical computers. In this study, we first employed classical computational methods to analyze a Friedmann-Robertson-Walker mini-superspace with a scalar field and visualize the calculated wavefunction of the universe for a variety of different values of the curvature of the universe and the cosmological constant. We then used IBM's Quantum Information Science Kit Python library and the variational quantum eigensolver algorithm to study the same systems on a quantum computer. The framework was extended to the world line approach to quantum field theory.
Quantum computing is emerging as a promising tool for astrophysics and cosmology, with the potential to address computationally intensive problems more efficiently than classical approaches. In this review, we report recent advances from the INAF Spoke-10 initiative within the Italian National Research Center for High Performance Computing, Big Data and Quantum Computing (ICSC), focused on quantum algorithms and machine learning techniques for astronomical data analysis. We concentrate on two application areas: (1) quantum machine learning for high-energy transients, specifically the detection of Gamma-Ray Bursts (GRBs) with quantum deep-learning models; and (2) quantum algorithms for cosmology, including Quantum Markov Chain Monte Carlo and Quantum Genetic Algorithms, together with developments of Quantum Fourier Transform methods. Quantum machine learning models for GRB detection, such as autoencoders, are tested on simulated space telescope data, achieving performance comparable to classical deep learning methods and indicating potential benefits in data-limited or constrained scenarios. For cosmology, hybrid quantum–classical algorithms have been developed to determine best-fit parameters, sample posterior distributions for standard cosmological models, and perform Quantum Fast Fourier transforms for the Cosmic Microwave Background (CMB) radiation. These methods are validated on benchmark problems, providing results consistent with established classical methods. We discuss the implications for astrophysical and cosmological analysis. While the field is still in its early stages and no quantum advantage has yet been demonstrated in the presented problems, the progress summarized here highlights both the current capabilities of Noisy Intermediate-Scale Quantum (NISQ) devices and the open challenges. For quantum machine learning, we demonstrated that these algorithms are more effective when data is scarce or highly complex, which might hint at future quantum advantages. We outline future directions for integrating quantum processors into astronomical pipelines and the steps required to realize practical quantum advantages in data-intensive astrophysics and cosmology.
One of the central difficulties in the quantization of the gravitational interactions is that they are described by a set of constraints. The standard strategy for dealing with the problem is the Dirac quantization procedure, which leads to the Wheeler-DeWitt equation. However, solutions to the equation are known only for specific symmetry-reduced systems, including models of quantum cosmology. Novel methods, which enable solving the equation for complex gravitational configurations, are therefore worth seeking. Here, we propose and investigate a new method of solving the Wheeler-DeWitt equation for minisuperspace models (with a finite number of classical degrees of freedom). The approach employs variational quantum algorithms and is possible to implement on quantum computers. For this purpose, the gravitational system is regularized, by performing spherical compactification of the phase space. This makes the system's Hilbert space finite dimensional and allows to use SU(2)SU(2)SU(2) variables, which are easy to handle in quantum computing. The validity of the method is examined in the case of the flat de Sitter universe. Both an emulator of a quantum computer and the IBM superconducting quantum computer have been used. The advantages and limitations of the approach are discussed.
Quantum computing has emerged as a transformative paradigm capable of solving complex computational problems that are intractable for classical computers. Central to the advancement of this technology is the development of efficient quantum algorithms and high fidelity simulations that enable the design, testing, and optimization of quantum solutions before deployment on physical hardware. This study focuses on the design and implementation of quantum algorithms tailored for solving a variety of quantum problems, including quantum chemistry, optimization, and cryptography. Using state of the art simulation platforms such as Qiskit, Cirq, and Pennylane, algorithm performance was evaluated in terms of accuracy, execution time, scalability, and resilience to noise. Benchmarks demonstrate that algorithms such as the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA) achieve significant speedups in problem specific domains, while hybrid quantum–classical methods provide robust pathways for near term quantum advantage. Simulation results reveal that algorithmic efficiency can be significantly improved through optimized circuit depth, qubit connectivity mapping, and advanced error mitigation techniques. The findings highlight the potential of simulation driven quantum algorithm development in accelerating the practical realization of quantum computing applications across disciplines such as materials discovery, molecular modeling, secure communications, and complex optimization tasks.
Quantum computing has become increasingly popular in recent years, since it has the potential to outperform classical computation, at least in specific tasks. In principle, this advantage could help many fields of physics research, such as cosmology. Numerical simulations of cosmological observables have become more and more complex and demanding in terms of resources. Quantum computers might help and this thesis is devoted to develop this idea within the NISQ era and its limitations. The work focuses both on introducing quantum algorithms in existing classical codes and on developing a hybrid code to simulate the evolution of DM. The first analysis substitutes the Fast Fourier Transform with the Quantum Fourier Transform to compute the matter power spectrum and shows that the current generation of quantum computers is not enough to produce physically relevant results. The second analysis considers the development of a hybrid classical-quantum code to solve Schr\"{o}dinger-Poisson equations in one dimension. Results in ideal simulators prove that the code can be used to find the correct solution, while real quantum computers allow recovering part of the expected signal only at the price of introducing approximations.
With the emergence of quantum computing we can, in theory, run complex simulations with many variables. For the field of cosmology, this could lend itself to applications in modeling the early universe as a quantum system to better understand large scale properties of the universe today. Here we utilize the hybrid variational quantum eigensolver (VQE) algorithm applied to an anharmonic oscillator system using QISKit to examine it's effectiveness for these cosmological questions. We then analyze a 1+1 dimensional ring of scalar bosons acting on a lattice as a naive model of the early universe. We chose to focus on rings of 3 and 5 massive scalars in 1+1 dimensions for our study to test the effectiveness of our approach.