REVIEW 11 cited by
Finding Angles for Quantum Signal Processing with Machine Precision
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
Finding Angles for Quantum Signal Processing with Machine Precision
read the original abstract
We describe an algorithm for finding angle sequences in quantum signal processing, with a novel component we call halving based on a new algebraic uniqueness theorem, and another we call capitalization. We present both theoretical and experimental results that demonstrate the performance of the new algorithm. In particular, these two algorithmic ideas allow us to find sequences of more than 3000 angles within 5 minutes for important applications such as Hamiltonian simulation, all in standard double precision arithmetic. This is native to almost all hardware.
Forward citations
Cited by 11 Pith papers
-
Analytical Angle-Finding and Series Expansions for Quantum Signal Processing via Orthogonal Polynomial Theory
Quantum signal processing angles admit closed-form expressions via orthogonal polynomial theory, allowing O(log(1/ε)) gate block-encodings of smooth functions through Hermite expansions and full characterization of SU...
-
The QAOA on the ring of disagrees
QAOA achieves the conjectured optimal (2p+1)/(2p+2) edge-cut fraction on cycle graphs at depth p by equivalence to Laurent polynomial optimization using quantum signal processing.
-
Analytic Approach to Quantum Control Using Quantum Signal Processing
Maps qubit-oscillator quantum control problems to QSP to enable analytical design of operators that suppress cross-Kerr effects and selectively address Fock states.
-
Quantum enhanced rare event discovery and sampling
A quantum algorithm discovers and samples rare events with optimal quantum scaling without prior knowledge of the events, yielding quadratic speedup for heavy-tailed systems and polynomial speedup for stationary processes.
-
Simulation of Non-Hermitian Hamiltonians with Bivariate Quantum Signal Processing
Bivariate quantum signal processing simulates non-Hermitian Hamiltonians H_eff = H_R + i H_I with query-optimal complexity O((α_R + β_I)T + log(1/ε)/log log(1/ε)) in the separate-oracle model.
-
Architecture Shape Governs QNN Trainability: Jacobian Null Space Growth and Parameter Efficiency
At fixed encoding budget, serial QNN architectures suffer unbounded structural gradient starvation via rank(J) ≤ 2L+1 while parallel ones keep full Jacobian rank and better parameter efficiency when adding feature-map layers.
-
Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra
Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedup...
-
Block-encodings as programming abstractions: The Eclipse Qrisp BlockEncoding Interface
The Eclipse Qrisp BlockEncoding interface provides high-level programming abstractions for block-encodings, enabling easier implementation of quantum algorithms such as QSVT, matrix inversion, and Hamiltonian simulation.
-
Near-Heisenberg-limited parallel amplitude estimation with logarithmic depth circuit
A tunable parallel amplitude estimation algorithm achieves near-Heisenberg query scaling and logarithmic depth via GHZ states and quantum signal processing, with a near-optimality proof using the parallel quantum adve...
-
Nuclear Many-Body Systems as Benchmarks for Quantum Computing
A unified workflow maps realistic nuclear Hamiltonians to qubit operators and benchmarks three quantum eigenvalue algorithms, finding T-gate counts of 10^10–10^14 for valence-space QPE at hundreds of qubits.
-
A Quantum Linear Systems Pathway for Solving Differential Equations
A quantum algorithm pathway using block encoding and QSVT to solve differential equations, with demonstrations on heat and Burgers' equations plus hardware resource estimates.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.