Search Results (49)

Designing noise-robust parameterized quantum circuits (PQCs) is a central challenge in the noisy intermediate-scale quantum (NISQ) regime. Existing quantum architecture search methods rely on training large SuperCircuits and evaluating SubCircuits under noisy execution, resulting in high computational cost and architecture assessments that depend on task-specific optimization and device noise. In this work, we propose a training-free quantum architecture search framework based on information-theoretic expressibility measures rather than performance-based estimators. We empirically show that noise-free KL-divergence-based expressibility exhibits a consistent monotonic association with noisy task loss across diverse circuit architectures and realistic hardware noise models. Leveraging this relationship, we introduce an expressibility-guided evolutionary search that requires neither SuperCircuit training nor noisy execution during the search phase. Since expressibility is evaluated independently of hardware noise, the method is inherently device-agnostic, enabling architectures to be reused across multiple quantum devices without re-running the search. Experiments using IBM-derived Qiskit noise models demonstrate that the proposed approach achieves competitive performance compared to SuperCircuit-based baselines, while substantially reducing computational cost. These results establish expressibility as an effective information-theoretic surrogate for ranking PQC architectures under realistic noise. Full article

Quantum computing has the potential to transform modern computation by offering exponential advantages in areas such as cryptography, optimization, and intelligent data processing. To effectively realize these advantages, particularly in fault-tolerant and Noisy Intermediate-Scale Quantum (NISQ) environments, quantum circuits must be both resource-efficient and error-resilient. This paper presents a novel Binary-Coded Decimal (BCD) to Excess-3 code converter designed exclusively using the Clifford+T gate set, which is widely supported by fault-tolerant quantum hardware. The proposed design eliminates conventional 4-bit reversible adder-based implementations and instead employs an optimized logic structure based on Clifford+T-decomposed Peres gates. By leveraging Temporary Logical-AND gates and CNOT operations, the circuit achieves reduced T-count, circuit depth, and quantum cost as key metrics in fault-tolerant quantum computation. Functional correctness is verified through IBM Qiskit, Version 2.1 simulations for all valid BCD inputs. The proposed converter serves as a scalable and hardware-compatible arithmetic building block for resource-aware and AI-oriented quantum architectures. Full article

We present a theoretical framework integrating quantum optimization with DNA-based molecular storage for enhanced image compression, validated via classical simulation in IBM Qiskit. The proposed Quantum-DNA Image Compression (Q-DIC) framework formulates DNA codon selection as a quantum search problem, applying Grover’s algorithm to achieve $\mathrm{O}\left(\sqrt{N}\right)$ speedup in exploring the 4⁸ = 65,536-codon solution space. Key contributions include (1) novel multi-objective cost functions balancing reconstruction fidelity, thermodynamic stability, and synthesis feasibility; (2) quantum-inspired stabilizer codes achieving 10⁸-fold error suppression with 23% overhead reduction versus Reed–Solomon codes; (3) NISQ-compatible implementation achieving 12.3× compression on current quantum hardware. Simulation experiments across diverse image categories demonstrate 8.9× realistic compression ratio (18.3× theoretical maximum). Hardware validation on IBM Quantum systems achieved 10.8–11.2× compression, confirming practical viability. Critical assessment identifies implementation gaps: current hardware supports hundreds of gates versus the required amount of 60,000–800,000, and DNA synthesis costs require 1000× reduction for economic viability. Despite being simulation-based, this work establishes rigorous foundations for quantum–molecular hybrid architectures and provides a validated pathway for experimental confirmation. Full article

The main goal of this paper is to present a new way of processing a video file using a combination of multiple quantum methods. The design is built upon the novel enhanced quantum representation technique, NEQR, which is then expanded using ideas such as image segmentation, implemented with the help of one or multiple comparators, binarization and cycle shift. This approach allows us to process all frames in parallel according to the desired parameters—one or more thresholds. A demonstration circuit for the proposed design, using a couple of frames, that sums together all the concepts is implemented using the Python programming language and Qiskit open-source framework, made available by IBM. The circuits are analyzed in the experimental section, using the Simulator component and configured using the noise properties of real devices, where we present different relevant metrics obtained by processing the simulation results. Full article

This paper presents a simple experimental method for evaluating a superconducting quantum processor through two-qubit quantum state tomography and generalized GHZ-state benchmarking. The goal is to provide an accessible procedure for assessing hardware fidelity and entanglement capability. The method was demonstrated using IBM’s 127-qubit ibm_brisbane device, where each Bell state was prepared and reconstructed from 10,000 shots, and the resulting fidelities were compared to Qiskit Aer simulations. The method further examines multi-qubit GHZ states to gauge scalability. The main advantages are its simplicity, reproducibility on free IBM Quantum hardware, and its suitability for entry-level experimentation and performance evaluation. Full article

This article presents, for the first time, a new approach to building quantum circuits for the initialization of two multi-qubit superpositions, namely, two different superpositions in one circuit, not in two separate circuits. For this, we introduce the concept of the discrete two signal-induced heap transformation (D2siHT). This transformation is generated by two signals, or vectors, which we call generators. The quantum analogue of the D2siHT is described. It allows us to build a quantum circuit to transform two superpositions $|\mathit{x}⟩$ and $|\mathit{y}⟩$ into the first conventual basis states $|000\dots 0⟩$ and $|010\dots 0⟩$, respectively. Therefore, we can build a single quantum circuit to initiate two multi-qubit superpositions $|\mathit{x}⟩$ and $|\mathit{y}⟩$ from the basis states $|000\dots 0⟩$ and $|010\dots 0⟩$, respectively. Examples with quantum circuits for the preparation and transformation of two 2- and 3-qubit superpositions are described in detail. The results of circuit simulation using Qiskit are also presented. The main characteristic of the D2siHT is its path of processing the data of two generators and input qubits. We consider different paths to effectively compute the D2siHT. Such paths can reduce, for instance, the depth of the resulting quantum circuits, which can lead to a reduction in execution times and susceptibility to decoherence and noise. Multi-qubit superpositions are considered with real amplitudes, but the presented approach can be extended to initiate two such superpositions with complex amplitudes, as well. Full article

Current private comparison schemes primarily focus on comparing single secret integers using quantum technologies, while the area of private array content comparison remains relatively unexplored. To bridge this gap, we introduce a quantum private array content comparison (QPACC) scheme based on multi-qubit swap test. This scheme integrates rotation operation, quantum homomorphic encryption (QHE), and multi-qubit swap test to facilitate the equality comparison of array contents while ensuring their confidentiality. In our approach, participants encode their array elements into the phases of quantum states using rotation operations, which are then encrypted via QHE. These encrypted quantum states are sent to a semi-honest third party (TP) who decrypts the encoded quantum states and computes the modulus squared sum of the inner products of these decoded quantum states using the multi-qubit swap test, thereby determining the equality relationship of the array contents. To verify the feasibility of the proposed scheme, we conduct a case simulation using IBM Qiskit. Security analysis indicates that the proposed scheme is resistant to quantum attacks (including intercept-resend, entangle-measure, and quantum Trojan horse attacks) from outsider eavesdroppers and attempts by curious participants. Full article

This work presents and evaluates two threshold-based detection methods for the Six-State quantum key distribution protocol, considering a realistic scenario involving partial intercept–resend attack and channel noise. The statistical properties of the shared quantum bit error rate (QBER) are analyzed and used to estimate the attacker interception density from observed data. Building on this foundation, the work derives two optimal QBER detection thresholds designed to minimize both false positive and false negative rates, following, respectively, upper theoretical bounds and limit probability density function approach. A developed Qiskit simulation environment enables the evaluation and comparison of the two detection methods on simulated and real-inspired quantum systems with differing noise characteristics. This framework moves beyond theoretical analysis, allowing practical investigation of system noise effects on detection accuracy. Simulation results confirm that both methods are robust and effective, achieving high detection accuracy across all the tested configurations, thereby validating their applicability to real-world quantum communication systems. Full article

Multiparty quantum private comparison (MQPC) aims to determine the equality relationship of inputs from multiple participants while maintaining the confidentiality of these inputs. Current MQPC protocols primarily focus on utilizing d-level quantum states, which limits feasible implementation. To address this issue, we introduce an MQPC protocol that utilizes n-particle Greenberger–Horne–Zeilinger (GHZ) state to enable private comparison while preserving the secrecy of individual inputs. A semi-honest third party (TP), adhering to protocol specifications but potentially curious about private data, generates and distributes GHZ state qubits to all participants. Each party encodes their secret input through rotation operations on their allocated qubits and returns the modified state to the TP, which then performs single-particle quantum measurements to derive the outcomes without accessing the raw inputs. The protocol’s sequence distribution method yields a high qubit efficiency of 1/n, outperforming many existing MQPC protocols. Security analysis confirms resilience against external adversaries employing quantum attack strategies and collusion attempts among participants. Simulations using IBM Qiskit validate the feasibility of the protocol, which relies on GHZ state preparation, single-qubit operations, and single-particle quantum measurements. Full article

Optimizing Boolean function components to have the minimum number of inputs in order to reduce the memory space required during these functions in computing devices is a significant demand. This paper proposes a quantum computation approach based on the degree-of-entanglement quantum computation model to estimate the number of junta variables of an unknown Boolean function presented through an oracle. The time complexity of the developed quantum approach is independent of the number of inputs and depends on an allowable assigned error $ϵ$. Thus, the time complexity of the developed algorithm is $O\left({ϵ}^{-2}\right)$, compared to $O\left(2^{n+1}\right)$ in the traditional approach. Also, the memory space of the developed approach is linear, $O(2n+4)$, in terms of the number of inputs compared to the exponential memory space $O\left(2^{n+1}\right)$ using the traditional approach. Therefore, the developed quantum approach has exponential supremacy in comparison to the traditional approach. The developed approach was implemented practically using both the Qiskit simulator and the IBM real quantum computer. The obtained results expose high statistical fidelities between the empirical and theoretical results. Full article

This paper proposes a quantum algorithm, named Dicke state quantum search (DSQS), to set qubits in the Dicke state $|D_k^n⟩$ of D states in superposition to locate the target inputs or solutions of specific patterns among $2^n$ unstructured input instances, where n is the number of input qubits and $D=\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)=\mathrm{O}\left(n^k\right)$ for $min(k,n-k)\ll n/2$. Compared to Grover’s algorithm, a famous quantum search algorithm that calls an oracle and a diffuser O($\sqrt{2^n}$) times, DSQS requires no diffuser and calls an oracle only once. Furthermore, DSQS does not need to know the number of solutions in advance. We prove the correctness of DSQS with unitary transformations, and show that each solution can be found by DSQS with an error probability less than 1/3 through O($n^k$) repetitions, as long as $min(k,n-k)\ll n/2$. Additionally, this paper proposes a classical algorithm, named DSQS-VCP, to generate quantum circuits based on DSQS for solving the k-vertex cover problem (k-VCP), a well-known NP-complete (NPC) problem. Complexity analysis demonstrates that DSQS-VCP operates in polynomial time and that the quantum circuit generated by DSQS-VCP has a polynomial qubit count, gate count, and circuit depth as long as $min(k,n-k)\ll n/2$. We thus conclude that the k-VCP can be solved by the DSQS-VCP quantum circuit in polynomial time with an error probability less than 1/3 under the condition of $min(k,n-k)\ll n/2$. Since the k-VCP is NP-complete, NP and NPC problems can be polynomially reduced to the k-VCP. If the reduced k-VCP instance satisfies $min(k,n-k)\ll n/2$, then both the instance and the original NP/NPC problem instance to which it corresponds can be solved by the DSQS-VCP quantum circuit in polynomial time with an error probability less than 1/3. All statements of polynomial algorithm execution time in this paper apply only to VCP instances and similar instances of other problems, where $min(k,n-k)\ll n/2$. Thus, they imply neither NP ⊆ BQP nor P = NP. In this restricted regime of $min(k,n-k)\ll n/2$, the Dicke state subspace has a polynomial size of $D=\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)=\mathrm{O}\left(n^k\right)$, and our DSQS algorithm samples from it without asymptotic superiority over exhaustive enumeration. Nevertheless, DSQS may be combined with other quantum algorithms to better exploit the strengths of quantum computation in practice. Experimental results using IBM Qiskit packages show that the DSQS-VCP quantum circuit can solve the k-VCP successfully. Full article

This manuscript is intended for readers who have a general interest in the subject of quantum computation and provides an overview of the most significant developments in the field. It begins by introducing foundational concepts from quantum mechanics—such as superposition, entanglement, and the no-cloning theorem—that underpin quantum computation. The primary computational models are discussed, including gate-based (circuit) quantum computing, adiabatic quantum computing, measurement-based quantum computing and the quantum Turing machine. A selection of significant quantum algorithms are reviewed, notably Grover’s search algorithm, Shor’s factoring algorithm, and Quantum Singular Value Transformation (QSVT), which enables efficient solutions to linear algebra problems on quantum devices. To assess practical performance, we compare quantum and classical implementations of support vector machines (SVMs) using several synthetic datasets. These experiments offer insight into the capabilities and limitations of near-term quantum classifiers relative to classical counterparts. Finally, we review leading quantum programming platforms—including Qiskit, PennyLane, and Cirq—and discuss their roles in bridging theoretical models with real-world quantum hardware. The paper aims to provide a concise yet comprehensive guide for those looking to understand both the theoretical foundations and applied aspects of quantum computing. Full article

Quantum mechanics (QM) revolutionizes drug discovery by providing precise molecular insights unattainable with classical methods. This review explores QM’s role in computational drug design, detailing key methods like density functional theory (DFT), Hartree–Fock (HF), quantum mechanics/molecular mechanics (QM/MM), and fragment molecular orbital (FMO). These methods model electronic structures, binding affinities, and reaction mechanisms, enhancing structure-based and fragment-based drug design. This article highlights the applicability of QM to various drug classes, including small-molecule kinase inhibitors, metalloenzyme inhibitors, covalent inhibitors, and fragment-based leads. Quantum computing’s potential to accelerate quantum mechanical (QM) calculations is discussed alongside novel applications in biological drugs (e.g., gene therapies, monoclonal antibodies, biosimilars), protein–receptor dynamics, and new therapeutic indications. A molecular dynamics (MD) simulation exercise is included to teach QM/MM applications. Future projections for 2030–2035 emphasize QM’s transformative impact on personalized medicine and undruggable targets. The qualifications and tools required for researchers, including advanced degrees, programming skills, and software such as Gaussian and Qiskit, are outlined, along with sources for training and resources. Specific publications on quantum mechanics (QM) in drug discovery relevant to QM and molecular dynamics (MD) studies are incorporated. Challenges, such as computational cost and expertise requirements, are addressed, offering a roadmap for educators and researchers to leverage quantum mechanics (QM) and molecular dynamics (MD) in drug discovery. Full article

Quantum computing is emerging as a key enabler of digital transformation in data science and STEM education. This study investigates how quantum computing can be meaningfully integrated into higher education by combining a dual approach: a structured assessment of the specialized literature and a practical evaluation of educational tools. First, a science mapping study based on 281 peer-reviewed publications indexed in Scopus (2015–2024) identifies growth trends, thematic clusters, and international collaboration networks at the intersection of quantum computing, data science, and education. Second, a comparative analysis of widely used educational platforms—such as Qiskit, Quantum Inspire, QuTiP, and Amazon Braket—is conducted using pedagogical criteria including accessibility, usability, and curriculum integration. The results highlight a growing convergence between quantum technologies, artificial intelligence, and data-driven learning. A strategic framework and roadmap are proposed to support the gradual and scalable adoption of quantum literacy in university-level STEM programs. Full article

This article presents a novel approach to the decomposition of unitary operations for 3-qubit systems by 28 controlled rotations and no permutations. The QR decomposition is described, which is based on the concept of the discrete signal-induced heap transform (DsiHT) and its quantum analogue. This transform is generated by a given signal and may use different paths, or orders, of processing the data, and, among them, one can find paths that allow one to construct efficient quantum circuits for implementing multi-qubit unitary gates. The case of real unitary matrices is considered. The proposed approach is described in detail, and quantum circuits are presented for computing 3-qubit operations. This approach allowed us to write simple Qiskit codes to implement the decomposition of 3-qubit operations. Examples with quantum circuits for the quantum 3-qubit quantum cosine and Hartley transforms are described. Full article