Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleSeptember 2021
Optimizing Transaction Schedules on Universal Quantum Computers via Code Generation for Grover’s Search Algorithm
IDEAS '21: Proceedings of the 25th International Database Engineering & Applications SymposiumPages 149–156https://doi.org/10.1145/3472163.3472164Quantum computers are known to be efficient for solving combinatorial problems like finding optimal schedules for processing transactions in parallel without blocking. We show how Grover’s search algorithm for quantum computers can be applied for ...
- research-articleAugust 2020
Avoiding blocking by scheduling transactions using quantum annealing
IDEAS '20: Proceedings of the 24th Symposium on International Database Engineering & ApplicationsArticle No.: 21, Pages 1–10https://doi.org/10.1145/3410566.3410593Quantum annealers are a special kind of quantum computers for solving optimization problems. In this paper, we investigate the benefits of quantum annealers in the field of transaction synchronization. In particular, we show how transactions using the 2-...