REVIEW 10 cited by
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
Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
read the original abstract
We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achieves the near optimal $\mathcal{\widetilde{O}}(d\kappa\log(1/\epsilon))$ query complexity for a $d$-sparse matrix, where $\kappa$ is the condition number, and $\epsilon$ is the desired precision. Neither algorithm uses phase estimation or amplitude amplification.
Forward citations
Cited by 10 Pith papers
-
Faster quantum linear system solver beyond the condition number
Two quantum linear system solvers are presented with query complexity independent of the condition number, scaling instead with an effective condition number or a solution-norm ratio.
-
Explicit Quantum Circuit Simulation of Nonlinear 1-Dimensional Fluid with Carleman-linearized Boltzmann Method
Explicit quantum-circuit simulation of nonlinear 1D fluid via second-order Carleman-linearized Boltzmann equation and QSVD Taylor ODE solver, with logarithmic scaling analysis.
-
Tightening energy-based boson truncation bound using Monte Carlo-assisted methods
Monte Carlo-assisted tightening of the energy-based boson truncation bound substantially reduces volume dependence in (1+1)D scalar field theory and (2+1)D U(1) gauge theory.
-
Tightening energy-based boson truncation bound using Monte Carlo-assisted methods
A Monte Carlo-assisted analytic method tightens energy-based bounds on boson truncation errors, substantially reducing the volume dependence of the required cutoff in scalar and gauge theories.
-
Constrained Optimal Polynomials for Quantum Linear System Solvers
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...
-
Nonisothermal global-pressure exactness in fractured multiphase flow with aperture feedback
A new mixed saturation-temperature compatibility condition is derived for exact global-pressure equivalence in nonisothermal multiphase fractured flow, with numerical benchmarks confirming regimes where exactness hold...
-
A shortcut to an optimal quantum linear system solver
The paper gives a QLSS with query complexity (1+O(ε))κ ln(2√2/ε) using one kernel reflection when ||x|| is known, or O(κ log(1/ε)) overall, with explicit bound 56κ + 1.05κ ln(1/ε).
-
Nonisothermal global-pressure exactness in fractured multiphase flow with aperture feedback
Constrained optimal polynomials (CUP and CAP) reduce quantum linear system solver errors under noise by jointly optimizing approximation accuracy and block-encoding normalization, outperforming standard QSVT and Cheby...
-
Tightening energy-based boson truncation bound using Monte Carlo-assisted methods
New analytic and Monte Carlo-assisted method tightens energy-based boson truncation bounds, reducing volume dependence in (1+1)D scalar and (2+1)D U(1) gauge theories.
-
Towards Classical Software Verification using Quantum Computers
The authors convert classical software bug detection into quantum optimization instances and test QAOA, Grover, and QSVT on small examples for potential polynomial speedup.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.