Pith. sign in

REVIEW 1 cited by

A randomized quantum algorithm for statistical phase estimation

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2110.12071 v2 pith:VBDXS2AO submitted 2021-10-22 quant-ph cs.DS

Kianna Wan , Mario Berta , Earl T. Campbell This is my paper · ORCID
classification quant-phcs.DS
keywords algorithmestimationphasehamiltonianquantumrandomizedanalyseapproaches
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Phase estimation is a quantum algorithm for measuring the eigenvalues of a Hamiltonian. We propose and rigorously analyse a randomized phase estimation algorithm with two distinctive features. First, our algorithm has complexity independent of the number of terms L in the Hamiltonian. Second, unlike previous L-independent approaches, such as those based on qDRIFT, all sources of error in our algorithm can be suppressed by collecting more data samples, without increasing the circuit depth.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. The Practicality of Randomized Quantum Linear Systems Solvers

    quant-ph 2025-10 conditional novelty 6.0 of 10

    A randomized Fourier-series quantum linear-systems solver needs on the order of 10^15 non-Clifford gates even for a 4×4 matrix with condition number 100, making the scheme impractical despite formally bounded errors.

Pith tools