2022
DOI: 10.48550/arxiv.2206.09881
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A Near-Term Quantum Algorithm for Computing Molecular and Materials Properties based on Recursive Variational Series Methods

Abstract: Determining properties of molecules and materials is one of the premier applications of quantum computing. A major question in the field is: how might we use imperfect near-term quantum computers to solve problems of practical value? We propose a quantum algorithm to estimate properties of molecules using near-term quantum devices. The method is a recursive variational series estimation method, where we expand an operator of interest in terms of Chebyshev polynomials, and evaluate each term in the expansion us… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 63 publications
0
1
0
Order By: Relevance
“…Block encoding of a Hamiltonian is deeply connected with the Chebyshev polynomials [30], implementing the Hamiltonian as a quantum walk as exploited in the context of the KPM in [31] and more generally to estimate physical properties in [32,33]. An alternative is to compute the Chebyshev moments iteratively in a variational quantum algorithm [34] or otherwise overcoming the problem of implementing the Chebyshev polynomials using suitably defined Fourier ones [35,36].…”
Section: Introductionmentioning
confidence: 99%
“…Block encoding of a Hamiltonian is deeply connected with the Chebyshev polynomials [30], implementing the Hamiltonian as a quantum walk as exploited in the context of the KPM in [31] and more generally to estimate physical properties in [32,33]. An alternative is to compute the Chebyshev moments iteratively in a variational quantum algorithm [34] or otherwise overcoming the problem of implementing the Chebyshev polynomials using suitably defined Fourier ones [35,36].…”
Section: Introductionmentioning
confidence: 99%