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 Innovative Research in Science Engineering and Technology

Quantum Algorithm: A Classical Realizationin High-Performance Computing Using MPI

Donald Jefferson Thabah N, Balach, ran K, Anirban Roy, John Kiran A

Published Jan 1, 2014• 0 citations
OpenAlex

Abstract

Quantum computing has been an attractive method adapted for increasing the computational speed and it is governed by the laws of quantum mechanics. Quantum computers are not limited to two states as compared with classical systems, but they encode information as quantum bits or qubits. A qubit represents atoms, ions, photons or electrons and their respective control devices that are working together to act as computer memory and processors. The power of quantum computing lies in its multi-state representation which makes it million times more powerful than classical computer systems. Quantum computers also use another aspect of quantum mechanics known as entanglement, which is a property where multiple objects existing in the states that can be linked together. There exists a standard/specification of message passing library, known as message passing interface (MPI) that can be used for achieving high-performance computing. The goal of MPI is to provide a standardized framework for writing message-passing programs which can be used for programming systems that require distributed processing. The superposition principle used by the quantum algorithm can be simulated in the MPI environment with a cluster of computers or multi-CPU systems. This paper focuses on exposing the strength of quantum algorithm in high performance computing by using MPI, and also on comparing the sequential and parallel execution of programs on the basis of execution time and CPU utilization.

Related papers

Distributed quantum computing with QMPI

Thomas Häner, Damian S. Steiger, Torsten Hoefler +1 more

Practical applications of quantum computers require millions of physical qubits and it will be challenging for individual quantum processors to reach such qubit numbers. It is therefore timely to investigate the resource requirements of quantum algorithms in a distributed setting, where multiple quantum processors are interconnected by a coherent network. We introduce an extension of the Message Passing Interface (MPI) to enable high-performance implementations of distributed quantum algorithms. In turn, these implementations can be used for testing, debugging, and resource estimation. In addition to a prototype implementation of quantum MPI, we present a performance model for distributed quantum computing, SENDQ. The model is inspired by the classical LogP model, making it useful to inform algorithmic decisions when programming distributed quantum computers. Specifically, we consider several optimizations of two quantum algorithms for problems in physics and chemistry, and we detail their effects on performance in the SENDQ model.

arXiv:2105.01109•International Conference for High Performance Computing, Networking, Storage and Analysis (SC)•Oct 21, 2021•65 citations

A quantum computing simulator scheme using MPI technology on cloud platform

Zhiguo Huang, Ling Qian, Dunbo Cai

With the deeply studied of quantum computing by research fellows, the computational complexity and time complexity of quantum algorithms gradually increase. The quantum computing simulator provides an effective platform for the development and verification of quantum algorithms. However, the running time and memory overhead during calculation will increase exponentially with the number of qubits. Therefore, the difficulty of high-speed quantum computing on classical computers will gradually increase. At present, a single node has been unable to meet the resource requirements of the algorithm in the quantum computing process, and it is necessary to expand the memory resources in the multi-node computing cluster. Message passing interface has high performance inter-process communication capabilities, which can balance the data transmission between different hosts. Quantum computing tasks can be distributed on several servers to work together to solve the same problem. Therefore, this paper designs an advanced scheme of deploying quantum computing programs on cloud computing platform to support message exchanging between servers using message passing interface to accelerate quantum computing.

IEEE International Conference on Electrical Engineering, Big Data and Algorithms (EEBDA)•Feb 25, 2022•8 citations

A REPORT ON QUANTUM COMPUTING

Achintya A. Paradkar

Today's computers work on bits that exist as either 0 or 1. Quantum computers aren't limited to two states; they encode information as quantum bits, or qubits, which can exist in superposition. Qubits represent atoms, ions, photons or electrons and their respective control devices that are working together to act as computer memory and a processor. Because a quantum computer can contain these multiple states simultaneously, it has the potential to be millions of times more powerful than today's most powerful supercomputers. A processor that can use registers of qubits will be able to perform calculations using all the possible values of the input registers simultaneously. This superposition causes a phenomenon called quantum parallelism, and is the motivating force behind the research being carried out in quantum computing. Due to technical obstacles, till date, a quantum computer has not yet been realized. But the concepts and ideas of quantum computing has been demonstrated using various methods like NMR, Ion Trap, Quantum Dot, Optical Methods, etc. A quantum computer manipulates qubits by executing a series of quantum gates, each a unitary transformation acting on a single qubit or pair of qubits. In applying these gates in succession, a quantum computer can perform a complicated unitary transformation to a set of qubits in some initial state. The qubits can then be measured, with this measurement serving as the final computational result. Research must devise a way to maintain decoherence and other potential sources of error at an acceptable level. Probably the most important idea in this field is the application of error correction in phase coherence as a means to extract information and reduce error in a quantum system without actually measuring that system. Thereby, quantum computers will emerge as the superior computational devices and perhaps one day make today's modern computer obsolete.

International Journal of Students Research in Technology & Management•Sep 26, 2015•1 citation

Introduction to Quantum Computing

J. Vinoj, R. Swathika, Shanmugam Gavaskar +1 more

Quantum computing is poised to revolutionize the world as the next big technological advancement. Combining principles from quantum physics, computer science, and information theory, it overcomes the complexities that classical computers struggle with and transcends their limitations. Unlike classical computers, which follow classical physics, quantum computers are based on the principles of quantum mechanics, enabling them to exploit quantum phenomena. Quantum entanglement and quantum superposition are key quantum mechanical principles used in this technology. Quantum computers utilize these principles to perform complex tasks that classical computers cannot handle. The hardware components of quantum computers consist of the quantum data plane, control and measurement plane, control processor plane, and host processor. The quantum data plane houses physical qubits and related systems, along with support circuits for measuring the qubit's state and executing gate operations on them for gate-based systems. The control and measurement plane converts digital signals from the control processor into analog control signals required to operate the qubits in the quantum data plane. The control processor plane, on the other hand, translates compiled code into commands for the control and measurement layer. One of the groundbreaking features of quantum computers is their ability to operate on qubits, allowing information to be processed simultaneously as both 1s and 0s, represented by [00, 01, 11, 10]. This is achieved through the implementation of quantum mechanical principles, namely, superposition and entanglement. The quantum superposition principle enables a qubit to exist in multiple states simultaneously, setting it apart from classical bits. Moreover, the quantum entanglement property causes the state of one entangled qubit to instantly influence the state of its paired qubit, significantly accelerating the processing speed of quantum computers.

Wiley eBooks•Mar 7, 2025•0 citations

Based on Quantum State Superposition: A Parallel Computing Architecture

Jincheng Zhang

This paper proposes a novel parallel computing architecture fundamentally based on the principle of quantum state superposition. Traditional parallel computing relies on classical methods, often limited by the sequential nature of operations and the constraints of multiple processors. This architecture leverages the inherent ability of quantum systems to exist in multiple states simultaneously, offering a potential paradigm shift in computational efficiency. The core concept involves designing a system where multiple quantum computations can be executed concurrently, drastically reducing processing time for suitable algorithms. This paper details the architecture, outlines the key mathematical foundations, and explores the theoretical advantages of this approach. We present a framework for utilizing superposition to achieve parallelism, focusing on the manipulation of quantum states to represent and process multiple inputs or operations simultaneously. The potential impact of this architecture on various computational domains is discussed, highlighting areas where superposition-based parallelism could offer significant performance gains. The theoretical analysis demonstrates the potential for exponential speedups under certain conditions, contingent on the algorithm's suitability for superposition-based execution. Further research and development are needed to translate this architectural concept into a practical and scalable implementation.

•Aug 28, 2026•0 citations

A Parallel Quantum Computer Simulator

James E Fischer

The unique principles of quantum mechanics may one day enable computers to perform operations that would be impossible on a classical computer. Although no one knows whether it will be possible to build a large-scale, functional, and stable quantum computer, researchers can study quantum-mechanical systems and develop algorithms and circuits by simulating quantum systems in software. Performance and memory bottlenecks prevent most current quantum computer simulators from being able to simulate quantum systems that are large enough to be useful. In this thesis, we develop a matrix-free sequential quantum computer simulator to vastly improve both time and memory performance of sequential code on a single processor. Next, we distribute the matrix-free algorithm over multiple parallel processors using the Message Passing Interface in order to simulate quantum systems that are too large to reside wholly within the memory of a single processor. Finally, we simulate various quantum circuits using the Hamming high-performance computing cluster in order to conduct algorithmic analysis.

•Sep 1, 2016•0 citations
Quantum computing has been an attractive method adapted for increasing the computational speed and it is governed by the laws of quantum mechanics. Quantum computers are not limited to two states as compared with classical systems, but they encode information as quantum bits or qubits. A qubit represents atoms, ions, photons or electrons and their respective control devices that are working together to act as computer memory and processors. The power of quantum computing lies in its multi-state representation which makes it million times more powerful than classical computer systems. Quantum computers also use another aspect of quantum mechanics known as entanglement, which is a property where multiple objects existing in the states that can be linked together. There exists a standard/specification of message passing library, known as message passing interface (MPI) that can be used for achieving high-performance computing. The goal of MPI is to provide a standardized framework for writing message-passing programs which can be used for programming systems that require distributed processing. The superposition principle used by the quantum algorithm can be simulated in the MPI environment with a cluster of computers or multi-CPU systems. This paper focuses on exposing the strength of quantum algorithm in high performance computing by using MPI, and also on comparing the sequential and parallel execution of programs on the basis of execution time and CPU utilization.
Practical applications of quantum computers require millions of physical qubits and it will be challenging for individual quantum processors to reach such qubit numbers. It is therefore timely to investigate the resource requirements of quantum algorithms in a distributed setting, where multiple quantum processors are interconnected by a coherent network. We introduce an extension of the Message Passing Interface (MPI) to enable high-performance implementations of distributed quantum algorithms. In turn, these implementations can be used for testing, debugging, and resource estimation. In addition to a prototype implementation of quantum MPI, we present a performance model for distributed quantum computing, SENDQ. The model is inspired by the classical LogP model, making it useful to inform algorithmic decisions when programming distributed quantum computers. Specifically, we consider several optimizations of two quantum algorithms for problems in physics and chemistry, and we detail their effects on performance in the SENDQ model.
With the deeply studied of quantum computing by research fellows, the computational complexity and time complexity of quantum algorithms gradually increase. The quantum computing simulator provides an effective platform for the development and verification of quantum algorithms. However, the running time and memory overhead during calculation will increase exponentially with the number of qubits. Therefore, the difficulty of high-speed quantum computing on classical computers will gradually increase. At present, a single node has been unable to meet the resource requirements of the algorithm in the quantum computing process, and it is necessary to expand the memory resources in the multi-node computing cluster. Message passing interface has high performance inter-process communication capabilities, which can balance the data transmission between different hosts. Quantum computing tasks can be distributed on several servers to work together to solve the same problem. Therefore, this paper designs an advanced scheme of deploying quantum computing programs on cloud computing platform to support message exchanging between servers using message passing interface to accelerate quantum computing.
Today's computers work on bits that exist as either 0 or 1. Quantum computers aren't limited to two states; they encode information as quantum bits, or qubits, which can exist in superposition. Qubits represent atoms, ions, photons or electrons and their respective control devices that are working together to act as computer memory and a processor. Because a quantum computer can contain these multiple states simultaneously, it has the potential to be millions of times more powerful than today's most powerful supercomputers. A processor that can use registers of qubits will be able to perform calculations using all the possible values of the input registers simultaneously. This superposition causes a phenomenon called quantum parallelism, and is the motivating force behind the research being carried out in quantum computing. Due to technical obstacles, till date, a quantum computer has not yet been realized. But the concepts and ideas of quantum computing has been demonstrated using various methods like NMR, Ion Trap, Quantum Dot, Optical Methods, etc. A quantum computer manipulates qubits by executing a series of quantum gates, each a unitary transformation acting on a single qubit or pair of qubits. In applying these gates in succession, a quantum computer can perform a complicated unitary transformation to a set of qubits in some initial state. The qubits can then be measured, with this measurement serving as the final computational result. Research must devise a way to maintain decoherence and other potential sources of error at an acceptable level. Probably the most important idea in this field is the application of error correction in phase coherence as a means to extract information and reduce error in a quantum system without actually measuring that system. Thereby, quantum computers will emerge as the superior computational devices and perhaps one day make today's modern computer obsolete.
Quantum computing is poised to revolutionize the world as the next big technological advancement. Combining principles from quantum physics, computer science, and information theory, it overcomes the complexities that classical computers struggle with and transcends their limitations. Unlike classical computers, which follow classical physics, quantum computers are based on the principles of quantum mechanics, enabling them to exploit quantum phenomena. Quantum entanglement and quantum superposition are key quantum mechanical principles used in this technology. Quantum computers utilize these principles to perform complex tasks that classical computers cannot handle. The hardware components of quantum computers consist of the quantum data plane, control and measurement plane, control processor plane, and host processor. The quantum data plane houses physical qubits and related systems, along with support circuits for measuring the qubit's state and executing gate operations on them for gate-based systems. The control and measurement plane converts digital signals from the control processor into analog control signals required to operate the qubits in the quantum data plane. The control processor plane, on the other hand, translates compiled code into commands for the control and measurement layer. One of the groundbreaking features of quantum computers is their ability to operate on qubits, allowing information to be processed simultaneously as both 1s and 0s, represented by [00, 01, 11, 10]. This is achieved through the implementation of quantum mechanical principles, namely, superposition and entanglement. The quantum superposition principle enables a qubit to exist in multiple states simultaneously, setting it apart from classical bits. Moreover, the quantum entanglement property causes the state of one entangled qubit to instantly influence the state of its paired qubit, significantly accelerating the processing speed of quantum computers.
This paper proposes a novel parallel computing architecture fundamentally based on the principle of quantum state superposition. Traditional parallel computing relies on classical methods, often limited by the sequential nature of operations and the constraints of multiple processors. This architecture leverages the inherent ability of quantum systems to exist in multiple states simultaneously, offering a potential paradigm shift in computational efficiency. The core concept involves designing a system where multiple quantum computations can be executed concurrently, drastically reducing processing time for suitable algorithms. This paper details the architecture, outlines the key mathematical foundations, and explores the theoretical advantages of this approach. We present a framework for utilizing superposition to achieve parallelism, focusing on the manipulation of quantum states to represent and process multiple inputs or operations simultaneously. The potential impact of this architecture on various computational domains is discussed, highlighting areas where superposition-based parallelism could offer significant performance gains. The theoretical analysis demonstrates the potential for exponential speedups under certain conditions, contingent on the algorithm's suitability for superposition-based execution. Further research and development are needed to translate this architectural concept into a practical and scalable implementation.
The unique principles of quantum mechanics may one day enable computers to perform operations that would be impossible on a classical computer. Although no one knows whether it will be possible to build a large-scale, functional, and stable quantum computer, researchers can study quantum-mechanical systems and develop algorithms and circuits by simulating quantum systems in software. Performance and memory bottlenecks prevent most current quantum computer simulators from being able to simulate quantum systems that are large enough to be useful. In this thesis, we develop a matrix-free sequential quantum computer simulator to vastly improve both time and memory performance of sequential code on a single processor. Next, we distribute the matrix-free algorithm over multiple parallel processors using the Message Passing Interface in order to simulate quantum systems that are too large to reside wholly within the memory of a single processor. Finally, we simulate various quantum circuits using the Hamming high-performance computing cluster in order to conduct algorithmic analysis.