Quantum Speed Limits for Quantum Information Processing Tasks
Jeffrey M. Epstein, K. Birgitta Whaley

TL;DR
This paper establishes fundamental speed limits for quantum information tasks like state transfer and entanglement generation, using algebraic bounds and graph models, highlighting potential for improved quantum processing performance.
Contribution
It introduces algebraic bounds on quantum information processing rates and applies them to spin systems, revealing possible enhancements beyond current control methods.
Findings
Derived algebraic bounds on quantum task rates
Applied bounds to graph-based spin models
Indicated potential for improved quantum performance
Abstract
We derive algebraic bounds on achievable rates for quantum state transfer and entanglement generation in general quantum systems. We apply these bounds to graph-based models of local quantum spin systems to obtain speed limits on these tasks. A comparison to numerical optimal control results for spin chains suggests that unexplored regions of the dynamical landscape may support enhanced performance of key quantum information processing tasks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
