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

International Journal of Advance Interdisciplinary Research

Qubits and Superposition: The Quantum Building Block of Computation

Published Feb 20, 2026• 0 citations
Publisher
DOI
10.66095/ijair.2026.v2.s1.3

Related papers

The Basic Building Blocks of Quantum Computing

Beatrice Marie Ellerhoff

Essentials•Jan 1, 2022•1 citation

Quantum Search Algorithms for Constraint Satisfaction and Optimization Problems Using Grover's Search and Quantum Walk Algorithms with Advanced Oracle Design

Abdirahman Alasow

The field of quantum computing has emerged as a powerful tool for solving and optimizing combinatorial optimization problems. To solve many real-world problems with many variables and possible solutions for constraint satisfaction and optimization problems, the required number of qubits of scalable hardware for quantum computing is the bottleneck in the current generation of quantum computers. In this dissertation, we will demonstrate advanced, scalable building blocks for the quantum search algorithms that have been implemented in Grover's search algorithm and the quantum walk algorithm. The scalable building blocks are used to reduce the required number of qubits in the design. The proposed architecture effectively scales and optimizes the number of qubits needed to solve large problems with a limited number of qubits. Thus, scaling and optimizing the number of qubits that can be accommodated in quantum algorithm design directly reflect on performance. Also, accuracy is a key performance metric related to how accurately one can measure quantum states. The search space of quantum search algorithms is traditionally created by using the Hadamard operator to create superposition. However, creating superpositions for problems that do not need all superposition states decreases the accuracy of the measured states. We present an efficient quantum circuit design that the user has control over to create the subspace superposition states for the search space as needed. Using only the subspace states as superposition states of the search space will increase the rate of correct solutions. In this dissertation, we will present the implementation of practical problems for Grover's search algorithm and quantum walk algorithm in logic design, logic puzzles, and machine learning problems such as SAT, MAX-SAT, XOR-SAT, and like SAT problems in EDA, and mining frequent patterns for association rule mining.

•Apr 15, 2024•0 citations

A Novel Design of Quantum Multiplexer and its Identity Rules-Based Optimization for the Spin-Torque-Based n-Qubit Architecture

Anant Aravind Kulkarni, S. S. Gayathri, Dev Ranjan Das +1 more

Quantum computing (QC) imitates particle behavior at the sub-atomic level. Quantum gates are based on quantum mechanical phenomena such as superposition and entanglement. The obstacle to the realization of reversible computing is the huge number of operations in terms of quantum gates. Therefore, novel designs of reversible computing blocks with a minimum number of elementary operations with high fidelity are necessary. Therefore, a novel design of multiplexer is proposed in this article, which is composed of only 1-CNOT and 1-Toffoli gates. Moreover, the reduced decomposition of the multiplexer and its identity rule-based optimization for the spin-torque-based n-qubit architecture is discussed. To validate the design, the QISKIT implementation of the novel design in terms of amplitude, probability, and Q-sphere representation is carried out. The results are encouraging to realize the reversible computing involving quantum multiplexer as one of the building blocks.

IEEE Transactions on Magnetics•Oct 1, 2024•0 citations

SUPERPOSITION, ENTANGLEMENT, AND QUANTUM COMPUTATION

WORLD SCIENTIFIC eBooks•Jul 21, 2019•0 citations

Computation with Qubits

WORLD SCIENTIFIC eBooks•Oct 28, 2013•0 citations

A UNIVERSAL QUANTUM ESTIMATOR

L. C. Kwek, Keng Wah Choo, Jiangfeng Du +8 more

Almost all computational tasks in the modern computer can be designed from basic building blocks. These building blocks provide a powerful and efficient language for describing algorithms. In quantum computers, the basic building blocks are the quantum gates. In this tutorial, we will look at quantum gates that act on one and two qubits and briefly discuss how these gates can be used in quantum networks.

International Journal of Quantum Information•Nov 1, 2005•0 citations
The field of quantum computing has emerged as a powerful tool for solving and optimizing combinatorial optimization problems. To solve many real-world problems with many variables and possible solutions for constraint satisfaction and optimization problems, the required number of qubits of scalable hardware for quantum computing is the bottleneck in the current generation of quantum computers. In this dissertation, we will demonstrate advanced, scalable building blocks for the quantum search algorithms that have been implemented in Grover's search algorithm and the quantum walk algorithm. The scalable building blocks are used to reduce the required number of qubits in the design. The proposed architecture effectively scales and optimizes the number of qubits needed to solve large problems with a limited number of qubits. Thus, scaling and optimizing the number of qubits that can be accommodated in quantum algorithm design directly reflect on performance. Also, accuracy is a key performance metric related to how accurately one can measure quantum states. The search space of quantum search algorithms is traditionally created by using the Hadamard operator to create superposition. However, creating superpositions for problems that do not need all superposition states decreases the accuracy of the measured states. We present an efficient quantum circuit design that the user has control over to create the subspace superposition states for the search space as needed. Using only the subspace states as superposition states of the search space will increase the rate of correct solutions. In this dissertation, we will present the implementation of practical problems for Grover's search algorithm and quantum walk algorithm in logic design, logic puzzles, and machine learning problems such as SAT, MAX-SAT, XOR-SAT, and like SAT problems in EDA, and mining frequent patterns for association rule mining.
Quantum computing (QC) imitates particle behavior at the sub-atomic level. Quantum gates are based on quantum mechanical phenomena such as superposition and entanglement. The obstacle to the realization of reversible computing is the huge number of operations in terms of quantum gates. Therefore, novel designs of reversible computing blocks with a minimum number of elementary operations with high fidelity are necessary. Therefore, a novel design of multiplexer is proposed in this article, which is composed of only 1-CNOT and 1-Toffoli gates. Moreover, the reduced decomposition of the multiplexer and its identity rule-based optimization for the spin-torque-based n-qubit architecture is discussed. To validate the design, the QISKIT implementation of the novel design in terms of amplitude, probability, and Q-sphere representation is carried out. The results are encouraging to realize the reversible computing involving quantum multiplexer as one of the building blocks.