Improved Quantum Computing with the Higher-order Trotter Decomposition

In designing quantum control, it is generally required to simulate the controlled system evolution with a classical computer. However, computing the time evolution operator can be quite resource-consuming since the total Hamiltonian is often hard to diagonalize. In this paper, we mitigate this issue...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2022-10
Main Authors: Yang, Xiaodong, Nie, Xinfang, Ji, Yunlan, Tao Xin, Lu, Dawei, Li, Jun
Format: Article
Language:English
Subjects:
Decomposition
Evolution
Optimal control
Optimization
Quantum computing
Qubits (quantum computing)
Search algorithms
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In designing quantum control, it is generally required to simulate the controlled system evolution with a classical computer. However, computing the time evolution operator can be quite resource-consuming since the total Hamiltonian is often hard to diagonalize. In this paper, we mitigate this issue by substituting the time evolution segments with their Trotter decompositions, which reduces the propagator into a combination of single-qubit operations and fixed-time system evolutions. The resulting procedure can provide substantial speed gain with acceptable costs in the propagator error. As a demonstration, we apply the proposed strategy to improve the efficiency of the gradient ascent pulse engineering algorithm for searching optimal control fields. Furthermore, we show that the higher-order Trotter decompositions can provide efficient Ans\"atze for the variational quantum algorithm, leading to improved performance in solving the ground-state problem. The strategy presented here is also applicable for many other quantum optimization and simulation tasks.
ISSN:2331-8422
DOI:10.48550/arxiv.2205.02520