Explicit block-encodings and QSVT–VTAA complexity bounds for biharmonic boundary-value problems under periodic, simply supported, and Dirichlet–Neumann conditions, using augmented formulations to lower condition numbers.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Explicit block-encodings for biharmonic boundary-value problems
Explicit block-encodings and QSVT–VTAA complexity bounds for biharmonic boundary-value problems under periodic, simply supported, and Dirichlet–Neumann conditions, using augmented formulations to lower condition numbers.