# Demonstration of Minisuperspace Quantum Cosmology Using Quantum Computational Algorithms on IBM Quantum Computer

Source: [Demonstration of Minisuperspace Quantum Cosmology Using Quantum Computational Algorithms on IBM Quantum Computer](<https://www.sota2.com/research/paper/68fa3b081e209131ce8cf700>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T00:23:50.854Z

Authors: Anirban Ganguly, Bikash K. Behera, Prasanta K. Panigrahi

Published: 2019-12-01T01:42:56.000Z

## Abstract

Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. Quantum computational algorithms have the potential to be an exciting new way of studying quantum cosmology. In quantum cosmology, we learn about the dynamics of the universe without constructing a complete theory of quantum gravity. Since the universal wavefunction exists in an infinite-dimensional superspace over all possible 3D metrics and modes of matter configurations, we take minisuperspaces for our work by constraining the degrees of freedom to particular 3D metrics and uniform scalar field configurations. Here, we consider a wide variety of cosmological models. We begin by analyzing an anisotropic universe with cosmological constant and classical radiation. We then study the results for higher derivatives, Kaluza-Klein theories and string dilaton in quantum cosmology. We use IBM's Quantum Information Science Kit (QISKit) python library and the Variational Quantum Eigensolver (VQE) algorithm for studying these systems. The VQE algorithm is a hybrid algorithm that uses the variational approach and interleaves quantum and classical computations in order to find the minimum eigenvalue of the Hamiltonian for a given system.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1912.00298>)

[PDF](<https://arxiv.org/pdf/1912.00298.pdf>)
