research-article

Optimizing Transaction Schedules on Universal Quantum Computers via Code Generation for Grover’s Search Algorithm

Authors:

Jinghua GroppeAuthors Info & Claims

IDEAS '21: Proceedings of the 25th International Database Engineering & Applications Symposium

Pages 149 - 156

https://doi.org/10.1145/3472163.3472164

Published: 07 September 2021 Publication History

Abstract

Quantum 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 finding an optimal transaction schedule via generating code from the problem instance. We compare our approach with existing approaches for traditional computers and quantum annealers in terms of preprocessing, runtime, space and code length complexity. Furthermore, we show by experiments the expected number of optimal solutions of this problem as well as suboptimal ones. With the help of an estimator of the number of solutions, we further speed up our optimizer for optimal and suboptimal transaction schedules.

References

[1]

Adriano Barenco, David Deutsch, Artur Ekert, and Richard Jozsa. 1995. Conditional quantum dynamics and logic gates. Physical Review Letters 74, 20 (1995).

[2]

William P. Baritompa, David W. Bulger, and Graham R. Wood. 2005. Grover’s quantum algorithm applied to global optimization. SIAM Journal on Optimization 15, 4 (2005).

Digital Library

[3]

Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani. 1997. Strengths and Weaknesses of Quantum Computing. SIAM J. Comput. 26, 5 (1997), 1510–1523. https://doi.org/10.1137/S0097539796300933

Digital Library

[4]

Benjamin Bichsel, Maximilian Baader, Timon Gehr, and Martin Vechev. 2020. Silq: A High-Level Quantum Language with Safe Uncomputation and Intuitive Semantics. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). 286–300.

[5]

Tim Bittner and Sven Groppe. 2020. Avoiding Blocking by Scheduling Transactions Using Quantum Annealing. In IDEAS.

[6]

Tim Bittner and Sven Groppe. 2020. Hardware Accelerating the Optimization of Transaction Schedules via Quantum Annealing by Avoiding Blocking. Open Journal of Cloud Computing (OJCC) 7, 1 (2020).

[7]

Michel Boyer, Gilles Brassard, Peter Høyer, and Alain Tapp. 1998. Tight Bounds on Quantum Searching. Fortschritte der Physik 46, 4-5 (1998).

[8]

Antoine Comeau. 2014. Mapping between permutations and natural numbers. Blog available at http://antoinecomeau.blogspot.com/2014/07/mapping-between-permutations-and.html.

[9]

Thomas M Connolly and Carolyn E Begg. 2005. Database systems: a practical approach to design, implementation, and management. Pearson Education.

[10]

M. R. Garey, D. S. Johnson, and Ravi Sethi. 1976. The Complexity of Flowshop and Jobshop Scheduling. Mathematics of Operations Research 1, 2 (1976), 117–129.

Digital Library

[11]

Sven Groppe. 2020. Emergent models, frameworks, and hardware technologies for Big data analytics. The Journal of Supercomputing 76, 3 (2020), 1800–1827. https://doi.org/10.1007/s11227-018-2277-x

[12]

Sven Groppe. 2021. Semantic Hybrid Multi-Model Multi-Platform (SHM3P) Databases. In International Semantic Intelligence Conference (ISIC 2021), New Delhi (hybrid), India. http://ceur-ws.org/Vol-2786/Paper2.pdf

[13]

Sven Groppe and Jinghua Groppe. 2020. Hybrid Multi-Model Multi-Platform (HM3P) Databases. In Proceedings of the 9th International Conference on Data Science, Technology and Applications (DATA).

[14]

Lov K. Grover. 1996. A Fast Quantum Mechanical Algorithm for Database Search. In STOC.

[15]

Lov K Grover. 1997. Quantum computers can search arbitrarily large databases by a single query. Physical review letters 79, 23 (1997).

[16]

Derrick H Lehmer. 1960. Teaching combinatorial tricks to a computer. In Proc. Sympos. Appl. Math. Combinatorial Analysis, Vol. 10. 179–193.

[17]

Diana Maimut and Emil Simion. 2018. Post-quantum Cryptography and a (Qu)Bit More. In SecITC.

[18]

Kyoichi Okamoto and Osamu Watanabe. 2001. Deterministic Application of Grover’s Quantum Search Algorithm. In COCOON.

[19]

Peter W Shor. 1994. Algorithms for quantum computation: Discrete logarithms and factoring. In Symposium on foundations of computer science.

Digital Library

[20]

A. Thomson, T. Diamond, S.-C. Weng, K. Ren, P. Shao, and D. J. Abadi. 2012. Calvin: Fast Distributed Transactions for Partitioned Database Systems. In SIGMOD.

Cited By

Kesarwani MHaritsa J(2024)Index Advisors on Quantum PlatformsProceedings of the VLDB Endowment10.14778/3681954.368202517:11(3615-3628)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.14778/3681954.3682025
Saxena PSabek ISpedalieri F(2024)Constrained Quadratic Model for Optimizing Join OrdersProceedings of the 1st Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications10.1145/3665225.3665447(38-44)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3665225.3665447
Gogeissl MSafi HMauerer W(2024)Quantum Data Encoding Patterns and their ConsequencesProceedings of the 1st Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications10.1145/3665225.3665446(27-37)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3665225.3665446
Show More Cited By

Recommendations

Avoiding blocking by scheduling transactions using quantum annealing
IDEAS '20: Proceedings of the 24th Symposium on International Database Engineering & Applications

Quantum 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-...
Quantum computing via the Bethe ansatz

We recognize quantum circuit model of computation as factorisable scattering model and propose that a quantum computer is associated with a quantum many-body system solved by the Bethe ansatz. As an typical example to support our perspectives on quantum ...
Supercomputing leverages quantum machine learning and Grover’s algorithm
Abstract
The complexity of searching algorithms in classical computing is a classic problem and a research area. Quantum computers and quantum algorithms can efficiently compute some classically hard problems. In addition, quantum machine learning ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

IDEAS '21: Proceedings of the 25th International Database Engineering & Applications Symposium

July 2021

308 pages

ISBN:9781450389914

DOI:10.1145/3472163

Editors:
Bipin C. Desai
Concordia University, Canada
,
Bipin C. Desai
Concordia University, Canada
,
Jeffrey Ullman
Stanford University, USA
,
Richard McClatchey
Univ. Of West England, U.K
,
Motomichi Toyoma
Keio University, Japan

Copyright © 2021 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 September 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

IDEAS 2021

IDEAS 2021: 25th International Database Engineering & Applications Symposium

July 14 - 16, 2021

QC, Montreal, Canada

Acceptance Rates

Overall Acceptance Rate 74 of 210 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
129
Total Downloads

Downloads (Last 12 months)54
Downloads (Last 6 weeks)6

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kesarwani MHaritsa J(2024)Index Advisors on Quantum PlatformsProceedings of the VLDB Endowment10.14778/3681954.368202517:11(3615-3628)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.14778/3681954.3682025
Saxena PSabek ISpedalieri F(2024)Constrained Quadratic Model for Optimizing Join OrdersProceedings of the 1st Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications10.1145/3665225.3665447(38-44)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3665225.3665447
Gogeissl MSafi HMauerer W(2024)Quantum Data Encoding Patterns and their ConsequencesProceedings of the 1st Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications10.1145/3665225.3665446(27-37)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3665225.3665446
Trummer IVenturelli D(2024)Leveraging Quantum Computing for Database Index SelectionProceedings of the 1st Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications10.1145/3665225.3665445(14-26)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3665225.3665445
Hai RHung SFeld S(2024)Quantum Data Management: From Theory to Opportunities2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00410(5376-5381)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00410
Pfaendler SKonson KGreinert F(2024)Advancements in Quantum Computing—Viewpoint: Building Adoption and Competency in IndustryDatenbank-Spektrum10.1007/s13222-024-00467-424:1(5-20)Online publication date: 11-Mar-2024
https://doi.org/10.1007/s13222-024-00467-4
Schönberger MTrummer IMauerer W(2023)Quantum-Inspired Digital Annealing for Join OrderingProceedings of the VLDB Endowment10.14778/3632093.363211217:3(511-524)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.14778/3632093.3632112
Çalikyilmaz UGroppe SGroppe JWinker TPrestel SShagieva FArya DPreis FGruenwald L(2023)Opportunities for Quantum Acceleration of Databases: Optimization of Queries and Transaction SchedulesProceedings of the VLDB Endowment10.14778/3598581.359860316:9(2344-2353)Online publication date: 1-May-2023
https://dl.acm.org/doi/10.14778/3598581.3598603
Schönberger MScherzinger SMauerer W(2023)Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum HardwareProceedings of the ACM on Management of Data10.1145/35889461:1(1-27)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588946
Fankhauser TSolèr MFüchslin RStockinger K(2023)Multiple Query Optimization Using a Gate-Based Quantum ComputerIEEE Access10.1109/ACCESS.2023.332425311(114031-114043)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3324253
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Media

Figures

Other

Tables

View Table of Contents