Claim Missing Document
Check
Articles

Found 2 Documents
Search

Realization of Bernstein-Vazirani quantum algorithm in an interactive educational game David Gosal; Timothy Rudolf Tan; Yozef Tjandra; Hendrik Santoso Sugiarto
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 23, No 5: October 2025
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v23i5.26929

Abstract

Quantum algorithms are celebrated for their computational superiority over classical counterparts, yet they pose significant learning challenges for non-physics audiences. Among these, the Bernstein-Vazirani (BV) algorithm stands out for its quantum speedup by efficiently identifying a secret binary string. However, the accessibility of such algorithms remains constrained by their inherent technical complexity. To address this educational gap, this paper introduces a gamified, web-based tool that innovatively reinterprets the BV algorithm’s complex mathematical settings through an into engaging scenario of identifying broken lamps. Players assume the role of an investigator, utilizing both classical and quantum solvers to identify faulty lamps with minimal queries. By transforming the BV algorithm into an intuitive gameplay experience, the tool helps reducing technical barriers, making quantum concepts much more comprehensible for educators and students than traditional methods that demand rigorous mathematical understanding. Developed using Qiskit, IBM’s Python package for quantum computation, and deployed via Flask, a popular Python microframework for building web applications, the game effectively simplifies complex quantum algorithms while demonstrating the practical applications of quantum speedup. This contribution advances quantum education by merging technical depth with interactive design, fostering a broader understanding of quantum principles and inspiring new innovations in gamified learning.
Exhaustive Entanglement-Topology Enumeration and Edge-Vertex-Level Attribution in Quantum Feature Map Design for Classification Natanael Natanael; Hendrik Sugiarto; Yozef Tjandra
Journal of Computing Theories and Applications Vol. 4 No. 2 (2026): JCTA 4(2) 2026
Publisher : Universitas Dian Nuswantoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62411/jcta.17214

Abstract

Quantum kernel methods encode classical data into quantum states using specially designed feature-map circuits and then train a classical SVM on the resulting kernel matrix. Prior studies of entanglement structure typically compare only a few basic topologies, such as linear, circular, and full entanglement, leaving the broader space of entanglement graphs largely unexplored. This study exhaustively evaluates all possible entanglement topologies of a TwoLocal feature map and benchmarks them against classical methods and standard quantum feature maps on two synthetic datasets (Adhoc3_150 and Adhoc4_150) and two real-world datasets (Blood and Banknote). On Adhoc4_150, the best TwoLocal topology achieves an accuracy of 0.7556, matching Pauli Z; on Blood, it reaches 0.6889, exceeding RBF SVM and Pauli Z at 0.6667; and on Banknote, it achieves 1.0000, compared with 0.9778 for RBF SVM. In contrast, Random Forest achieves the highest accuracy on Adhoc3_150 at 0.8222, exceeding all evaluated quantum configurations. Across all four datasets, increasing the number of entangling pairs does not consistently improve accuracy, while the standard linear, circular, and full Pauli ZZ topologies never outperform Pauli Z. To further characterize this behavior, we propose a factorial linear modeling approach that quantifies the contribution of individual entanglement edges and qubit connectivity to classification accuracy. On Adhoc4_150, two edges exhibit significant negative effects, whereas Blood and Banknote show both significant positive and negative edge effects. The q0q1 edge is significant across all three four-feature datasets but reverses direction across datasets. These results indicate that the effect of entanglement depends jointly on the feature-map architecture, dataset, and specific qubit connections rather than on entanglement density alone. The proposed framework can also be applied to sampled topology sets, providing a basis for targeted entanglement analysis beyond exhaustively enumerable low-qubit systems.