Time optimal quantum state transfer in a fully-connected quantum computer
arXiv:2303.04804 · doi:10.1088/2058-9565/ad0770
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.
13 pages, 2 figures, accepted version
References in corpus (8)
- Perfect Transfer of Arbitrary States in Quantum Spin Networks
- Experimental Comparison of Two Quantum Computing Architectures
- Nearly-linear light cones in long-range interacting quantum systems
- Quantum brachistochrone curves as geodesics: obtaining accurate control protocols for time-optimal quantum gates
- Zermelo Navigation in the Quantum Brachistochrone
- Quantum Logic between Remote Quantum Registers
- Theoretical analysis of perfect quantum state transfer with superconducting qubits
- Bound on quantum scrambling with all-to-all interactions