Quantum algorithm block-encodes Riccati solutions for m-particle m-hole RPA using Riesz projectors and QSVT, claiming linear system-size scaling under sparsity and polynomial cost in excitation rank m.
Higham,Functions of Matrices: Theory and Computation, Society for Industrial and Applied Mathematics, Philadelphia (2008), 10.1137/1.9780898717778
13 Pith papers cite this work. Polarity classification is still indexing.
13
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
A forward-only Lanczos gradient approximation for Hermitian matrix function bilinear forms whose error scales with the same residual norm as the forward approximation and appears stable without reorthogonalization.
A square root form of the second-order covariance update is presented for the first time, improving numerical accuracy and efficiency in recursive estimation algorithms.
Develops finite-dimensional approximations to push-forwards on locally analytic functionals with explicit error bounds from Hankel moment matrices and proves convergence for data-driven recovery of analytic vector fields from flow map data.
Muon does not converge on convex Lipschitz functions regardless of learning rate, while error feedback restores theoretical convergence but degrades performance on CIFAR-10 and nanoGPT tasks.
Augmented Krylov subspaces jointly approximate quadratic forms and log-dets for faster MLE-based hyperparameter tuning in kernel-based linear system identification.
Develops mixed-precision iterative refinement for low-rank Lyapunov equations with rounding error analysis enabling reduced precision for moderately conditioned problems.
New dimension and model reduction techniques for linear Bayesian inverse problems with rank-deficient priors, with approximation guarantees and efficiency demonstrations for high-dimensional inference.
Decoupling local and synchronization transitions yields a linearly convergent MTTA algorithm that is accelerated to quadratic convergence and represented in tensor-train format, enabling computation on systems with up to billions of states.
Derives criteria for when state-dependent proto-area two-jets in approximate holographic codes are compatible with metric two-jets, including polyhedral realizations, X-ray transform tangent spaces, and quadratic obstructions to geometry.
Lie Group VAE framework diagnoses latent non-commutativity through algebraic and reconstruction diagnostics then calibrates a stability constraint to align decoder behavior, showing improved consistency on dSprites, 3DShapes, 3DCars and CelebA versus beta-VAE, CLG-VAE and CFASL baselines.
Rust sparse kernels match Eigen and PSBLAS performance for CSC formats but trail PETSc's blocked CSR optimizations.
citing papers explorer
-
Kernel-based linear system identification using augmented Krylov subspaces
Augmented Krylov subspaces jointly approximate quadratic forms and log-dets for faster MLE-based hyperparameter tuning in kernel-based linear system identification.