A dual Fourier-PSF and contour-PSF framework resolves the smoothness-sparsity trade-off for efficient quantum simulation of singular and holomorphic matrix functions.
https://arxiv.org/abs/2312.03916
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
Quantum circuit framework for advection-diffusion PDEs with Robin and periodic boundary conditions via LCHS, including LCU error analysis and gate complexity showing potential quantum advantage in high dimensions.
CBMD decomposes non-Hermitian operators via contour residues to enable optimal-query quantum simulation of first-order dynamics and special functions such as Bessel and Airy evolutions without requiring diagonalizability.
Schrödingerization-based quantum linear systems solver using LCHS and block preconditioning for near-optimal query complexity.
citing papers explorer
-
A Unified Poisson Summation Framework for Generalized Quantum Matrix Transformations
A dual Fourier-PSF and contour-PSF framework resolves the smoothness-sparsity trade-off for efficient quantum simulation of singular and holomorphic matrix functions.
-
Quantum circuits for the advection-diffusion equation with boundary conditions based on LCHS
Quantum circuit framework for advection-diffusion PDEs with Robin and periodic boundary conditions via LCHS, including LCU error analysis and gate complexity showing potential quantum advantage in high dimensions.
-
Quantum Simulation of Non-Hermitian Special Functions and Dynamics via Contour-based Matrix Decomposition
CBMD decomposes non-Hermitian operators via contour residues to enable optimal-query quantum simulation of first-order dynamics and special functions such as Bessel and Airy evolutions without requiring diagonalizability.
-
Schr\"odingerization for quantum linear systems problems with near-optimal dependence on matrix queries
Schrödingerization-based quantum linear systems solver using LCHS and block preconditioning for near-optimal query complexity.