Robustness of Quantum Signal Processing and Resource-aware Polynomial Design
quant-ph
Submitted: 2026-10-02
Updated: 2026-10-02
Comments: Preliminary version submitted to QIP
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Hamiltonian Simulation by Qubitization
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- A Grand Unification of Quantum Algorithms
- Fourier-based quantum signal processing
- Improving quantum linear system solvers via a gradient descent perspective
- Matrix inversion polynomials for the quantum singular value transformation
- Haagerup tensor products and Schur multipliers
- Optimal ancilla-free Clifford+T approximation of z-rotations
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians