Quantum Cosmology on Quantum Computer

• URL: http://arxiv.org/abs/2410.22485v1
• Date: Tue, 29 Oct 2024 19:21:25 GMT
• Title: Quantum Cosmology on Quantum Computer
• Authors: Chih-Chien Erich Wang, Jiun-Huei Proty Wu,
• Abstract summary: We present the first study of quantum cosmology conducted on physical quantum computers. We employ a newly proposed Hybrid Quantum-Classical (HQC) algorithm rather than the commonly used Variational Quantum Eigensolver (VQE)
• Score: 0.0
• License:
• 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 <psi | H | psi>, while a classical computer manages the underlying probability density function within the Probabilistic Bisection Algorithm (PBA) to update theta until the solution of <psi | H | psi> = 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.

Related papers

• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Quantum Computing and the Riemann Hypothesis [0.0]
  Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms. We show how to obtain functions as states in supersymmetric quantum mechanics.
  arXiv  Detail & Related papers  (2023-03-07T04:28:54Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• An Introduction to Quantum Machine Learning for Engineers [36.18344598412261]
  Quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers. This book provides a self-contained introduction to quantum machine learning for an audience of engineers with a background in probability and linear algebra.
  arXiv  Detail & Related papers  (2022-05-11T12:10:52Z)
• Quantum Simulation of Hawking Radiation Using VQE Algorithm on IBM Quantum Computer [0.0]
  We use variational quantum eigensolver (VQE) algorithm to simulate Hawking radiation phenomenon. Three different custom ansatzes are used in the VQE algorithm from which the results for the case with minimum errors are studied.
  arXiv  Detail & Related papers  (2021-12-31T15:03:17Z)
• Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture [0.0]
  We show that the Quantum Singular Value Transformation can be efficiently "dequantized" We show that with inverse-polynomial precision, the same problem becomes BQP-complete. We also discuss how this dequantization technique may help make progress on the central quantum PCP.
  arXiv  Detail & Related papers  (2021-11-17T12:50:13Z)
• Quantum Computing for Inflationary, Dark Energy and Dark Matter Cosmology [1.1706540832106251]
  Quantum computing is an emerging new method of computing which excels in simulating quantum systems. We show how to apply the Variational Quantum Eigensolver (VQE) and Evolution of Hamiltonian (EOH) algorithms to solve the Wheeler-DeWitt equation. We find excellent agreement with classical computing results and describe the accuracy of the different quantum algorithms.
  arXiv  Detail & Related papers  (2021-05-28T14:04:11Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• Density functionals and Kohn-Sham potentials with minimal wavefunction preparations on a quantum computer [0.0]
  One of the potential applications of a quantum computer is solving quantum chemical systems. We demonstrate a method for obtaining the exact functional as a machine learned model from a sufficiently powerful quantum computer.
  arXiv  Detail & Related papers  (2020-08-12T22:50:39Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.