Accelerating Quantum Algorithms with Precomputation
Real-world applications of computing can be extremely time-sensitive. It would be valuable if we could accelerate such tasks by performing some of the work ahead of time. Motivated by this, we propose a cost model for quantum algorithms that allows quantum precomputation; i.e., for a polynomial amou...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2024-02-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2024-02-22-1264/pdf/ |