pith. sign in

arxiv: 2002.11649 · v2 · pith:26ZM7OUNnew · submitted 2020-02-26 · 🪐 quant-ph · math.OC· physics.comp-ph

Efficient phase-factor evaluation in quantum signal processing

classification 🪐 quant-ph math.OCphysics.comp-ph
keywords quantumalgorithmfactorsphasepolynomialsaccuratelyarithmeticdegree
0
0 comments X
read the original abstract

Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in principle be obtained for a range of tasks, such as Hamiltonian simulation and the quantum linear system problem. A further benefit of QSP is that it uses a minimal number of ancilla qubits, which facilitates its implementation on near-to-intermediate term quantum architectures. However, there is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. Existing methods require the usage of variable precision arithmetic and can only be applied to polynomials of relatively low degree. We present here an optimization based method that can accurately compute the phase factors using standard double precision arithmetic operations. We demonstrate the performance of this approach with applications to Hamiltonian simulation, eigenvalue filtering, and the quantum linear system problems. Our numerical results show that the optimization algorithm can find phase factors to accurately approximate polynomials of degree larger than $10,000$ with error below $10^{-12}$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

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

  1. Explicit Quantum Circuit Simulation of Nonlinear 1-Dimensional Fluid with Carleman-linearized Boltzmann Method

    quant-ph 2026-06 unverdicted novelty 7.0

    Explicit quantum-circuit simulation of nonlinear 1D fluid via second-order Carleman-linearized Boltzmann equation and QSVD Taylor ODE solver, with logarithmic scaling analysis.

  2. Constrained Optimal Polynomials for Quantum Linear System Solvers

    math.NA 2026-04 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...

  3. Nonisothermal global-pressure exactness in fractured multiphase flow with aperture feedback

    physics.flu-dyn 2026-04 unverdicted novelty 7.0

    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...

  4. Nonisothermal global-pressure exactness in fractured multiphase flow with aperture feedback

    physics.flu-dyn 2026-04 conditional novelty 6.0

    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...

  5. Unitaria: Quantum Linear Algebra via Block Encodings

    quant-ph 2026-05 accept novelty 4.0

    Unitaria is a new open-source Python library that provides a high-level, composable interface for block encodings in quantum computing, enabling automatic circuit generation and classical simulation-based verification.