Nitin Nayak
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Nitin Nayak has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Sven Groppe
Professorship of Artificial Intelligence, Technische Universität Bergakademie, Freiberg, 09599, Germany
5 shared publications - Umut Çalıkyılmaz
University of Lübeck, Lübeck, Germany
5 shared publications - Jinghua Groppe
Professorship of Artificial Intelligence, Technische Universität Bergakademie, Freiberg, 09599, Germany
4 shared publications - Tobias Winker
University of Lübeck Lübeck Germany
2 shared publications - Agniva Majumdar
ICMR-National Institute of Cholera and Enteric Diseases, Kolkata, India
1 shared publication - Alexandru Prisacaru
University of Lübeck, Lübeck, Germany
1 shared publication
Latest Publications
- Open Access
- 10 November 2026
- Published by MDPI AG in Information
- Vol. 17 (11) , 1130
Improved Join Order Optimization for Database Queries using Hybrid Quantum-Classical Approaches for QUBO Problems
Efficient query optimization is crucial for relational database systems, especially for optimizing join orders in complex queries. This work introduces a hybrid approach that integrates Eliminating Cartesian Products (ECP) with splitting the QUBO search space (SQSS) to reduce the size of the QUBO problem, minimizing binary variables and constraints. This improves the performance of the quantum algorithm while lowering hardware requirements. We evaluate our method using real-world SQL queries from the ErgastF1 dataset on quantum and classical algorithms, including Quantum Annealing (QA), Simulated Annealing (SA), QAOA, and VQE, implemented on D-Wave’s Quantum Annealer and universal gate-based simulators. Additionally, we analyze the impact of selectivity and SQSS on QUBO weight distribution and algorithmic performance, highlighting optimization efficiency for QA and SA. Experimental results show consistent optimal join orders and enhanced query optimization for various selectivity conditions, and it also highlights the limitations of current quantum hardware for complex queries. This study further confirms the potential of hybrid quantum-classical methods for scalable quantum-enhanced database optimization.
- 10 November 2026
- Published by MDPI AG in Information
- Vol. 17 (11) , 1130
Open AccessImproved Join Order Optimization for Database Queries using Hybrid Quantum-Classical Approaches for QUBO Problems
Efficient query optimization is crucial for relational database systems, especially for optimizing join orders in complex queries. This work introduces a hybrid approach that integrates Eliminating Cartesian Products (ECP) with splitting the QUBO search space (SQSS) to reduce the size of the QUBO problem, minimizing binary variables and constraints. This improves the performance of the quantum algorithm while lowering hardware requirements. We evaluate our method using real-world SQL queries from the ErgastF1 dataset on quantum and classical algorithms, including Quantum Annealing (QA), Simulated Annealing (SA), QAOA, and VQE, implemented on D-Wave’s Quantum Annealer and universal gate-based simulators. Additionally, we analyze the impact of selectivity and SQSS on QUBO weight distribution and algorithmic performance, highlighting optimization efficiency for QA and SA. Experimental results show consistent optimal join orders and enhanced query optimization for various selectivity conditions, and it also highlights the limitations of current quantum hardware for complex queries. This study further confirms the potential of hybrid quantum-classical methods for scalable quantum-enhanced database optimization.
- Open Access
OptiMA: A Transaction-Based Framework with Throughput Optimization for Very Complex Multi-Agent Systems
In recent years, the research of multi-agent systems has taken a direction to explore larger and more complex models to fulfill sophisticated tasks. We point out two possible pitfalls that might be caused by increasing complexity; susceptibilities to faults, and performance bottlenecks. To prevent the former threat, we propose a transaction-based framework to design very complex multi-agent systems (VCMAS). To address the second threat, we offer to integrate transaction scheduling into the proposed framework. We implemented both of these ideas to develop the OptiMA framework and show that it is able to facilitate the execution of VCMAS with more than a hundred agents. We also demonstrate the effect of transaction scheduling on such a system by showing improvements up to more than 16\%. Furthermore, we also performed a theoretical analysis on the transaction scheduling problem and provided practical tools that can be used for future research on it.
Open AccessOptiMA: A Transaction-Based Framework with Throughput Optimization for Very Complex Multi-Agent Systems
In recent years, the research of multi-agent systems has taken a direction to explore larger and more complex models to fulfill sophisticated tasks. We point out two possible pitfalls that might be caused by increasing complexity; susceptibilities to faults, and performance bottlenecks. To prevent the former threat, we propose a transaction-based framework to design very complex multi-agent systems (VCMAS). To address the second threat, we offer to integrate transaction scheduling into the proposed framework. We implemented both of these ideas to develop the OptiMA framework and show that it is able to facilitate the execution of VCMAS with more than a hundred agents. We also demonstrate the effect of transaction scheduling on such a system by showing improvements up to more than 16\%. Furthermore, we also performed a theoretical analysis on the transaction scheduling problem and provided practical tools that can be used for future research on it.
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 26-35
Quantum-Enhanced Transaction Scheduling with Reduced Complexity via Solving QUBO Iteratively using a Locking Mechanism
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 26-35
Open AccessQuantum-Enhanced Transaction Scheduling with Reduced Complexity via Solving QUBO Iteratively using a Locking Mechanism
- Open Access
- 18 March 2024
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 24 (1) , 21-32
Quantum Join Ordering by Splitting the Search Space of QUBO Problems
The join order has a huge impact on the execution time of a query, such that finding an optimal join order plays a crucial role in query optimization. However, join order optimization is known to be NP-hard. Hence, in this paper, we propose an approach for accelerating join order optimization by quantum computers. We extend our previous approach supporting bushy join trees by splitting the search space of possible join orders and solving each of these subspaces on currently available quantum computers to optimize the join of more relations than our previous approach. We have integrated our approach to quantum query optimization in the relational database management system PostgreSQL to conduct studies with real-world queries. In our experiments, we show that we can perform join order optimization up to 7 relations for real-world queries using quantum annealing and up to 8 relations for artificial queries using simulated annealing with a reasonable number of QUBO problems solved by D‑Wave’s Quantum Annealer. Furthermore, we show that our approach can be also used to perform join-order for queries joining five relations on circuit-based quantum computers running the quantum approximate optimization algorithm (QAOA) and variational quantum eigensolver (VQE) approaches.
- 18 March 2024
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 24 (1) , 21-32
Open AccessQuantum Join Ordering by Splitting the Search Space of QUBO Problems
The join order has a huge impact on the execution time of a query, such that finding an optimal join order plays a crucial role in query optimization. However, join order optimization is known to be NP-hard. Hence, in this paper, we propose an approach for accelerating join order optimization by quantum computers. We extend our previous approach supporting bushy join trees by splitting the search space of possible join orders and solving each of these subspaces on currently available quantum computers to optimize the join of more relations than our previous approach. We have integrated our approach to quantum query optimization in the relational database management system PostgreSQL to conduct studies with real-world queries. In our experiments, we show that we can perform join order optimization up to 7 relations for real-world queries using quantum annealing and up to 8 relations for artificial queries using simulated annealing with a reasonable number of QUBO problems solved by D‑Wave’s Quantum Annealer. Furthermore, we show that our approach can be also used to perform join-order for queries joining five relations on circuit-based quantum computers running the quantum approximate optimization algorithm (QAOA) and variational quantum eigensolver (VQE) approaches.
- Open Access
- 18 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Constructing Optimal Bushy Join Trees by Solving QUBO Problems on Quantum Hardware and Simulators
The join order is one of the most important factors that impact the speed of query processing. Its optimization is known to be NP-hard, such that it is worth investigating the benefits of utilizing quantum computers for optimizing join orders. Hence in this paper, we propose to model the join order problem as quadratic unconstrained binary optimization (QUBO) problem to be solved with various quantum approaches like QAOA, VQE, simulated annealing and quantum annealing. In this paper, we will show the enhanced performance using our QUBO formulation to find valid and optimal shots for real-world queries joining three, four and five relations on D-Wave quantum annealer. The highlight of this study will demonstrate that we were able to generate valid and optimal join orders for five relations using the D-Wave quantum annealer, with values of about 12% and 0.27% respectively and we were able to find the optimal bushy join trees. Experiments for the gate-based simulations were able to produce optimized join order for three and four relations including bushy trees using QAOA and VQE algorithms.
- 18 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessConstructing Optimal Bushy Join Trees by Solving QUBO Problems on Quantum Hardware and Simulators
The join order is one of the most important factors that impact the speed of query processing. Its optimization is known to be NP-hard, such that it is worth investigating the benefits of utilizing quantum computers for optimizing join orders. Hence in this paper, we propose to model the join order problem as quadratic unconstrained binary optimization (QUBO) problem to be solved with various quantum approaches like QAOA, VQE, simulated annealing and quantum annealing. In this paper, we will show the enhanced performance using our QUBO formulation to find valid and optimal shots for real-world queries joining three, four and five relations on D-Wave quantum annealer. The highlight of this study will demonstrate that we were able to generate valid and optimal join orders for five relations using the D-Wave quantum annealer, with values of about 12% and 0.27% respectively and we were able to find the optimal bushy join trees. Experiments for the gate-based simulations were able to produce optimized join order for three and four relations including bushy trees using QAOA and VQE algorithms.
- Open Access
- 15 June 2001
- Published by American Physical Society (APS) in Physical Review A
- Vol. 64 (1) , 013821
Aspects of nonlocality in atom-photon interactions in a cavity
We investigate a Bell-type inequality for probabilities of detected atoms formulated using atom-photon interactions in a cavity. We consider decoherence brought about by both atomic decay and cavity photon loss, and study its quantitative action in diminishing the atom-field and resultant atom-atom secondary correlations. We show that the effects of decoherence on nonlocality can be observed in a controlled manner in actual experiments involving a micromaser and also a microlaser.
- 15 June 2001
- Published by American Physical Society (APS) in Physical Review A
- Vol. 64 (1) , 013821
Open AccessAspects of nonlocality in atom-photon interactions in a cavity
We investigate a Bell-type inequality for probabilities of detected atoms formulated using atom-photon interactions in a cavity. We consider decoherence brought about by both atomic decay and cavity photon loss, and study its quantitative action in diminishing the atom-field and resultant atom-atom secondary correlations. We show that the effects of decoherence on nonlocality can be observed in a controlled manner in actual experiments involving a micromaser and also a microlaser.
- 1 January 1990
- Published by Springer Nature
- p. 809-813
Exact Quantum Theory of a Rydberg Atom in Cavities of Arbitrary Q at Finite Temperature T, and the 85Rb Atom Maser
- 1 January 1990
- Published by Springer Nature
- p. 809-813
Exact Quantum Theory of a Rydberg Atom in Cavities of Arbitrary Q at Finite Temperature T, and the 85Rb Atom Maser