QAIO 2026 Abstracts


Area 1 - QAIO

Full Papers
Paper Nr: 5
Title:

Illustration of Barren Plateaus in Quantum Computing

Authors:

Gerhard Stenzel, Tobias Rohe, Michael Kölle, Leo Sünkel, Jonas Stein and Claudia Linnhoff-Popien

Abstract: Variational Quantum Circuits (VQCs) have emerged as a promising paradigm for quantum machine learning in the NISQ era. While parameter sharing in VQCs can reduce the parameter space dimensionality and potentially mitigate the barren plateau phenomenon, it introduces a complex trade-off that has been largely overlooked. This paper investigates how parameter sharing, despite creating better global optima with fewer parameters, fundamentally alters the optimization landscape through deceptive gradients-regions where gradient information exists but systematically misleads optimizers away from global optima. Through systematic experimental analysis, we demonstrate that increasing degrees of parameter sharing generate more complex solution landscapes with heightened gradient magnitudes and measurably higher deceptiveness ratios. Our findings reveal that traditional gradient-based optimizers (Adam, SGD) show progressively degraded convergence as parameter sharing increases, with performance heavily dependent on hyperparameter selection. We introduce a novel gradient deceptiveness detection algorithm and a quantitative framework for measuring optimization difficulty in quantum circuits, establishing that while parameter sharing can improve circuit ex-pressivity by orders of magnitude, this comes at the cost of significantly increased landscape deceptiveness. These insights provide important considerations for quantum circuit design in practical applications, highlighting the fundamental mismatch between classical optimization strategies and quantum parameter landscapes shaped by parameter sharing.

Paper Nr: 6
Title:

Solving the Dial-a-Ride Problem with Time Windows Using Quantum Annealing and Quantum-Guided Cluster Algorithms

Authors:

Peter J. Eder, David Zambrano Manrique, Christian B. Mendl and Sarah Braun

Abstract: The Dial-a-Ride Problem (DARP) is a variant of the NP-hard vehicle routing problem with significant practical relevance in modern transportation systems. In this work, we introduce a novel Quadratic Unconstrained Binary Optimization formulation of the DARP that explicitly incorporates routing and time window constraints without requiring continuous variables, thereby making it compatible with quantum optimization approaches. We employ quantum annealing on D-Wave hardware to solve the resulting instances. As the hardware alone cannot identify the ground states for instances with 196 qubits, we enhance the obtained solutions using the Quantum-Guided Cluster Algorithm, a post-processing heuristic that leverages two-point correlations between sampled states. Our numerical results demonstrate that the proposed hybrid quantum-classical framework yields close-to-optimal solutions quickly for instances of up to 14 requests.

Paper Nr: 11
Title:

New QUBO Transformations to Improve Quantum and Simulated Annealing Performance for Quadratic Knapsack

Authors:

Nicolás Borrajo, Juan Marcos Ramírez, Farzam Nosrati, Jose Aguilar, Vincenzo Mancuso and Antonio Fernández Anta

Abstract: Recent advancements in quantum computing have demonstrated significant potential for solving combinatorial optimization problems, like the quadratic knapsack problem, a constrained binary optimization problem. However, current quantum and quantum-inspired algorithms often require transforming these constrained problems into an unconstrained form, known as Quadratic Unconstrained Binary Optimization (QUBO). Such transformations can significantly impact the algorithms’ speed and efficiency. In this study, we evaluate five existing transformation methods and propose four novel approaches. We assess all nine methods using Simulated Annealing and find that three of our approaches outperform existing methods in terms of execution time and the quality and quantity of feasible solutions found. Additionally, we tested these transformations on quantum annealers, which were unable to solve even small problem instances, due to limitations in connectivity and error rates. However, our results highlight the advantages of the new approaches, which reduce the total number of variables in the QUBO representation. This is a critical factor for enhanced performance on emerging quantum hardware, since it also reduces the required number of qubits and the embedding chain lengths.

Paper Nr: 12
Title:

Improving Credit Card Transaction Fraud Detection Using CVQBoosting

Authors:

Bethel Hui Ting Loke, Nirvik Sahoo, Bingyan Guan, Minrui Xu, Dev Verma and Paul R. Griffin

Abstract: This paper introduces a novel hybrid quantum-classical approach to credit card fraud detection using CVQ-Boost, a hybrid quantum-classical boosting algorithm executed on the photonic Dirac-3 processor from Quantum Computing Inc. (QCi). By integrating a diverse set of weak classifiers, which includes K-nearest neighbours (KNN), linear discriminant analysis, logistic regression, and XGBoost, within a hybrid quantum-classical ensemble, the proposed method demonstrates significant improvements over the latest published classical benchmarks. Experiments on a Kaggle credit card fraud dataset show that the quantum-enhanced model achieves a mean AUC-PR score of over 0.8, corresponding to an approximately 9% relative improvement over the best published classical baseline. This indicates an improved precision–recall trade-off which can reduce false positives at a fixed recall in operational settings. The study also highlights the trade-off between training runtime and detection performance, with KNN-based ensembles offering superior accuracy at higher computational cost. Results indicate that quantum machine learning pipelines leveraging photonic processors can deliver tangible advantages in rare-event detection tasks, suggesting a promising direction for operational fraud analytics in finance.

Paper Nr: 15
Title:

Adversarial Robustness of Quantum–Enhanced Graph Attention Networks

Authors:

Yaswitha Gujju, Romain Harang, Tetsuo Shibuya and Qibin Zhao

Abstract: Graph Neural Networks (GNNs) achieve strong performance on a wide range of graph learning tasks but are known to be highly vulnerable to adversarial perturbations of graph structure and node features. While recent work has explored quantum GNNs and attention mechanisms, their robustness under adversarial settings remains largely unexplored. In this work, we present a systematic robustness study of a hybrid classical–quantum Graph Attention Network (QuGAT), which integrates a previously proposed quantum attention module into a scalable message-passing architecture by extending the classical graph attention network (GAT). The quantum component is used exclusively to compute local attention coefficients, while feature aggregation and propagation remain classical, ensuring practical scalability. We evaluate QuGAT under a broad spectrum of adversarial threat models, including poisoning and node injection attacks, across standard node classification benchmarks. Our experiments show that quantum-enhanced attention consistently improves robustness compared to classical GNN baselines, including GAT, without sacrificing predictive performance. To better understand this behavior, we conduct extensive ablation studies over attention depth and number of heads, and provide a spectral analysis linking architectural choices to stability under perturbations. Our results suggest that hybrid quantum attention can act as an implicit regularizer, enhancing robustness in graph learning, and highlight the potential of quantum–classical models for reliable learning under adversarial conditions.

Paper Nr: 19
Title:

Parametric Quantum State Tomography with HyperRBMs

Authors:

Simon Tonner, Viet T. Tran and Richard Kueng

Abstract: Quantum state tomography (QST) is essential for validating quantum devices but suffers from exponential scaling in system size. Neural-network quantum states, such as Restricted Boltzmann Machines (RBMs), can efficiently parameterize individual many-body quantum states and have been successfully used for QST. However, existing approaches are point-wise and require retraining at every parameter value in a phase diagram. We introduce a parametric QST framework based on a hypernetwork that conditions an RBM on Hamiltonian control parameters, enabling a single model to represent an entire family of quantum ground states. Applied to the transverse-field Ising model, our HyperRBM achieves high-fidelity reconstructions from local Pauli measurements on 1D and 2D lattices across both phases and through the critical region. Crucially, the model accurately reproduces the fidelity susceptibility and identifies the quantum phase transition without prior knowledge of the critical point. These results demonstrate that hypernetwork-modulated neural quantum states provide an efficient and scalable route to tomographic reconstruction across full phase diagrams.

Short Papers
Paper Nr: 13
Title:

Multi-Level Encryption via Quantum Variational Autoencoder and Pseudo Quantum Random Walks

Authors:

Mohammad Iqbal, Ananda Satria Prasetiya and Masaomi Kimura

Abstract: Data leakage has been handled seriously, especially with the rise of artificial generative intelligence, provoking concerns for the security of both industrial and government sectors. This problem has become more challenging as quantum computing, which is known for breaking widely used public-key exchange protocols, is increasingly prevalent. Recent studies have sought to defend against quantum attacks by developing a public-key exchange protocol based on quantum computation. However, their protocol is relatively basic and may be easily violated. Therefore, we propose a multi-level encryption method that double-fools the attacker by integrating quantum variational autoencoders (QVAEs) into the protocol. The proposed method, called Multi-Level Quantum Encryption (ML-QE), first encrypts public keys via QVAE. Moreover, we continue the encryption using pseudo-quantum random walks to decompose the previous keys. In this work, the proposed method was evaluated on the MNIST and Omniglot datasets. We evaluated the importance of the proposed method across various key and pixel features. The proposed method with the double-fool mechanism provides stronger protection for the message, especially against passive adversaries. Furthermore, our method can effectively fool attackers by 10%, as they need to retrain the correct parameters from QVAEs.