Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.14719 · Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications (Q-Data)

A Toolbox to Understand the Physics of Quantum Data Management

Wolfgang Mauerer, Manuel Schönberger

quant-phcs.DBSubmitted May 14, 2026• Announced May 15, 2026• 1 citation
arXivHTMLPDF

Abstract

The application of quantum computing to data management has attracted growing interest, yet remains constrained by a limited understanding of how the physical behaviour of quantum devices relates to the structure and difficulty of database problems. In particular, evaluating quantum annealing approaches for combinatorial optimisation, which is central to many data management tasks, poses significant challenges beyond the scope of conventional empirical and complexity-theoretic methods. We present a computational toolbox for the systematic numerical analysis of quantum annealing processes derived from data management problem formulations. Adopting a physics-informed perspective, the toolbox enables the study of spectral and dynamical properties -- such as energy gaps and eigenstate structure -- that are inaccessible through direct hardware measurements, yet essential for understanding computational hardness and scaling behaviour. Our approach further provides derived quantities and visualisation techniques that support the interpretation of optimisation dynamics, the identification of structural similarities to canonical physical models, and the construction of reduced effective descriptions. By bridging methodological gaps between quantum computing and database systems research, this work establishes a principled foundation for evaluating quantum approaches and guiding future co-design efforts.

Comments
To appear at Q-Data@IEEE SIGMOD'26

Related papers

Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics

Steven Abel, Andrei Constantin, Luca A. Nutricati

Quantum annealing is a computational paradigm in which optimisation problems are mapped onto the energy landscape of an interacting quantum system and explored through its dynamical evolution. By continuously transforming a simple initial Hamiltonian into one whose ground state encodes the solution, the system traverses a complex landscape via a combination of quantum fluctuations, tunnelling processes, and dissipative dynamics. Unlike gate-based quantum computing, quantum annealing is a specialised and near-term approach aimed primarily at discrete optimisation and sampling tasks. While it is not expected to provide polynomial-time solutions to NP-hard problems in the worst case, it offers a physically motivated heuristic for navigating rugged energy landscapes that arise across science and engineering. Modern quantum annealers realise programmable spin systems with thousands of qubits, placing them among the largest controllable quantum devices currently available. As a result, their significance extends beyond optimisation: they also function as experimental platforms for studying non-equilibrium many-body quantum dynamics in regimes that are difficult to access using classical simulation. In this review we present an accessible introduction to the principles of quantum annealing, describe the main hardware platforms and algorithmic techniques, and analyse how tunnelling, spectral gaps, and open-system effects shape computational performance. We survey applications ranging from optimisation and machine learning to quantum simulation and many-body physics, and discuss the central challenges in benchmarking, scaling, and control. These perspectives position quantum annealing as a distinctive framework at the interface of optimisation, stochastic sampling, and programmable quantum dynamics, with a role that is complementary to both classical algorithms and gate-based quantum computing.

quant-pharXiv:2605.06857•Contemporary Physics•May 11, 2026•1 citation

QCE'24 Tutorial: Quantum Annealing -- Emerging Exploration for Database Optimization

Nayak, Nitin, Manuel Schönberger, Valter Uotila +4 more

Quantum annealing is a meta-heuristic approach tailored to solve combinatorial optimization problems with quantum annealers. In this tutorial, we provide a fundamental and comprehensive introduction to quantum annealing and modern data management systems and show quantum annealing's potential benefits and applications in the realm of database optimization. We demonstrate how to apply quantum annealing for selected database optimization problems, which are critical challenges in many data management platforms. The demonstrations include solving join order optimization problems in relational databases, optimizing sophisticated transaction scheduling, and allocating virtual machines within cloud-based architectures with respect to sustainability metrics. On the one hand, the demonstrations show how to apply quantum annealing on key problems of database management systems (join order selection, transaction scheduling), and on the other hand, they show how quantum annealing can be integrated as a part of larger and dynamic optimization pipelines (virtual machine allocation). The goal of our tutorial is to provide a centralized and condensed source regarding theories and applications of quantum annealing technology for database researchers, practitioners, and everyone who wants to understand how to potentially optimize data management with quantum computing in practice. Besides, we identify the advantages, limitations, and potentials of quantum computing for future database and data management research.

arXiv:2411.04638•Nov 7, 2024•6 citations

A Comprehensive Survey on Quantum Annealing: Applications, Challenges, and Future Research Directions

Rajeshwar Tripathi, Sahil Tomar, Sandeep Kumar

Quantum annealing has emerged as a transformative approach in solving combinatorial optimization problems by leveraging the principles of quantum mechanics. A comprehensive survey of quantum annealing is presented, delineating its foundational concepts, state-of-the-art advancements, and diverse applications across domains such as logistics, finance, machine learning, and energy optimization. Notable contributions include the introduction of a systematic benchmarking framework to evaluate quantum annealing against classical optimization techniques across metrics like time-to-target, scalability, and energy efficiency. Additionally, novel hybrid quantum-classical paradigms and hardware advancements are explored, addressing challenges in qubit connectivity, coherence, and noise resilience. Optimization problems are mapped to suitable quantum annealing platforms, offering practical guidelines for leveraging quantum technologies in real-world scenarios. Critical gaps in scalability and integration with machine learning are identified, with future research directions proposed to bridge these challenges. These findings provide a holistic understanding of quantum annealing's potential, offering a foundational resource for advancing quantum computing in optimization.

•Jan 7, 2025•6 citations

Quantum Annealing for Combinatorial Optimization: Foundations, Architectures, Benchmarks, and Emerging Directions

Rudraksh Sharma, Ravi Katukam, Arjun Nagulapally

Critical decision-making issues in science, engineering, and industry are based on combinatorial optimization; however, its application is inherently limited by the NP-hard nature of the problem. A specialized paradigm of analogue quantum computing, quantum annealing (QA), has been proposed to solve these problems by encoding optimization problems into physical energy landscapes and solving them by quantum tunnelling systematically through exploration of solution space. This is a critical review that summarizes the current applications of quantum annealing to combinatorial optimization and includes a theoretical background, hardware designs, algorithm implementation strategies, encoding and embedding schemes, protocols to benchmark quantum annealing, areas of implementation, and links with the quantum algorithms implementation with gate-based hardware and classical solvers. We develop a unified framework, relating adiabatic quantum dynamics, Ising and QUBO models, stoquastic and non-stoquastic Hamiltonians, and diabatic transitions to modern flux-qubit annealers (Chimera, Pegasus, Zephyr topologies), and emergent architectures (Lechner-Hauke-Zoller systems, Rydberg atom platforms), and hybrids of quantum and classical computation. Through our analysis, we find that overhead in embedding and encoding is the largest determinant of the scalability and performance (this is not just the number of qubits). Minor embeddings also usually have a physical qubit count per logical variable of between 5 and 12 qubits, which limits effective problem capacity by 80-92% and, due to chain-breaking errors, compromises the quality of solutions.

quant-pharXiv:2602.03101•International Journal for Research in Applied Science and Engineering Technology•Feb 4, 2026•3 citations

Exploring Quantum Computing for Solving Complex Engineering Problems

Raghav Agarwal

Quantum computing has emerged as a transformative paradigm, leveraging principles of quantum mechanics to tackle computationally intractable problems. This manuscript explores the potential of quantum computing for solving complex engineering problems—specifically optimization, simulation, and data analysis tasks—using technologies and methodologies available up to 2022. We examine both gate-based and quantum annealing approaches, outline experimental frameworks, and compare performance against classical counterparts. Results from simulated benchmark problems demonstrate promising speedups in select cases, though practical adoption is constrained by hardware limitations such as qubit coherence times and noise. The study concludes by highlighting avenues for integrating hybrid quantum-classical workflows in engineering, along with a discussion of current constraints and future directions. Over the past decade, research efforts have focused on understanding how quantum phenomena like superposition and entanglement can be harnessed to realize computational advantages for specific problem classes. In particular, combinatorial optimization problems—ubiquitous in engineering design and logistics—offer fertile ground for quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) and quantum annealing. Additionally, quantum simulation techniques, including the Variational Quantum Eigensolver (VQE), promise to accelerate the modeling of physical systems at the molecular and materials level, potentially informing the design of next-generation structural and functional materials. Beyond raw algorithmic performance, this paper carefully assesses the end‑to‑end workflow, accounting for overheads in problem encoding, error mitigation, and classical post‑processing. We also present a detailed analysis of resource utilization—quantified by qubit counts, circuit depths, and annealing schedules—highlighting trade‑offs between solution quality and execution time. Ultimately, our findings underscore that, while pure quantum speedups remain rare in 2022, hybrid approaches harnessing both quantum and classical resources can yield practical benefits for small‑to‑medium scale engineering tasks. This expanded evaluation provides a roadmap for researchers and practitioners interested in applying quantum computing to real‑world engineering challenges.

International Journal of Research in Modern Engineering & Emerging Technology•Dec 1, 2022•1 citation

Quantum Computing for Scheduling Problems: A Survey

Sirine Ben Ammar, Bilel Marzouki, Olfa Belkahla Driss

In recent years, quantum computing has emerged as a rapidly advancing interdisciplinary field, attracting growing attention from both academia and industry owing to its fundamentally novel approach to information processing and its potential to achieve computational capabilities beyond the reach of classical systems. This paper presents a structured review of quantum computing approaches applied to scheduling problems, which are among the most challenging NP-hard optimization problems. We first introduce fundamental principles of quantum computing, including gate-based models, quantum annealing, and hybrid frameworks. We then explore how various scheduling problems such as job-shop, flow-shop, and project scheduling-are encoded into quantum models, particularly using QUBO formulations suitable for current quantum devices. Finally, we discuss key limitations such as hardware constraints and model scalability, and we identify research directions to advance quantumenhanced scheduling methods. By grounding theory in empirical case studies and highlighting near-term deployable solutions, this study bridges the gap between quantum algorithm development and practical scheduling demands, offering a roadmap for researchers and practitioners in quantum optimization.

IEEE Afro-Mediterranean Conference on Artificial Intelligence (AMCAI)•Oct 14, 2025•0 citations
The application of quantum computing to data management has attracted growing interest, yet remains constrained by a limited understanding of how the physical behaviour of quantum devices relates to the structure and difficulty of database problems. In particular, evaluating quantum annealing approaches for combinatorial optimisation, which is central to many data management tasks, poses significant challenges beyond the scope of conventional empirical and complexity-theoretic methods.
We present a computational toolbox for the systematic numerical analysis of quantum annealing processes derived from data management problem formulations. Adopting a physics-informed perspective, the toolbox enables the study of spectral and dynamical properties -- such as energy gaps and eigenstate structure -- that are inaccessible through direct hardware measurements, yet essential for understanding computational hardness and scaling behaviour.
Our approach further provides derived quantities and visualisation techniques that support the interpretation of optimisation dynamics, the identification of structural similarities to canonical physical models, and the construction of reduced effective descriptions. By bridging methodological gaps between quantum computing and database systems research, this work establishes a principled foundation for evaluating quantum approaches and guiding future co-design efforts.
Quantum annealing is a computational paradigm in which optimisation problems are mapped onto the energy landscape of an interacting quantum system and explored through its dynamical evolution. By continuously transforming a simple initial Hamiltonian into one whose ground state encodes the solution, the system traverses a complex landscape via a combination of quantum fluctuations, tunnelling processes, and dissipative dynamics. Unlike gate-based quantum computing, quantum annealing is a specialised and near-term approach aimed primarily at discrete optimisation and sampling tasks. While it is not expected to provide polynomial-time solutions to NP-hard problems in the worst case, it offers a physically motivated heuristic for navigating rugged energy landscapes that arise across science and engineering. Modern quantum annealers realise programmable spin systems with thousands of qubits, placing them among the largest controllable quantum devices currently available. As a result, their significance extends beyond optimisation: they also function as experimental platforms for studying non-equilibrium many-body quantum dynamics in regimes that are difficult to access using classical simulation. In this review we present an accessible introduction to the principles of quantum annealing, describe the main hardware platforms and algorithmic techniques, and analyse how tunnelling, spectral gaps, and open-system effects shape computational performance. We survey applications ranging from optimisation and machine learning to quantum simulation and many-body physics, and discuss the central challenges in benchmarking, scaling, and control. These perspectives position quantum annealing as a distinctive framework at the interface of optimisation, stochastic sampling, and programmable quantum dynamics, with a role that is complementary to both classical algorithms and gate-based quantum computing.
Quantum annealing is a meta-heuristic approach tailored to solve combinatorial optimization problems with quantum annealers. In this tutorial, we provide a fundamental and comprehensive introduction to quantum annealing and modern data management systems and show quantum annealing's potential benefits and applications in the realm of database optimization. We demonstrate how to apply quantum annealing for selected database optimization problems, which are critical challenges in many data management platforms. The demonstrations include solving join order optimization problems in relational databases, optimizing sophisticated transaction scheduling, and allocating virtual machines within cloud-based architectures with respect to sustainability metrics. On the one hand, the demonstrations show how to apply quantum annealing on key problems of database management systems (join order selection, transaction scheduling), and on the other hand, they show how quantum annealing can be integrated as a part of larger and dynamic optimization pipelines (virtual machine allocation). The goal of our tutorial is to provide a centralized and condensed source regarding theories and applications of quantum annealing technology for database researchers, practitioners, and everyone who wants to understand how to potentially optimize data management with quantum computing in practice. Besides, we identify the advantages, limitations, and potentials of quantum computing for future database and data management research.
Quantum annealing has emerged as a transformative approach in solving combinatorial optimization problems by leveraging the principles of quantum mechanics. A comprehensive survey of quantum annealing is presented, delineating its foundational concepts, state-of-the-art advancements, and diverse applications across domains such as logistics, finance, machine learning, and energy optimization. Notable contributions include the introduction of a systematic benchmarking framework to evaluate quantum annealing against classical optimization techniques across metrics like time-to-target, scalability, and energy efficiency. Additionally, novel hybrid quantum-classical paradigms and hardware advancements are explored, addressing challenges in qubit connectivity, coherence, and noise resilience. Optimization problems are mapped to suitable quantum annealing platforms, offering practical guidelines for leveraging quantum technologies in real-world scenarios. Critical gaps in scalability and integration with machine learning are identified, with future research directions proposed to bridge these challenges. These findings provide a holistic understanding of quantum annealing's potential, offering a foundational resource for advancing quantum computing in optimization.
Critical decision-making issues in science, engineering, and industry are based on combinatorial optimization; however, its application is inherently limited by the NP-hard nature of the problem. A specialized paradigm of analogue quantum computing, quantum annealing (QA), has been proposed to solve these problems by encoding optimization problems into physical energy landscapes and solving them by quantum tunnelling systematically through exploration of solution space. This is a critical review that summarizes the current applications of quantum annealing to combinatorial optimization and includes a theoretical background, hardware designs, algorithm implementation strategies, encoding and embedding schemes, protocols to benchmark quantum annealing, areas of implementation, and links with the quantum algorithms implementation with gate-based hardware and classical solvers. We develop a unified framework, relating adiabatic quantum dynamics, Ising and QUBO models, stoquastic and non-stoquastic Hamiltonians, and diabatic transitions to modern flux-qubit annealers (Chimera, Pegasus, Zephyr topologies), and emergent architectures (Lechner-Hauke-Zoller systems, Rydberg atom platforms), and hybrids of quantum and classical computation. Through our analysis, we find that overhead in embedding and encoding is the largest determinant of the scalability and performance (this is not just the number of qubits). Minor embeddings also usually have a physical qubit count per logical variable of between 5 and 12 qubits, which limits effective problem capacity by 80-92% and, due to chain-breaking errors, compromises the quality of solutions.
Quantum computing has emerged as a transformative paradigm, leveraging principles of quantum mechanics to tackle computationally intractable problems. This manuscript explores the potential of quantum computing for solving complex engineering problems—specifically optimization, simulation, and data analysis tasks—using technologies and methodologies available up to 2022. We examine both gate-based and quantum annealing approaches, outline experimental frameworks, and compare performance against classical counterparts. Results from simulated benchmark problems demonstrate promising speedups in select cases, though practical adoption is constrained by hardware limitations such as qubit coherence times and noise. The study concludes by highlighting avenues for integrating hybrid quantum-classical workflows in engineering, along with a discussion of current constraints and future directions. Over the past decade, research efforts have focused on understanding how quantum phenomena like superposition and entanglement can be harnessed to realize computational advantages for specific problem classes. In particular, combinatorial optimization problems—ubiquitous in engineering design and logistics—offer fertile ground for quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) and quantum annealing. Additionally, quantum simulation techniques, including the Variational Quantum Eigensolver (VQE), promise to accelerate the modeling of physical systems at the molecular and materials level, potentially informing the design of next-generation structural and functional materials. Beyond raw algorithmic performance, this paper carefully assesses the end‑to‑end workflow, accounting for overheads in problem encoding, error mitigation, and classical post‑processing. We also present a detailed analysis of resource utilization—quantified by qubit counts, circuit depths, and annealing schedules—highlighting trade‑offs between solution quality and execution time. Ultimately, our findings underscore that, while pure quantum speedups remain rare in 2022, hybrid approaches harnessing both quantum and classical resources can yield practical benefits for small‑to‑medium scale engineering tasks. This expanded evaluation provides a roadmap for researchers and practitioners interested in applying quantum computing to real‑world engineering challenges.
In recent years, quantum computing has emerged as a rapidly advancing interdisciplinary field, attracting growing attention from both academia and industry owing to its fundamentally novel approach to information processing and its potential to achieve computational capabilities beyond the reach of classical systems. This paper presents a structured review of quantum computing approaches applied to scheduling problems, which are among the most challenging NP-hard optimization problems. We first introduce fundamental principles of quantum computing, including gate-based models, quantum annealing, and hybrid frameworks. We then explore how various scheduling problems such as job-shop, flow-shop, and project scheduling-are encoded into quantum models, particularly using QUBO formulations suitable for current quantum devices. Finally, we discuss key limitations such as hardware constraints and model scalability, and we identify research directions to advance quantumenhanced scheduling methods. By grounding theory in empirical case studies and highlighting near-term deployable solutions, this study bridges the gap between quantum algorithm development and practical scheduling demands, offering a roadmap for researchers and practitioners in quantum optimization.