About the Journal
Journal of Quantum Computing is a high-impact, international journal publishing cutting-edge experimental and theoretical research in all areas of Quantum Computing and Information Science. Topics of interest include quantum computer science, quantum machine learning, quantum secure communications, quantum information processing, quantum imaging and networking, quantum cryptography, entanglement and discord, quantum algorithms, quantum error correction and fault tolerance, and experimental platforms for quantum information.
Read More
-
Open Access
ARTICLE
Analysis of Innovative Quantum Optimization Solutions for Shor’s Period Finding Algorithm Applied to the Computation of
Journal of Quantum Computing, Vol.7, pp. 17-38, 2025, DOI:10.32604/jqc.2025.059089 - 08 April 2025
Abstract In the rapidly evolving domain of quantum computing, Shor’s algorithm has emerged as a groundbreaking innovation with far-reaching implications for the field of cryptographic security. However, the efficacy of Shor’s algorithm hinges on the critical step of determining the period, a process that poses a substantial computational challenge. This article explores innovative quantum optimization solutions that aim to enhance the efficiency of Shor’s period finding algorithm. The article focuses on quantum development environments, such as Qiskit and Cirq. A detailed analysis is conducted on three notable tools: Qiskit Transpiler, BQSKit, and Mitiq. The performance of More >
-
Open Access
ARTICLE
A Genetic Approach to Minimising Gate and Qubit Teleportations for Multi-Processor Quantum Circuit Distribution
Journal of Quantum Computing, Vol.7, pp. 1-15, 2025, DOI:10.32604/jqc.2025.061275 - 21 March 2025
Abstract Distributed Quantum Computing (DQC) provides a means for scaling available quantum computation by interconnecting multiple quantum processor units (QPUs). A key challenge in this domain is efficiently allocating logical qubits from quantum circuits to the physical qubits within QPUs, a task known to be NP-hard. Traditional approaches, primarily focused on graph partitioning strategies, have sought to reduce the number of required Bell pairs for executing non-local CNOT operations, a form of gate teleportation. However, these methods have limitations in terms of efficiency and scalability. Addressing this, our work jointly considers gate and qubit teleportations introducing… More >
-
Open Access
ARTICLE
3-Qubit Circular Quantum Convolution Computation Using the Fourier Transform with Illustrative Examples
Journal of Quantum Computing, Vol.6, pp. 1-14, 2024, DOI:10.32604/jqc.2023.026981
Abstract In this work, we describe a method of calculation of the 1-D circular quantum convolution of signals represented by 3-qubit superpositions in the computational basis states. The examples of the ideal low pass and high pass filters are described and quantum schemes for the 3-qubit circular convolution are presented. In the proposed method, the 3-qubit Fourier transform is used and one addition qubit, to prepare the quantum superposition for the inverse quantum Fourier transform. It is considered that the discrete Fourier transform of one of the signals is known and calculated in advance and only More >
-
Open Access
ARTICLE
Pancreatic Cancer Data Classification with Quantum Machine Learning
Journal of Quantum Computing, Vol.5, pp. 1-13, 2023, DOI:10.32604/jqc.2023.044555
Abstract Quantum computing is a promising new approach to tackle the complex real-world computational problems by harnessing the power of quantum mechanics principles. The inherent parallelism and exponential computational power of quantum systems hold the potential to outpace classical counterparts in solving complex optimization problems, which are pervasive in machine learning. Quantum Support Vector Machine (QSVM) is a quantum machine learning algorithm inspired by classical Support Vector Machine (SVM) that exploits quantum parallelism to efficiently classify data points in high-dimensional feature spaces. We provide a comprehensive overview of the underlying principles of QSVM, elucidating how different… More >
-
Open Access
ARTICLE
Optimized General Uniform Quantum State Preparation
Journal of Quantum Computing, Vol.6, pp. 15-24, 2024, DOI:10.32604/jqc.2024.047423
Abstract Quantum algorithms for unstructured search problems rely on the preparation of a uniform superposition, traditionally achieved through Hadamard gates. However, this incidentally creates an auxiliary search space consisting of nonsensical answers that do not belong in the search space and reduce the efficiency of the algorithm due to the need to neglect, un-compute, or destructively interfere with them. Previous approaches to removing this auxiliary search space yielded large circuit depth and required the use of ancillary qubits. We have developed an optimized general solver for a circuit that prepares a uniform superposition of any N More >
-
Open Access
ARTICLE
Advancing Quantum Technology: Insights Form Mach-Zehnder Interferometer in Quantum State Behaviour and Error Correction
Journal of Quantum Computing, Vol.6, pp. 53-66, 2024, DOI:10.32604/jqc.2024.054000
Abstract The present study delves into the application of investigating quantum state behaviour, particularly focusing on coherent and superposition states. These states, characterized by their remarkable stability and precision, have found extensive utility in various domains of quantum mechanics and quantum information processing. Coherent states are valuable for manipulating quantum systems with accuracy. Superposition states allow quantum systems to exist in numerous configurations at the same time, which paves the way for quantum computing’s capacity for parallel processing. The research accentuates the crucial role of quantum error correction (QEC) in ensuring the stability and reliability of… More >
-
Open Access
ARTICLE
Comparison among Classical, Probabilistic and Quantum Algorithms for Hamiltonian Cycle Problem
Journal of Quantum Computing, Vol.5, pp. 55-70, 2023, DOI:10.32604/jqc.2023.044786
Abstract The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a Hamiltonian cycle problem, using different models of computations and especially the probabilistic and quantum ones. Starting from the classical probabilistic approach of random walks, we take a step to the quantum direction by involving an ad hoc designed Quantum Turing Machine (QTM), which can be a useful conceptual project tool for quantum algorithms. Introducing several More >
-
Open Access
ARTICLE
Design and Implementation of Quantum Repeaters: Insights on Quantum Entanglement Purification
Journal of Quantum Computing, Vol.5, pp. 25-40, 2023, DOI:10.32604/jqc.2023.045654
Abstract Quantum communication is a groundbreaking technology that is driving the future of information transmission and communication technologies to a new paradigm. It relies on quantum entanglement to facilitate the transmission of quantum states between parties. Quantum repeaters are crucial for facilitating long-distance quantum communication. These quantum devices act as intermediaries between adjacent communication channel segments within a fragmented quantum network, allowing for entanglement swapping between the channel segments. This entanglement swapping process establishes entanglement links between the endpoints of adjacent segments, gradually creating a continuous entanglement connection over the entire length of the transmission channel. More >
-
Open Access
ARTICLE
On Factorization of N-Qubit Pure States and Complete Entanglement Analysis of 3-Qubit Pure States Containing Exactly Two Terms and Three Terms
Journal of Quantum Computing, Vol.5, pp. 15-24, 2023, DOI:10.32604/jqc.2023.043370
Abstract A multi-qubit pure quantum state is called separable when it can be factored as the tensor product of 1-qubit pure quantum states. Factorizing a general multi-qubit pure quantum state into the tensor product of its factors (pure states containing a smaller number of qubits) can be a challenging task, especially for highly entangled states. A new criterion based on the proportionality of the rows of certain associated matrices for the existence of certain factorization and a factorization algorithm that follows from this criterion for systematically extracting all the factors is developed in this paper. 3-qubit More >
-
Open Access
ARTICLE
Effects of T-Factor on Quantum Annealing Algorithms for Integer Factoring Problem
Journal of Quantum Computing, Vol.5, pp. 41-54, 2023, DOI:10.32604/jqc.2023.045572
Abstract The hardness of the integer factoring problem (IFP) plays a core role in the security of RSA-like cryptosystems that are widely used today. Besides Shor’s quantum algorithm that can solve IFP within polynomial time, quantum annealing algorithms (QAA) also manifest certain advantages in factoring integers. In experimental aspects, the reported integers that were successfully factored by using the D-wave QAA platform are much larger than those being factored by using Shor-like quantum algorithms. In this paper, we report some interesting observations about the effects of QAA for solving IFP. More specifically, we introduce a metric, More >
-
Open Access
ARTICLE
A Protocol for Conversion of Path-Spin to Spin-Spin Quantum Entanglement
Journal of Quantum Computing, Vol.5, pp. 71-79, 2023, DOI:10.32604/jqc.2023.045164
Abstract The present model deals with a protocol which involves the generation and conversion of entanglement from path-spin (P-S) hybrid entanglement associated with half-spin particle to spin-spin (S-S) interparticle entanglement. This protocol finds its applications in quantum information processing via a series of operations which include a beam splitter, spin flipper, spin measurement, classical channel, unitary transformations. Finally, it leads to two particles having completely entangled spin variables, without any requirement of any simultaneous operation on the two particles. More >
-
Open Access
ARTICLE
IQAOA for Two Routing Problems: A Methodological Contribution with Application to TSP and VRP
Journal of Quantum Computing, Vol.6, pp. 25-51, 2024, DOI:10.32604/jqc.2024.048792
Abstract The paper presents a novel quantum method for addressing two fundamental routing problems: the Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP), both central to routing challenges. The proposed method, named the Indirect Quantum Approximate Optimization Algorithm (IQAOA), leverages an indirect solution representation using ranking. Our contribution focuses on two main areas: 1) the indirect representation of solutions, and 2) the integration of this representation into an extended version of QAOA, called IQAOA. This approach offers an alternative to QAOA and includes the following components: 1) a quantum parameterized circuit designed to simulate… More >
Copyright © 2025 The Author(s). Published by Tech Science Press.
Open Access
Login
Register
Submit a Paper
Propose a Special lssue
