Block-encoding dense and full-rank kernels using hierarchical matrices: applications in quantum numerical linear algebra
Many quantum algorithms for numerical linear algebra assume black-box access to a block-encoding of the matrix of interest, which is a strong assumption when the matrix is not sparse. Kernel matrices, which arise from discretizing a kernel function <mml:math xmlns:mml="http://www.w3.org/1998...
Main Authors: | Nguyen, Quynh T., Kiani, Bobak T., Lloyd, Seth |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/1721.1/153945 |
Similar Items
-
Efficient classical algorithms for simulating symmetric quantum systems
by: Anschuetz, Eric R., et al.
Published: (2024) -
Block-encoding dense and full-rank kernels using hierarchical matrices: applications in quantum numerical linear algebra
by: Quynh T. Nguyen, et al.
Published: (2022-12-01) -
Learning quantum data with the quantum earth mover’s distance
by: Kiani, Bobak Toussi, et al.
Published: (2024) -
Search for a light charged Higgs boson in the decay channel H+ → cs̄ in tt̄ events using pp collisions at √s = 7 TeV with the ATLAS detector
by: Taylor, F. E.
Published: (2022) -
Observation of $${{\varXi } ^0_{b}} \rightarrow {{\varXi } ^+_{c}} {{D} ^-_{s}} $$ Ξ b 0 → Ξ c + D s - and $${{\varXi } ^-_{b}} \rightarrow {{\varXi } ^0_{c}} {{D} ^-_{s}} $$ Ξ b - → Ξ c 0 D s - decays
Published: (2024)