Pith. sign in

REVIEW 2 cited by

Quantum variational PDE solver with machine learning

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 2109.09216 v1 pith:XV46FP3W submitted 2021-09-19 quant-ph

classification quant-ph
keywords quantumsolutionsolversolutionssystemvariationaldifferentefficiently
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

To solve nonlinear partial differential equations (PDEs) is one of the most common but important tasks in not only basic sciences but also many practical industries. We here propose a quantum variational (QuVa) PDE solver with the aid of machine learning (ML) schemes to synergise two emerging technologies in mathematically hard problems. The core quantum processing in this solver is to calculate efficiently the expectation value of specially designed quantum operators. For a large quantum system, we only obtain data from measurements of few control qubits to avoid the exponential cost in the measurements of the whole quantum system and optimise a pathway to find possible solution sets of the desired PDEs using ML techniques. As an example, a few different types of the second-order DEs are examined with randomly chosen samples and a regression method is implemented to chase the best candidates of solution functions with another trial samples. We demonstrated that a three-qubit system successfully follows the pattern of analytical solutions of three different DEs with high fidelity since the variational solutions are given by a necessary condition to obtain the exact solution of the DEs. Thus, we believe that final solution candidate sets are efficiently extracted from the QuVa PDE solver with the support of ML techniques and this algorithm could be beneficial to search for the solutions of complex mathematical problems as well as to find good ansatzs for eigenstates in large quantum systems (e.g., for quantum chemistry).

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. Quantum Gravity Simulation: Quantum simulation with a minimum length based on the generalised uncertainty principle

    quant-ph 2026-07 reject novelty 4.0 of 10

    Grid discretization in qubit simulations generates a generalized uncertainty principle; matching high-energy momentum to special relativity implies a mass-dependent minimum position uncertainty.

  2. Relativistic Quantum Simulation under Periodic and Dirichlet Boundary Conditions: A First-Quantised Framework for Near-Term Devices

    quant-ph 2025-09 reject novelty 4.0 of 10

    A first-quantized quantum simulation framework approximates relativistic kinetic energy via a perturbative expansion of finite-difference momentum operators under periodic and Dirichlet boundary conditions.

Pith tools