Develops a quantum algorithm for linear matrix differential equations with query complexity O~(ν L t / ε) that is nearly optimal and yields polynomial to exponential speedups for open quantum system simulation.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
roles
method 1polarities
use method 1representative citing papers
QRSI spans degenerate quantum eigenspaces almost surely by conjugating the Hamiltonian with random unitaries on g parallel branches and using subspace estimation, while exactly preserving the spectral gap.
Quasi-Nambu-Goldstone modes exist universally in many-body scar models in the degenerate limit, with properties determined by the quasisymmetry of the scar tower.
Polfed.jl provides an efficient implementation of polynomially filtered Lanczos diagonalization for mid-spectrum eigenpairs in quantum many-body systems, supporting larger sizes via on-the-fly polynomial transformations and GPU acceleration.
Numerical study demonstrates controlled transport of Z4 parafermion edge states in a ladder model and quantifies the adiabatic speed limit under realistic conditions.
citing papers explorer
-
Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems
Develops a quantum algorithm for linear matrix differential equations with query complexity O~(ν L t / ε) that is nearly optimal and yields polynomial to exponential speedups for open quantum system simulation.
-
Quantum Randomized Subspace Iteration
QRSI spans degenerate quantum eigenspaces almost surely by conjugating the Hamiltonian with random unitaries on g parallel branches and using subspace estimation, while exactly preserving the spectral gap.
-
Quasi-Nambu-Goldstone modes in many-body scar models
Quasi-Nambu-Goldstone modes exist universally in many-body scar models in the degenerate limit, with properties determined by the quasisymmetry of the scar tower.
-
Computing eigenpairs of quantum many-body systems with Polfed.jl
Polfed.jl provides an efficient implementation of polynomially filtered Lanczos diagonalization for mid-spectrum eigenpairs in quantum many-body systems, supporting larger sizes via on-the-fly polynomial transformations and GPU acceleration.
-
Shuttling of $\mathbb{Z}_4$ parafermions in an electronic ladder model
Numerical study demonstrates controlled transport of Z4 parafermion edge states in a ladder model and quantifies the adiabatic speed limit under realistic conditions.