pith. sign in

arxiv: 2303.04804 · v2 · pith:YGYUTH7Onew · submitted 2023-03-08 · 🪐 quant-ph

Time optimal quantum state transfer in a fully-connected quantum computer

classification 🪐 quant-ph
keywords quantumcomputerfully-connectedspeedinteractinglimitmethodstate
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.