REVIEW 3 cited by
Quantum Algorithms based on the Block-Encoding Framework for Matrix Functions by Contour Integrals
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 3 Pith papers
-
Quantum simulation of non-Markovian dynamical systems
Quantum algorithms simulate linear Volterra integro-differential equations exponentially faster in system size when memory is weak (M<1), with a matching hardness result for strong memory and efficient handling of sum...
-
Faster quantum linear system solver beyond the condition number
Two quantum linear system solvers are presented with query complexity independent of the condition number, scaling instead with an effective condition number or a solution-norm ratio.
-
Simulating Time Dependent and Nonlinear Classical Oscillators through Nonlinear Schr\"odingerization
A quantum algorithm pipeline is proposed that maps forced, nonlinear, and time-dependent oscillator networks to nonlinear Schrodinger equations and then to Hermitian Hamiltonian simulation, claiming near-linear time c...
Discussion (0). Continue with ORCID to comment.