Pith. sign in

REVIEW 2 cited by

A Living Review of Quantum Computing for Plasma Physics

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

arxiv 2302.00001 v1 pith:IM33W5JD submitted 2023-01-27 physics.plasm-ph quant-ph

classification physics.plasm-phquant-ph
keywords computingplasmaquantumphysicsapplyingdevelopmentsdocumentlatest
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum Computing promises accelerated simulation of certain classes of problems, in particular in plasma physics. Given the nascent interest in applying quantum computing techniques to study plasma systems, a compendium of the relevant literature would be most useful. As a novel field, new results are common, and it is important for researchers to stay up-to-date on the latest developments. With this in mind, the goal of this document is to provide a regularly up-to-date and thorough list of citations for those developing and applying these quantum computing approaches to experimental or theoretical work in plasma physics. As a living document, it will be updated as often as possible to incorporate the latest developments. References are grouped by topic, both in itemized format and through the use of tags. We provide instructions on how to participate, and suggestions are welcome.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Solving the Nonlinear Vlasov Equation on a Quantum Computer

    quant-ph 2024-11 conditional novelty 6.0 of 10

    For a 1+1 dimensional Vlasov model with Krook collisions, a Carleman linearization quantum algorithm has polynomially worse complexity than classical finite difference methods and requires unphysically large collision...

  2. Numerical Solution Partial Differential Equations using the Discrete Fourier Transform

    math.NA 2024-12 unverdicted novelty 1.0 of 10

    A pedagogical demonstration that the FFT can solve classic 2D elliptic, parabolic, and hyperbolic PDEs, with examples and convergence checks.

Pith tools