Time optimal quantum state transfer in a fully-connected quantum computer
Abstract The speed limit of quantum state transfer (QST) in a system of interacting particles is not only important for quantum information processing, but also directly linked to Lieb–Robinson-type bounds that are crucial for understanding various aspects of quantum many-body physics. For strongly...
Saved in:
Published in | Quantum science and technology Vol. 9; no. 1; pp. 15014 - 15030 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
IOP Publishing
01.01.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Abstract
The speed limit of quantum state transfer (QST) in a system of interacting particles is not only important for quantum information processing, but also directly linked to Lieb–Robinson-type bounds that are crucial for understanding various aspects of quantum many-body physics. For strongly long-range interacting systems such as a fully-connected quantum computer, such a speed limit is still unknown. Here we develop a new quantum brachistochrone method that can incorporate inequality constraints on the Hamiltonian. This method allows us to prove an exactly tight bound on the speed of QST on a subclass of Hamiltonians experimentally realizable by a fully-connected quantum computer. |
---|---|
Bibliography: | QST-102381.R1 |
ISSN: | 2058-9565 2058-9565 |
DOI: | 10.1088/2058-9565/ad0770 |