Peer-reviewedCC BY-NC-ND 4.0npj Quantum Information
Mirror subspace diagonalization: a real-time quantum Krylov algorithm with near-optimal sampling cost
Related
- Quantum Folding in Chebyshev-Based Quantum Subspace Diagonalization
- DF-SQD: Deterministic Fields for Sampling-Based Quantum Diagonalization
- Measurement-dependent reduction of open dynamics in the quantum phase estimation algorithm: the visible subspace and the damped Fejér kernel
- κ-Parametrized Boltzmann Distribution Sampling on Quantum Approximate Optimization Algorithm
- An Optimal Quantum Linear Systems Algorithm
BibTeX
@article{kanasugi2026mirror,
title = {{Mirror subspace diagonalization: a real-time quantum Krylov algorithm with near-optimal sampling cost}},
author = {Shota Kanasugi and Yuya O. Nakagawa and Norifumi Matsumoto and Yuichiro Hidaka and Kazunori Maruyama and Hirotaka Oshima},
journal = {npj Quantum Information},
year = {2026},
month = oct,
doi = {10.1038/s41534-026-01384-y},
url = {https://www.nature.com/articles/s41534-026-01384-y},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - JOUR
TI - Mirror subspace diagonalization: a real-time quantum Krylov algorithm with near-optimal sampling cost
AU - Shota Kanasugi
AU - Yuya O. Nakagawa
AU - Norifumi Matsumoto
AU - Yuichiro Hidaka
AU - Kazunori Maruyama
AU - Hirotaka Oshima
PY - 2026
DA - 2026/10/13
JO - npj Quantum Information
DO - 10.1038/s41534-026-01384-y
UR - https://www.nature.com/articles/s41534-026-01384-y
SN - 2056-6387
ER -