Dmitry Guskov

Dmitry Guskov

Auto-generated profile, based on publicly available information

Dmitry Guskov

Skolkovo Institute of Science and Technology

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 May 2024 in Physical Review A
Verified
Journal Article
Closed access
PDF file
BABoris Arseniev
Boris Arseniev
DGDmitry Guskov
Dmitry Guskov
RSRichik Sengupta
Richik Sengupta
JBJacob Biamonte
Jacob Biamonte
IZIgor Zacharov
Igor Zacharov
The construction of quantum circuits to simulate Hamiltonian evolution is central to many quantum algorithms. State-of-the-art circuits are based on oracles whose implementation is often omitted, and the complexity of the algorithm is estimated by counting oracle queries. However, in practical applications, an oracle implementation contributes a large constant factor to the overall complexity of the algorithm. The key finding of this work is the efficient procedure for representation of a tridiagonal matrix in the Pauli basis, which allows one to construct a Hamiltonian evolution circuit without the use of oracles. The procedure represents a general tridiagonal matrix 2n×2n by systematically determining all Pauli strings present in the decomposition, dividing them into commuting subsets. The efficiency is in the number of commuting subsets O(n). The method is demonstrated using the one-dimensional wave equation, verifying numerically that the gate complexity as a function of the number of qubits is lower than the oracle-based approach for n<15 and requires half the number of qubits. This method is applicable to other Hamiltonians based on the tridiagonal matrices.

28 April 2025 in Physical Review A
Verified
Journal Article
Closed access
BABoris Arseniev
Boris Arseniev
DGDmitry Guskov
Dmitry Guskov
RSRichik Sengupta
Richik Sengupta
IZIgor Zacharov
Igor Zacharov