REVIEW 2 cited by
Towards Cosmological Simulations of Dark Matter on Quantum Computers
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
State-of-the-art cosmological simulations on classical computers are limited by time, energy, and memory usage. Quantum computers can perform some calculations exponentially faster than classical computers, using exponentially less energy and memory, and may enable extremely large simulations that accurately capture the whole dynamic range of structure in the Universe within statistically representative cosmic volumes. However, not all computational tasks exhibit a `quantum advantage'. Quantum circuits act linearly on quantum states, so nonlinearities (e.g. self-gravity in cosmological simulations) pose a significant challenge. Here we outline one potential approach to overcome this challenge and solve the (nonlinear) Schrodinger-Poisson equations for the evolution of self-gravitating dark matter, based on a hybrid quantum-classical variational algorithm framework (Lubasch 2020). We demonstrate the method with a proof-of-concept mock quantum simulation, envisioning a future where quantum computers will one day lead simulations of dark matter.
Forward citations
Cited by 2 Pith papers
-
Compressible Navier-Stokes Flow in Schr\"odinger-Type Variables
Isothermal compressible Navier–Stokes flow is rewritten exactly as coupled imaginary-time Schrödinger-type amplitude equations, with a mixed density-compressive amplitude closing the density sector.
-
Cosmo-SPINN: Fuzzy Dark Matter Simulations with Physics-Informed Generative Networks
Physics-informed generative U-Nets evolve and super-resolve fuzzy dark matter fields under Schrödinger–Poisson constraints with far less supervised data than pure data-driven baselines.
Discussion (0). Continue with ORCID to comment.