Pith. sign in

REVIEW 5 cited by

Quantum Phase Estimation without Controlled Unitaries

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 2410.21517 v2 pith:ZXJ7JO5T submitted 2024-10-28 quant-ph

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

In this work we demonstrate the use of adapted classical phase retrieval algorithms to perform control-free quantum phase estimation. We eliminate the costly controlled time evolution and Hadamard test commonly required to access the complex time-series needed to reconstruct the spectrum. This significant reduction of the number of coherent controlled-operations lowers the circuit depth and considerably simplifies the implementation of statistical quantum phase estimation in near-term devices. This seemingly impossible task can be achieved by extending the problem that one wishes to solve to one with a larger set of input signals while exploiting natural constraints on the signal and/or the spectrum. We leverage well-established algorithms that are widely used in the context of classical signal processing, demonstrating two complementary methods to do this, vectorial phase retrieval and two-dimensional phase retrieval. We numerically investigate the feasibility of both approaches for estimating the spectrum of the Fermi-Hubbard model and discuss their resilience to inherent statistical noise.

Discussion (0). Sign in to comment.

Forward citations

Cited by 5 Pith papers

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

  1. Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group

    quant-ph 2025-09 conditional novelty 6.0 of 10

    The query complexity of estimating a function of an unknown unitary under average bias is Θ(Rep_ε(f)), where Rep_ε(f) measures the L2 tail of the function beyond degree 2m polynomials.

  2. Sandwich test for Quantum Phase Estimation

    quant-ph 2025-07 reject novelty 6.0 of 10

    The Sandwich test estimates <ψ|U^k|ψ> with total run time O(k^2 ln k / ε^2 s_min^6), skipping small-amplitude steps via a random binary sum tree, but the key assumption that s_min stays large is unproven.

  3. QB Ground State Energy Estimation Benchmark

    quant-ph 2025-08 conditional novelty 5.0 of 10

    A new ground-state energy estimation benchmark rates SHCI, DMRG, and double-factorized QPE, reporting near-universal SHCI solvability from an ML extrapolation that its own empirical table only partially supports.

  4. A Framework for Quantum Advantage

    quant-ph 2025-06 conditional novelty 4.0 of 10

    A framework defining quantum advantage as verifiable plus classically superior, with a conclusion that random circuit sampling is not yet a satisfactory path.

  5. Quantum Algorithm Software for Condensed Matter Physics

    cond-mat.str-el 2025-06 reject novelty 2.0 of 10

    A review of quantum algorithm software that advertises a benchmark suite, yet the body contains no benchmarks, data, or code.

Pith tools