Metraipolis › archive › dc_3a659db7cf53
Shadow Quantum Singular Value Transformation with Shallow Quantum Circuits — arXiv:2609.40167
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.40167
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T15:17:17.632Z
- SHA-256 of the archived text
ffd03bc41d6b87e9f8cbf3409cec4c687c62336dfeb3660b5b7c2947d0b0d4df- Stable URL of this page
https://metraipolis.com/documento/dc_3a659db7cf53
How to cite
Shadow Quantum Singular Value Transformation with Shallow Quantum Circuits — arXiv:2609.40167 — arXiv (en), https://arxiv.org/abs/2609.40167 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3a659db7cf53 (Metraipolis archive dc_3a659db7cf53, sha256 ffd03bc41d6b87e9f8cbf3409cec4c687c62336dfeb3660b5b7c2947d0b0d4df)
BibTeX
@misc{dc3a659db7cf53,
title = {Shadow Quantum Singular Value Transformation with Shallow Quantum Circuits — arXiv:2609.40167},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.40167},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3a659db7cf53; sha256 ffd03bc41d6b87e9f8cbf3409cec4c687c62336dfeb3660b5b7c2947d0b0d4df},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.40167. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce shadow quantum singular value transformation (Shadow QSVT): given an initial state $|{\psi}\rangle$, a Hermitian matrix $H$, a polynomial $f$, and a set of observables $\{O_1,\dots,O_m\}$, the goal is to estimate $\langle{\psi}|f(H)^{\dagger}O_j f(H)|{\psi}\rangle$ for all $j\in\{1,\dots,m\}$. Shadow QSVT provides a systematic route to reduce the quantum resources required by standard QSVT, which constructs a unitary block-encoding of $f(H)$. It uses structure in the input state and observables, together with the fact that many applications require only observable estimates rather than synthesizing the full unitary. We present three algorithms that exploit structure in the initial state and observables to reduce quantum circuit depth. First, we develop a state-aware QSVT algorithm that prepares the target state with low circuit depth when the Krylov subspace associated with $H$ and $|\psi\rangle$ is low-dimensional or admits an accurate low-dimensional approximation. Second, we introduce an observable-aware Shadow QSVT algorithm that combines a new observable-aware Krylov subspace with history states to further reduce circuit depth and gate complexity. Finally, we develop Classical Shadow QSVT, which constructs a classical representation from $H$, $f$, and $|\psi\rangle$ without prior knowledge of the observables or explicit preparation of the target state proportional to $f(H)|\psi\rangle$. This representation enables estimation of the target quantities for observables specified after the quantum computation. Together, these three algorithms provide tools for reducing the circuit depth of QSVT-based computations across a range of settings.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in cs.DS).
Categorie arXiv: Quantum Physics (quant-ph) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.40167 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:50:37.672Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).