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:2410.22485

Quantum Cosmology on Quantum Computer

Wang, Chih-Chien Erich, Jiun-Huei Proty Wu

Published Oct 29, 2024• 2 citations
arXivHTMLPDF

Abstract

With physical quantum computers becoming increasingly accessible, research on their applications across various fields has advanced rapidly. In this paper, we present the first study of quantum cosmology conducted on physical quantum computers, employing a newly proposed Hybrid Quantum-Classical (HQC) algorithm rather than the commonly used Variational Quantum Eigensolver (VQE). Specifically, we solve a constrained Hamiltonian equation derived by quantizing the Friedmann equation in cosmology. To solve this constraint equation, H |psi> = 0, where H is a Hamiltonian operator and |psi> = |psi(theta)> is the wave function of phase angle theta describing the cosmic quantum state, we iteratively use the quantum computer to compute the eigenvalues of , while a classical computer manages the underlying probability density function within the Probabilistic Bisection Algorithm (PBA) to update theta until the solution of = 0 is achieved to a desired accuracy. Executing our algorithm on IBM's quantum computers, we attain a high-precision solution for theta, achieving approximately 1 percent error.

DOI
10.48550/arxiv.2410.22485

Related papers

Quantum Computing for Inflationary, Dark Energy and Dark Matter Cosmology

Amy Joseph, Juan-Pablo Varela, Molly Watts +4 more

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.

arXiv:2105.13849•May 28, 2021•5 citations

Quantum Simulation of Hawking Radiation Using VQE Algorithm on IBM Quantum Computer

Ritu Dhaulakhandi, Bikash K. Behera

Quantum computers have an exponential speed-up advantage over classical computers. One of the most prominent utilities of quantum computers is their ability to study complex quantum systems in various fields using quantum computational algorithms. Quantum computational algorithms can be used to study cosmological systems and how they behave with variations in the different parameters of the system. Here, we use the variational quantum eigensolver (VQE) algorithm to simulate the Hawking radiation phenomenon. VQE algorithm is a combination of quantum and classical computation methods used to obtain the minimum energy eigenvalue for a given Hamiltonian. Three different custom ansatzes are used in the VQE algorithm from which the results for the case with minimum errors are studied. We obtain the plots for temperature and power from the minimum energy eigenvalue recorded for different values of mass and distance from the center of the black hole. The final result is then analyzed and compared against already existing data on Hawking radiation.

arXiv:2112.15508•Dec 31, 2021•1 citation

Solving constrained optimization problems via the variational quantum eigensolver with constraints

Thinh Viet Le, Vassilis Kekatos

Variational quantum approaches have shown great promise in finding near-optimal solutions to computationally challenging tasks, including solving optimization problems. Nonetheless, optimization problems with constraints may not have been handled in a disciplined fashion thus far. To address this gap, this work proposes a hybrid quantum-classical algorithmic paradigm termed the variational quantum eigensolver with constraints (VQEC) that extends the celebrated VQE to handle optimization with constraints. As with the standard VQE, the vector of optimization variables is captured by the state of a variational quantum circuit (VQC). To deal with constraints, VQEC optimizes a Lagrangian function classically over both the VQC parameters as well as the dual variables associated with constraints. To comply with the quantum setup, variables are updated via a perturbed primal-dual method leveraging the parameter shift rule. Among a wide gamut of potential applications, we showcase how VQEC can approximately solve quadratically constrained binary optimization problems, find stochastic binary policies satisfying quadratic constraints on the average and in probability, and solve large-scale linear programs over the probability simplex. Under an assumption on the error for the VQC to approximate an arbitrary probability mass function, we provide bounds on the optimality gap attained by a VQC. Numerical tests on a quantum simulator investigate the effect of various parameters and corroborate that VQEC can generate high-quality solutions.

arXiv:2311.08502•Physical Review A•Aug 20, 2024•29 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

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

Variational quantum eigensolver approach to prime factorization on IBM's noisy intermediate scale quantum computer

Mona Sobhani, Yahui Chai, Tobias Hartung +1 more

This paper presents a hybrid quantum-classical approach to prime factorization. The proposed algorithm is based on the variational quantum eigensolver (VQE), which employs a classical optimizer to find the ground state of a given Hamiltonian. A numerical study is presented, evaluating the performance of the proposed method across various instances on both IBM's real quantum computer and its classical simulator. The results demonstrate that the method is capable of successfully factorizing numbers up to 253 on a real quantum computer and up to 1 048 561 on a classical simulator. These findings show the potential of the approach for practical applications on near-term quantum computers.

arXiv:2410.01935•Physical Review A•Apr 8, 2025•8 citations
With physical quantum computers becoming increasingly accessible, research on their applications across various fields has advanced rapidly. In this paper, we present the first study of quantum cosmology conducted on physical quantum computers, employing a newly proposed Hybrid Quantum-Classical (HQC) algorithm rather than the commonly used Variational Quantum Eigensolver (VQE). Specifically, we solve a constrained Hamiltonian equation derived by quantizing the Friedmann equation in cosmology. To solve this constraint equation, H |psi> = 0, where H is a Hamiltonian operator and |psi> = |psi(theta)> is the wave function of phase angle theta describing the cosmic quantum state, we iteratively use the quantum computer to compute the eigenvalues of , while a classical computer manages the underlying probability density function within the Probabilistic Bisection Algorithm (PBA) to update theta until the solution of = 0 is achieved to a desired accuracy. Executing our algorithm on IBM's quantum computers, we attain a high-precision solution for theta, achieving approximately 1 percent error.
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 have an exponential speed-up advantage over classical computers. One of the most prominent utilities of quantum computers is their ability to study complex quantum systems in various fields using quantum computational algorithms. Quantum computational algorithms can be used to study cosmological systems and how they behave with variations in the different parameters of the system. Here, we use the variational quantum eigensolver (VQE) algorithm to simulate the Hawking radiation phenomenon. VQE algorithm is a combination of quantum and classical computation methods used to obtain the minimum energy eigenvalue for a given Hamiltonian. Three different custom ansatzes are used in the VQE algorithm from which the results for the case with minimum errors are studied. We obtain the plots for temperature and power from the minimum energy eigenvalue recorded for different values of mass and distance from the center of the black hole. The final result is then analyzed and compared against already existing data on Hawking radiation.
Variational quantum approaches have shown great promise in finding near-optimal solutions to computationally challenging tasks, including solving optimization problems. Nonetheless, optimization problems with constraints may not have been handled in a disciplined fashion thus far. To address this gap, this work proposes a hybrid quantum-classical algorithmic paradigm termed the variational quantum eigensolver with constraints (VQEC) that extends the celebrated VQE to handle optimization with constraints. As with the standard VQE, the vector of optimization variables is captured by the state of a variational quantum circuit (VQC). To deal with constraints, VQEC optimizes a Lagrangian function classically over both the VQC parameters as well as the dual variables associated with constraints. To comply with the quantum setup, variables are updated via a perturbed primal-dual method leveraging the parameter shift rule. Among a wide gamut of potential applications, we showcase how VQEC can approximately solve quadratically constrained binary optimization problems, find stochastic binary policies satisfying quadratic constraints on the average and in probability, and solve large-scale linear programs over the probability simplex. Under an assumption on the error for the VQC to approximate an arbitrary probability mass function, we provide bounds on the optimality gap attained by a VQC. Numerical tests on a quantum simulator investigate the effect of various parameters and corroborate that VQEC can generate high-quality solutions.
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.
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.
This paper presents a hybrid quantum-classical approach to prime factorization. The proposed algorithm is based on the variational quantum eigensolver (VQE), which employs a classical optimizer to find the ground state of a given Hamiltonian. A numerical study is presented, evaluating the performance of the proposed method across various instances on both IBM's real quantum computer and its classical simulator. The results demonstrate that the method is capable of successfully factorizing numbers up to 253 on a real quantum computer and up to 1 048 561 on a classical simulator. These findings show the potential of the approach for practical applications on near-term quantum computers.