Quantum-Enhanced Transaction Scheduling with Reduced Complexity via Solving QUBO Iteratively using a Locking Mechanism
Open Access
- 22 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 26-35
Abstract
No abstract availableFunding Information
- German Federal Ministry of Education and Research (13N16090)
This publication has 21 references indexed in Scilit:
- Hype or Heuristic? Quantum Reinforcement Learning for Join Order Optimisation2024
- Quantum Circuit for Imputation of Missing DataIEEE Transactions on Quantum Engineering, 2024
- Quantum Join Ordering by Splitting the Search Space of QUBO ProblemsDatenbank-Spektrum, 2024
- Multiple Query Optimization Using a Gate-Based Quantum ComputerIEEE Access, 2023
- Hybrid Annealing Method Based on subQUBO Model Extraction With Multiple Solution InstancesIEEE Transactions on Computers, 2021
- A fast quantum mechanical algorithm for database search1996
- Simulated annealing: Practice versus theoryMathematical and Computer Modelling, 1993
- Simulated Annealing: Theory and Applications1987
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- Optimization by Simulated AnnealingScience, 1983