pith. sign in

arxiv: 2106.08076 · v2 · pith:RLAVN7WMnew · submitted 2021-06-15 · 🪐 quant-ph

Quantum Algorithms based on the Block-Encoding Framework for Matrix Functions by Contour Integrals

classification 🪐 quant-ph
keywords matrixquantumalgorithmframeworkcontourfunctionsappliedblock-encoding
0
0 comments X
read the original abstract

The matrix functions can be defined by Cauchy's integral formula and can be approximated by the linear combination of inverses of shifted matrices using a quadrature formula. In this paper, we show a concrete construction of a framework to implement the linear combination of the inverses on quantum computers and propose a quantum algorithm for matrix functions based on the framework. Compared with the previous study [S. Takahira, A. Ohashi, T. Sogabe, and T.S. Usuda, Quant. Inf. Comput., 20, 1&2, 14--36, (Feb. 2020)] that proposed a quantum algorithm to compute a quantum state for the matrix function based on the circular contour centered at the origin, the quantum algorithm in the present paper can be applied to a more general contour. Moreover, the algorithm is described by the block-encoding framework. Similarly to the previous study, the algorithm can be applied even if the input matrix is not a Hermitian or normal matrix.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Unified Poisson Summation Framework for Generalized Quantum Matrix Transformations

    quant-ph 2026-04 unverdicted novelty 7.0

    A dual Fourier-PSF and contour-PSF framework resolves the smoothness-sparsity trade-off for efficient quantum simulation of singular and holomorphic matrix functions.