.png){kind=icon}
.png){kind=icon}
Return
Simulating time evolution on distributed quantum computers
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.5.L022003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study a variation of the Trotter-Suzuki decomposition, in which a Hamiltonian exponential is approximated by an ordered product of two-qubit operator exponentials such that the Trotter step size is enhanced for a small number of terms. Such decomposition directly reflects hardware constraints of distributed quantum computers, where operations on monolithic quantum devices are fast compared to entanglement distribution across separate nodes using interconnects. We simulate nonequilibrium dynamics of transverse-field Ising and XY spin chain models and investigate the impact of locally increased Trotter step sizes that are associated with an increasingly sparse use of the quantum interconnect. We find that the overall quality of the approximation depends smoothly on the local sparsity and that the proliferation of local errors is slow. As a consequence, we show that fast local operations on monolithic devices can be leveraged to obtain an overall improved result fidelity even on distributed quantum computers where the use of interconnects is costly.
Keywords:
COMPUTATIONAL ADVANTAGE
ALGORITHMS
TELEPORTATION
PATH