pith. sign in

A polynomial quantum algorithm for approximating the

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it

citation-role summary

method 1

citation-polarity summary

years

2026 3

verdicts

UNVERDICTED 3

roles

method 1

polarities

use method 1

representative citing papers

Constrained Optimal Polynomials for Quantum Linear System Solvers

math.NA · 2026-04-22 · unverdicted · novelty 7.0

Constrained Uniform Polynomial (CUP) and Constrained Adaptive Polynomial (CAP) solvers achieve lower error than standard QSVT and Chebyshev methods in noise-limited regimes by optimizing accuracy versus block-encoding normalization under uniform or moment-based spectral models.

citing papers explorer

Showing 3 of 3 citing papers.

  • Hierarchical entanglement transitions and hidden area-law sectors in quantum many-body dynamics quant-ph · 2026-05-06 · unverdicted · none · ref 72

    Local quenches in chaotic quantum systems produce a Renyi-index-tuned hierarchy of entanglement transitions, with S_alpha>1 obeying area law while S_alpha<=1 is volume-law, carried by an O(1)-dimensional dominant Schmidt sector that itself exhibits similar transitions at lower critical indices.

  • Constrained Optimal Polynomials for Quantum Linear System Solvers math.NA · 2026-04-22 · unverdicted · none · ref 24

    Constrained Uniform Polynomial (CUP) and Constrained Adaptive Polynomial (CAP) solvers achieve lower error than standard QSVT and Chebyshev methods in noise-limited regimes by optimizing accuracy versus block-encoding normalization under uniform or moment-based spectral models.

  • Lower overhead fault-tolerant building blocks for noisy quantum computers quant-ph · 2026-05-12 · unverdicted · none · ref 210

    New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.