Pith. sign in

REVIEW 2 cited by

Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer

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 2106.16235 v2 pith:MBRO4PVH submitted 2021-06-30 quant-ph physics.chem-ph

classification quant-phphysics.chem-ph
keywords quantumcalculationsfermioniccarloconstrainedmanymany-electronmethods
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Many-electron problems pose some of the greatest challenges in computational science, with important applications across many fields of modern science. Fermionic quantum Monte Carlo (QMC) methods are among the most powerful approaches to these problems. However, they can be severely biased when controlling the fermionic sign problem using constraints, as is necessary for scalability. Here we propose an approach that combines constrained QMC with quantum computing tools to reduce such biases. We experimentally implement our scheme using up to 16 qubits in order to unbias constrained QMC calculations performed on chemical systems with as many as 120 orbitals. These experiments represent the largest chemistry simulations performed on quantum computers (more than doubling the size of prior electron correlation calculations), while obtaining accuracy competitive with state-of-the-art classical methods. Our results demonstrate a new paradigm of hybrid quantum-classical algorithm, surpassing the popular variational quantum eigensolver in terms of potential towards the first practical quantum advantage in ground state many-electron calculations.

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. Optimization by VarQITE on Adaptive Variational Quantum Kolmogorov-Arnold Network

    quant-ph 2025-06 conditional novelty 5.0 of 10

    Using variational quantum imaginary time evolution as a training rule can fit toy functions with a KAN-style quantum circuit, but classification performance remains worse than standard approaches.

  2. Strategic Plan for Neutral Atom Quantum Computation

    quant-ph 2026-07 conditional novelty 3.0 of 10

    If qubit-count growth (~1.8x/yr) and gate-error reduction (~0.62x/yr) continue, neutral-atom quantum computers could reach practical quantum advantage within a decade, this roadmap projects.

Pith tools