Open Access

ARTICLE

Priyanka¹, Damodarakurup Sajeev², Shaik Ahmed³, Shankar Pidishety³, Ram Soorat^3,*
Journal of Quantum Computing, Vol.6, pp. 53-66, 2024, DOI:10.32604/jqc.2024.054000 - 14 November 2024
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 >

View

193

Download

62

Open Access

ARTICLE

Eric Bourreau¹, Gérard Fleury², Philippe Lacomme^2,*
Journal of Quantum Computing, Vol.6, pp. 25-51, 2024, DOI:10.32604/jqc.2024.048792 - 25 October 2024
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 >

View

210

Download

107

Open Access

ARTICLE

Mark Ariel Levin^*
Journal of Quantum Computing, Vol.6, pp. 15-24, 2024, DOI:10.32604/jqc.2024.047423 - 24 April 2024
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 >

View

637

Download

417

Open Access

ARTICLE

Artyom M. Grigoryan^1,*, Sos S. Agaian²
Journal of Quantum Computing, Vol.6, pp. 1-14, 2024, DOI:10.32604/jqc.2023.026981 - 30 January 2024
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 >

View

1325

Download

696