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

Studies in computational intelligence

Exploring IBM Quantum Experience

S. Gayathri Devi, S. Manjula Gandhi, S. Chandia, P. Boobalaragavan

Published Jan 1, 2023• 3 citations
Publisher
DOI
10.1007/978-981-19-9530-9_15

Related papers

Introduction to the IBM Q experience and quantum computing

Mehdi Bozzo-Rey, Robert Loredo

Conference of the Centre for Advanced Studies on Collaborative Research•Oct 29, 2018•12 citations

EVALUATION OF A PHYSICAL QUANTUM COMPUTER

John A. Heropoulos

In the past few years, IBM has expanded their Quantum Experience to include a high-level Python module called Qiskit as well as a 15-qubit machine (ibmq_16_melbourne). In order to evaluate IBM’s progress, we create an overview of the processes involved in developing and running an algorithm on IBM’s quantum machines. This includes exploring the new resources that IBM has made available recently including the Qiskit Python module. Then, we test textbook algorithms such as the Deutsch-Jozsa algorithm, Grover’s search algorithm, and Quantum Fourier Transform on ibmq_16_melbourne and compare the results with the output of a simulator. Constraints imposed by IBM’s Quantum Experience and significant differences between algorithm performance on IBM's quantum hardware and the simulator will be used to assess IBM’s quantum computing capabilities.

•Jun 1, 2020•0 citations

IBM Quantum Platform

Herbert M. Rubin

Springer eBooks•Jan 1, 2026•0 citations

Quantum Computing for Novice Learners: Developing the EduQubit Learning Environment

Haeun Choa, Dukhoi Koo

Abstract As quantum computing education expands into K-12 settings, learning environments that help novice learners understand abstract quantum concepts and explore quantum circuits are increasingly needed. This study developed EduQubit, a web-based quantum computing learning environment, and compared it with IBM Quantum Composer. A pretest–posttest study was conducted with 84 sixth-grade students from four intact classrooms at an elementary school in South Korea. The four classrooms were randomly assigned to the EduQubit or IBM Quantum Composer condition. EduQubit structured learning through step-by-step missions and subsequent open-ended exploration, whereas the IBM Quantum Composer condition relied on teacher guidance for the same learning tasks. The results included conceptual understanding of quantum computing, self-efficacy of quantum programming, subjective workload, and user experience; student interviews were also conducted.Student-level ANCOVA showed significantly higher posttest conceptual understanding in the EduQubit group after controlling for pretest scores (p = .036, partial η2 = .053). In contrast, quantum programming self-efficacy, subjective workload, and user experience did not differ significantly between the two groups. The exploratory classroom-level analysis showed the same directional pattern for conceptual understanding, although only four classrooms were included. Interviews indicated that both environments supported hands-on circuit exploration, but differed in how that exploration was guided and in the difficulties students encountered.These findings suggest that quantum computing learning environments for novice learners may benefit from going beyond circuit-manipulation functionality to structure learners’ exploration, with greater guidance during initial learning and progressively increasing autonomy. Given the small number of classrooms and the short intervention, the findings should be interpreted as exploratory rather than definitive evidence of the effects of the learning-environment.

•Sep 18, 2026•0 citations

What IBM’s result means for quantum computing

Shamini Bundell, Nick Petrić Howe

Nature•Jun 14, 2023•0 citations

The performance impact of the graph topology in Ibm’s Quantum devices on Grover’s search algorithm

Adrian Prodan, Vasile Manta, Alexandru Tudorache

In the context of actual information technology, data processing and storage have increased exponentially. Searching through large databases is considered an important problem, with multiple applications, where the properties of quantum computing could be used to find a potential solution. In this paper, the authors present an implementation for Grover’s search algorithm, a fast quantum algorithm for database search, and analyze the results for various graph topologies used in some of the real quantum devices provided by IBM. The algorithm provides a quadratic speedup over its classical counterpart (linear complexity). The code used in the implementation is possible with the help of the Qiskit framework and IBM Q Experience platform. Multiple tests with their results are presented. The experiments include three implementations of Grover’s search algorithm for different input register sizes: 2, 3 and 4 qubits, and exploration of multiple running configurations. We focus on the performance impact of selecting different groups of qubits on various real quantum devices, such as the probability to find the desired state and the execution time. For each experiment, we present the motivation, the results and their analysis.

International Conference on System Theory, Control and Computing (ICSTCC)•Oct 20, 2021•1 citation
In the past few years, IBM has expanded their Quantum Experience to include a high-level Python module called Qiskit as well as a 15-qubit machine (ibmq_16_melbourne). In order to evaluate IBM’s progress, we create an overview of the processes involved in developing and running an algorithm on IBM’s quantum machines. This includes exploring the new resources that IBM has made available recently including the Qiskit Python module. Then, we test textbook algorithms such as the Deutsch-Jozsa algorithm, Grover’s search algorithm, and Quantum Fourier Transform on ibmq_16_melbourne and compare the results with the output of a simulator. Constraints imposed by IBM’s Quantum Experience and significant differences between algorithm performance on IBM's quantum hardware and the simulator will be used to assess IBM’s quantum computing capabilities.
Abstract As quantum computing education expands into K-12 settings, learning environments that help novice learners understand abstract quantum concepts and explore quantum circuits are increasingly needed. This study developed EduQubit, a web-based quantum computing learning environment, and compared it with IBM Quantum Composer. A pretest–posttest study was conducted with 84 sixth-grade students from four intact classrooms at an elementary school in South Korea. The four classrooms were randomly assigned to the EduQubit or IBM Quantum Composer condition. EduQubit structured learning through step-by-step missions and subsequent open-ended exploration, whereas the IBM Quantum Composer condition relied on teacher guidance for the same learning tasks. The results included conceptual understanding of quantum computing, self-efficacy of quantum programming, subjective workload, and user experience; student interviews were also conducted.Student-level ANCOVA showed significantly higher posttest conceptual understanding in the EduQubit group after controlling for pretest scores (p = .036, partial η2 = .053). In contrast, quantum programming self-efficacy, subjective workload, and user experience did not differ significantly between the two groups. The exploratory classroom-level analysis showed the same directional pattern for conceptual understanding, although only four classrooms were included. Interviews indicated that both environments supported hands-on circuit exploration, but differed in how that exploration was guided and in the difficulties students encountered.These findings suggest that quantum computing learning environments for novice learners may benefit from going beyond circuit-manipulation functionality to structure learners’ exploration, with greater guidance during initial learning and progressively increasing autonomy. Given the small number of classrooms and the short intervention, the findings should be interpreted as exploratory rather than definitive evidence of the effects of the learning-environment.
In the context of actual information technology, data processing and storage have increased exponentially. Searching through large databases is considered an important problem, with multiple applications, where the properties of quantum computing could be used to find a potential solution. In this paper, the authors present an implementation for Grover’s search algorithm, a fast quantum algorithm for database search, and analyze the results for various graph topologies used in some of the real quantum devices provided by IBM. The algorithm provides a quadratic speedup over its classical counterpart (linear complexity). The code used in the implementation is possible with the help of the Qiskit framework and IBM Q Experience platform. Multiple tests with their results are presented. The experiments include three implementations of Grover’s search algorithm for different input register sizes: 2, 3 and 4 qubits, and exploration of multiple running configurations. We focus on the performance impact of selecting different groups of qubits on various real quantum devices, such as the probability to find the desired state and the execution time. For each experiment, we present the motivation, the results and their analysis.