Pith. sign in

REVIEW 4 cited by

Finding Angles for Quantum Signal Processing with Machine Precision

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 2003.02831 v2 pith:GDZH4HTV submitted 2020-03-05 quant-ph

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

We describe an algorithm for finding angle sequences in quantum signal processing, with a novel component we call halving based on a new algebraic uniqueness theorem, and another we call capitalization. We present both theoretical and experimental results that demonstrate the performance of the new algorithm. In particular, these two algorithmic ideas allow us to find sequences of more than 3000 angles within 5 minutes for important applications such as Hamiltonian simulation, all in standard double precision arithmetic. This is native to almost all hardware.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 37 citations worldwide. Full citation record

  1. Simulation of Non-Hermitian Hamiltonians with Bivariate Quantum Signal Processing

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    Claims query-optimal bivariate-QSP simulation of non-Hermitian Hamiltonians, but the constructive angle-finding chain is circular and contradicted by the paper's own benchmarks.

  2. Near-Heisenberg-limited parallel amplitude estimation with logarithmic depth circuit

    quant-ph 2025-08 unverdicted novelty 7.0 of 10

    A tunable parallel amplitude estimation algorithm achieves near-Heisenberg query scaling and logarithmic depth via GHZ states and quantum signal processing, with a near-optimality proof using the parallel quantum adve...

  3. Fullqubit alchemist: Quantum algorithm for alchemical free energy calculations

    quant-ph 2025-08 conditional novelty 6.0 of 10

    A quantum algorithm for alchemical free energy calculations that block-encodes the Liouvillian to simulate molecular dynamics with polylogarithmic precision scaling, avoiding entropy estimation.

  4. Nuclear Many-Body Systems as Benchmarks for Quantum Computing

    quant-ph 2026-07 conditional novelty 5.0 of 10

    NuQuLib maps realistic nuclear Hamiltonians to qubit Hamiltonians and compares T-gate costs of QPE, QKrylov, and ODMD across valence and no-core model spaces.

Pith tools