Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum Data Management: From Theory to Opportunities

Published 5 Mar 2024 in cs.DB and cs.NI | (2403.02856v1)

Abstract: Quantum computing has emerged as a transformative tool for future data management. Classical problems in database domains, including query optimization, data integration, and transaction management, have recently been addressed using quantum computing techniques. This tutorial aims to establish the theoretical foundation essential for enhancing methodologies and practical implementations in this line of research. Moreover, this tutorial takes a forward-looking approach by delving into recent strides in quantum internet technologies and the nonlocality theory. We aim to shed light on the uncharted territory of future data systems tailored for the quantum internet.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (64)
  1. A. Broadbent, J. Fitzsimons, and E. Kashefi, “Universal blind quantum computation,” in 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009, pp. 517–526.
  2. N. H. Nickerson, J. F. Fitzsimons, and S. C. Benjamin, “Freely scalable quantum technologies using cells of 5-to-50 qubits with very lossy and noisy photonic links,” Physical Review X, vol. 4, no. 4, p. 041041, 2014.
  3. S. Wehner, D. Elkouss, and R. Hanson, “Quantum internet: A vision for the road ahead,” Science, vol. 362, no. 6412, p. eaam9288, 2018.
  4. S. P. Neumann, A. Buchner, L. Bulla, M. Bohmann, and R. Ursin, “Continuous entanglement distribution over a transnational 248 km fiber link,” Nature Communications, vol. 13, no. 1, p. 6134, 2022.
  5. J. Yin, Y. Cao, Y.-H. Li, S.-K. Liao, L. Zhang, J.-G. Ren, W.-Q. Cai, W.-Y. Liu, B. Li, H. Dai et al., “Satellite-based entanglement distribution over 1200 kilometers,” Science, vol. 356, no. 6343, pp. 1140–1144, 2017.
  6. E. F. Codd, “A relational model of data for large shared data banks,” Communications of the ACM, vol. 13, no. 6, pp. 377–387, 1970.
  7. M. Qszu and P. Valdureiz, “Principles of distributed database system,” 1991.
  8. M. Atkinson, D. Dewitt, D. Maier, F. Bancilhon, K. Dittrich, and S. Zdonik, “The object-oriented database system manifesto,” in Deductive and object-oriented databases.   Elsevier, 1990, pp. 223–240.
  9. D. Abadi, R. Agrawal, A. Ailamaki, M. Balazinska, P. A. Bernstein, M. J. Carey, S. Chaudhuri, J. Dean, A. Doan, M. J. Franklin et al., “The beckman report on database research,” Communications of the ACM, vol. 59, no. 2, pp. 92–99, 2016.
  10. F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell et al., “Quantum supremacy using a programmable superconducting processor,” Nature, vol. 574, no. 7779, pp. 505–510, 2019.
  11. H.-S. Zhong, H. Wang, Y.-H. Deng, M.-C. Chen, L.-C. Peng, Y.-H. Luo, J. Qin, D. Wu, X. Ding, Y. Hu et al., “Quantum computational advantage using photons,” Science, vol. 370, no. 6523, pp. 1460–1463, 2020.
  12. Y. Wu, W.-S. Bao, S. Cao, F. Chen, M.-C. Chen, X. Chen, T.-H. Chung, H. Deng, Y. Du, D. Fan et al., “Strong quantum computational advantage using a superconducting quantum processor,” Physical review letters, vol. 127, no. 18, p. 180501, 2021.
  13. L. S. Madsen, F. Laudenbach, M. F. Askarani, F. Rortais, T. Vincent, J. F. Bulmer, F. M. Miatto, L. Neuhaus, L. G. Helt, M. J. Collins et al., “Quantum computational advantage with a programmable photonic processor,” Nature, vol. 606, no. 7912, pp. 75–81, 2022.
  14. R. van der Heijden, “The first european cloud quantum computer is in delft,” https://www.nemokennislink.nl/publicaties/eerste-europese-cloudquantumcomputer-staat-in-delft, accessed: 2024-02-23.
  15. A. Einstein, B. Podolsky, and N. Rosen, “Can quantum-mechanical description of physical reality be considered complete?” Physical review, vol. 47, no. 10, p. 777, 1935.
  16. E. Schrödinger, “Discussion of probability relations between separated systems,” in Mathematical Proceedings of the Cambridge Philosophical Society, vol. 31, no. 4.   Cambridge University Press, 1935, pp. 555–563.
  17. P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM review, vol. 41, no. 2, pp. 303–332, 1999.
  18. L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, 1996, pp. 212–219.
  19. I. Trummer and C. Koch, “Multiple query optimization on the D-Wave 2X adiabatic quantum computer,” Proceedings of the VLDB Endowment, vol. 9, no. 9, 2016.
  20. T. Fankhauser, M. E. Solèr, R. M. Füchslin, and K. Stockinger, “Multiple query optimization using a hybrid approach of classical and quantum computing,” arXiv preprint arXiv:2107.10508, 2021.
  21. T. Fankhauser, M. E. Soler, R. M. Füchslin, and K. Stockinger, “Multiple query optimization using a gate-based quantum computer,” IEEE Access, 2023.
  22. M. Schönberger, “Applicability of Quantum Computing on Database Query Optimization,” in Proceedings of the 2022 International Conference on Management of Data, ser. SIGMOD ’22.   New York, NY, USA: Association for Computing Machinery, 2022, pp. 2512–2514.
  23. M. Schönberger, S. Scherzinger, and W. Mauerer, “Ready to leap (by co-design)? join order optimisation on quantum hardware,” Proceedings of the ACM on Management of Data, vol. 1, no. 1, pp. 1–27, 2023.
  24. M. Schönberger, I. Trummer, and W. Mauerer, “Quantum Optimisation of General Join Trees,” in Joint Workshops at 49th International Conference on Very Large Data Bases (VLDBW’23)—International Workshop on Quantum Data Science and Management (QDSM’23), August 28-September 1, 2023, Vancouver, Canada (CEUR Workshop Proceedings), 2023.
  25. N. Nayak, J. Rehfeld, T. Winker, B. Warnke, U. Çalikyilmaz, and S. Groppe, “Constructing Optimal Bushy Join Trees by Solving QUBO Problems on Quantum Hardware and Simulators,” in Proceedings of the International Workshop on Big Data in Emergent Distributed Environments, ser. BiDEDE ’23.   New York, NY, USA: Association for Computing Machinery, 2023.
  26. T. Winker, U. Çalikyilmaz, L. Gruenwald, and S. Groppe, “Quantum Machine Learning for Join Order Optimization Using Variational Quantum Circuits,” in Proceedings of the International Workshop on Big Data in Emergent Distributed Environments, ser. BiDEDE ’23.   New York, NY, USA: Association for Computing Machinery, 2023.
  27. K. Fritsch and S. Scherzinger, “Solving hard variants of database schema matching on quantum computers,” Proceedings of the VLDB Endowment, vol. 16, no. 12, pp. 3990–3993, 2023.
  28. T. Bittner and S. Groppe, “Avoiding blocking by scheduling transactions using quantum annealing,” in Proceedings of the 24th Symposium on International Database Engineering and Applications, 2020.
  29. Tim Bittner and Sven Groppe, “Hardware accelerating the optimization of transaction schedules via quantum annealing by avoiding blocking,” Open Journal of Cloud Computing (OJCC), vol. 7, no. 1, pp. 1–21, 2020.
  30. S. Groppe and J. Groppe, “Optimizing transaction schedules on universal quantum computers via code generation for grover’s search algorithm,” in Proceedings of the 25th International Database Engineering & Applications Symposium, 2021, pp. 149–156.
  31. A. D. King, J. Raymond, T. Lanting, R. Harris, A. Zucca, F. Altomare, A. J. Berkley, K. Boothby, S. Ejtemaee, C. Enderud et al., “Quantum critical dynamics in a 5,000-qubit programmable spin glass,” Nature, pp. 1–6, 2023.
  32. F. Glover, G. Kochenberger, and Y. Du, “A tutorial on formulating and using qubo models,” arXiv preprint arXiv:1811.11538, 2018.
  33. M. Y. Vardi, “The complexity of relational query languages,” in Proceedings of the fourteenth annual ACM symposium on Theory of computing, 1982, pp. 137–146.
  34. C. H. Papadimitriou and M. Yannakakis, “On the complexity of database queries,” in Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, 1997, pp. 12–19.
  35. A. Ambainis, “Understanding quantum algorithms via query complexity,” in Proceedings of the International Congress of Mathematicians: Rio de Janeiro 2018.   World Scientific, 2018, pp. 3265–3285.
  36. B. M. Terhal and J. A. Smolin, “Single quantum querying of a database,” Physical Review A, vol. 58, no. 3, p. 1822, 1998.
  37. M. Boyer, G. Brassard, P. Høyer, and A. Tapp, “Tight bounds on quantum searching,” Fortschritte der Physik: Progress of Physics, vol. 46, no. 4-5, pp. 493–505, 1998.
  38. A. Patel, “Quantum database search can do without sorting,” Physical Review A, vol. 64, no. 3, p. 34303, 2001.
  39. I.-M. Tsai, S.-Y. Kuo, and D. S. L. Wei, “Quantum Boolean circuit approach for searching an unordered database,” in Proceedings of the 2nd IEEE Conference on Nanotechnology.   IEEE, 2002, pp. 315–318.
  40. S. Imre and F. Balázs, “The generalized quantum database search algorithm,” Computing, vol. 73, pp. 245–269, 2004.
  41. Y.-L. Ju, I.-M. Tsai, and S.-Y. Kuo, “Quantum circuit design and analysis for database search applications,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 54, no. 11, pp. 2552–2563, 2007.
  42. P. Cockshott, “Quantum relational databases,” arXiv preprint quant-ph/9712025, 1997.
  43. A. Gueddana, R. Chatta, and N. Boudriga, “Optimized methods for inserting and deleting records and data retrieving in quantum database,” in 2010 12th International Conference on Transparent Optical Networks.   IEEE, 2010, pp. 1–5.
  44. T. Salman and Y. Baram, “Quantum set intersection and its application to associative memory,” The Journal of Machine Learning Research, vol. 13, no. 1, pp. 3177–3206, 2012.
  45. C.-Y. Pang, R.-G. Zhou, C.-B. Ding, and B.-Q. Hu, “Quantum search algorithm for set operation,” Quantum information processing, vol. 12, no. 1, pp. 481–492, 2013.
  46. A. Gueddana, R. Chatta, and M. Attia, “CNOT-based design and query management in quantum relational databases,” International Journal of Quantum Information, vol. 12, no. 04, p. 1450023, 2014.
  47. S. Jóczik and A. Kiss, “Quantum Computation and Its Effects in Database Systems,” in European Conference on Advances in Databases and Information Systems.   Springer, 2020, pp. 13–23.
  48. A. Younes, “Database Manipulation Operations on Quantum Systems,” Quantum Information Review, vol. 1, pp. 9–17, 2013.
  49. T. K. Sellis, “Multiple-query optimization,” ACM Transactions on Database Systems (TODS), vol. 13, no. 1, pp. 23–52, 1988.
  50. C. C. McGeoch and C. Wang, “Experimental evaluation of an adiabiatic quantum system for combinatorial optimization,” in Proceedings of the ACM International Conference on Computing Frontiers, 2013, pp. 1–11.
  51. E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” arXiv preprint arXiv:1411.4028, 2014.
  52. M. Steinbrunn, G. Moerkotte, and A. Kemper, “Heuristic and randomized optimization for the join ordering problem,” The VLDB journal, vol. 6, pp. 191–208, 1997.
  53. V. Leis, A. Gubichev, A. Mirchev, P. A. Boncz, A. Kemper, and T. Neumann, “How good are query optimizers, really?” Proc. VLDB Endow., vol. 9, no. 3, pp. 204–215, 2015. [Online]. Available: http://www.vldb.org/pvldb/vol9/p204-leis.pdf
  54. I. Trummer and C. Koch, “Solving the join ordering problem via mixed integer linear programming,” in Proceedings of the 2017 ACM International Conference on Management of Data, 2017, pp. 1025–1040.
  55. S. Y.-C. Chen, C.-H. H. Yang, J. Qi, P.-Y. Chen, X. Ma, and H.-S. Goan, “Variational quantum circuits for deep reinforcement learning,” IEEE Access, vol. 8, pp. 141 007–141 024, 2020.
  56. A. A. Clerk, M. H. Devoret, S. M. Girvin, F. Marquardt, and R. J. Schoelkopf, “Introduction to quantum noise, measurement, and amplification,” Reviews of Modern Physics, vol. 82, no. 2, p. 1155, 2010.
  57. W. Kozlowski and S. Wehner, “Towards large-scale quantum networks,” in Proceedings of the sixth annual ACM international conference on nanoscale computing and communication, 2019, pp. 1–7.
  58. D. Castelvecchi, “Ibm’s quantum cloud computer goes commercial,” Nature, vol. 543, no. 7644, 2017.
  59. C. H. Bennett and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing,” Theoretical computer science, vol. 560, pp. 7–11, 2014.
  60. H. Buhrman, R. Cleve, S. Massar, and R. de Wolf, “Nonlocality and communication complexity,” Rev. Mod. Phys., vol. 82, pp. 665–698, Mar 2010. [Online]. Available: https://link.aps.org/doi/10.1103/RevModPhys.82.665
  61. J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, “Proposed experiment to test local hidden-variable theories,” Physical review letters, vol. 23, no. 15, p. 880, 1969.
  62. D. M. Greenberger, M. A. Horne, and A. Zeilinger, “Going beyond bell’s theorem,” in Bell’s theorem, quantum theory and conceptions of the universe.   Springer, 1989, pp. 69–72.
  63. F. Kastrati and G. Moerkotte, “Generating optimal plans for boolean expressions,” in 2018 IEEE 34th International Conference on Data Engineering (ICDE).   IEEE, 2018, pp. 1013–1024.
  64. Y. Dulek, A. B. Grilo, S. Jeffery, C. Majenz, and C. Schaffner, “Secure multi-party quantum computation with a dishonest majority,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques.   Springer, 2020, pp. 729–758.
Citations (2)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up