This work presents InferQ, a database-oriented benchmark for quantum circuit simulation, and finds that RDBMSs achieve better peak memory usage than Qiskit Aer on more than 50% of the circuits generated by InferQ.
Abstract
Recent work suggests that relational database management systems (RDBMSs) can execute quantum circuit simulation by compiling the simulation into SQL workloads (primarily join-and-aggregate tensor contractions). While early results are promising, they largely focus on a narrow set of highly structured circuits and offer limited support for systematic database research, such as query optimization, physical design, and engine-level evaluation across a broad range of circuits. We present InferQ, a database-oriented benchmark for quantum circuit simulation. InferQ generates general, compositional circuits by assembling subcircuits from a set of circuit templates, emits each simulation task as an RDBMS-ready SQL workload, and extracts circuit and query features (static, graph, SQL, and dynamic) for workload characterization. InferQ also releases a large dataset of 202,975 circuits online, with a web-based viewer to support searching, filtering, and downloading circuits and feature records. In experiments across RDBMS engines (PostgreSQL, SQLite, DuckDB, and Umbra) and the widely used Qiskit Aer simulator, we find that RDBMSs achieve better peak memory usage than Qiskit Aer on more than 50% of the circuits generated by InferQ. Moreover, using InferQ features, lightweight machine learning models (linear and tree-based models) can accurately predict when SQL execution is preferable (with accuracy up to 95.6% for runtime and 97.4% for memory), enabling data-centric simulator selection and opening the door to principled optimization of SQL-based quantum circuit simulation.
We present Presto Vector Search, a SQL-native distributed vector search system built on the observation that partition-based vector search decomposes naturally into relational algebra—partitioning as scalar functions, index construction as GROUP BY aggregation, search as equi-joins—with the local index type (FLAT, IVF,...
Zhi-Chen Xu, Ge Gao, Ke Wang et al.· Proceedings of the VLDB Endo...· 1 citation
A line of work that treats future-proofness as an abstraction-design problem is summarized, identifying boundaries across the data processing stack where concerns must evolve independently, and design interfaces that preserve enough structure across that boundary for optimization.
Jana Giceva· Proceedings of the VLDB Endo...· 0 citations
Recent work has shown that LLMs can synthesize highly specialized database systems for fixed workloads, but existing approaches typically assume static data and replace the database's native storage with generated representations. We present JetStream, a system for generating query-specific accelerators that instead ex...
DataKernelBench is introduced, which translates SQL into validated PyTorch TorchPlan programs and evaluates LLMs that optimize either the core tensor-bounded snippet or the full query in CUDA or Triton through execution-guided repair and finds that higher-performing implementations commonly use kernel fusion and execut...
A novel code-generating engine with factorization that enables intra-query-parallelized query execution on factorized representations and generates code to overcome their CPU-unfriendly layout, offering a unified and scalable solution for modern workloads.
Stefan Lehner, Thomas Neumann· Proceedings of the VLDB Endo...· 0 citations
This paper presents MetaSieve, a metapath selection layer that determines which metapaths to retain and which to prune, and shows that MetaSieve consistently reduces per-epoch training time by large margins while maintaining and often improving accuracy.
Fahim Shahriar Khan, Ashraf Aboulnaga· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.