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

CRC Press eBooks

General-Purpose Quantum Computing

Cheng Hsiao Wu

Published Nov 21, 2025• 0 citations
Publisher

Abstract

Quantum parallel computing for the addition operation is the starting point for general-purpose computing. A 16 nonlocal operator–state relations are presented to show how parallel computing is achieved.
DOI
10.1201/9781003542032-3

Related papers

Overview of Quantum Computing

Cheng Hsiao Wu

The difference between a classical sequential computer, using Boolean operations and implemented by transistor logic gates, and the new quantum parallel computer is described at the fundamental level. Why the new quantum computing must use nonlocal operator–state relations is explained to move the readers into a new frontier of science.

CRC Press eBooks•Nov 21, 2025•0 citations

Introduction to Quantum Computing

Nadia Nedjah, Luiza de Macedo Mourelle

This introduction presents an overview of the key concepts discussed in the subsequent chapters of this book. The book introduces the motivation and presents and comment on recent related works in the literature about the quantum computing emulation by hardware and simulation by software. The conventional electronic computer is a machine that performs logical and arithmetic operations sequentially and/or in parallel on data coded according to binary logic. Quantum Computing has been the target of several researches due to its potential for increasing the speed of processing through the use of algorithms with intrinsic parallelism, pointing out to the possibility of polynomial time solutions for NP-Complete problems. The book describes the macro-architecture of the proposed quantum processor and its interaction with the conventional host wherein it is embedded. It defines quantum state measurement and propose an efficient micro-architecture for the unit that is responsible for the state observation of the quantum bits, thus allowing for quantum bit measurements.

CRC Press eBooks•Jan 5, 2023•1 citation

Q#

Krysta Svore, Alan Geller, Matthias Troyer +7 more

Quantum computing exploits quantum phenomena such as superposition and entanglement to realize a form of parallelism that is not available to traditional computing. It offers the potential of significant computational speed-ups in quantum chemistry, materials science, cryptography, and machine learning.

arXiv:1803.00652•Feb 24, 2018•287 citations

Generalized quantum search with parallelism

Robert M. Gingrich, Colin P. Williams, Nicolas J. Cerf

We generalize Grover's unstructured quantum search algorithm to enable it to work with arbitrary starting superpositions and arbitrary unitary operators. We show that the generalized quantum search algorithm, when cast in a special orthonormal basis, can be understood as performing an exact rotation of a starting superposition into a target superposition. We derive a formula for the success probability of the generalized quantum search algorithm after n rounds of amplitude amplification. We then use this formula to determine the optimal strategy for a punctuated quantum search algorithm, i.e., one in which the amplitude amplified state is observed before the point of maximum success probability. On average, the optimal strategy is about 12% better than the naive use of Grover's algorithm. The speedup obtained is not dramatic but it illustrates that a hybrid use of quantum computing and classical computing techniques can yield a performance that is better than either alone. In addition, we show that a punctuated quantum algorithm that takes the same average computation time as Grover's standard algorithm only requires half the coherence time. We then extend the analysis to the case of a society of k quantum searches acting in parallel. We derive an analytic formula that connects the degree of parallelism with the expected computation time for k-parallel quantum search. The resulting parallel speedup scales as $O(\sqrt{k}),$ while the minimum number of agents needed to ensure success, k, decreases as the inverse of the square of the achievable coherence time. This result has practical significance for the design of rudimentary quantum computers that are likely to have a limited coherence time.

arXiv:quant-ph/9904049•Physical Review A•Apr 19, 2000•41 citations

General-purpose parallel simulator for quantum computing

J. Niwa, Keiji Matsumoto, Hiroshi Imai

With current technologies, it seems to be very difficult to implement quantum computers with many qubits. It is therefore of importance to simulate quantum algorithms and circuits on the existing computers. However, for a large-size problem, the simulation often requires more computational power than is available from sequential processing. Therefore, simulation methods for parallel processors are required. We have developed a general-purpose simulator for quantum algorithms/circuits on the parallel computer (Sun Enterprise4500). It can simulate algorithms/circuits with up to 30 qubits. In order to test efficiency of our proposed methods, we have simulated Shor's factorization algorithm and Grover's database search, and we have analyzed robustness of the corresponding quantum circuits in the presence of both decoherence and operational errors. The corresponding results, statistics, and analyses are presented in this paper.

arXiv:quant-ph/0201042•Physical Review A•Dec 30, 2002•46 citations

An algebraic approach for quantum computation

TranQuoc-Nam, DanielJennifer, AndreevValentin

Quantum computation is one of the very promising new fields of the new millennium for basic research in theoretical computer science and computational mathematics. Quantum computers have stimulated...

Journal of computing sciences in colleges•Oct 1, 2006•0 citations
This introduction presents an overview of the key concepts discussed in the subsequent chapters of this book. The book introduces the motivation and presents and comment on recent related works in the literature about the quantum computing emulation by hardware and simulation by software. The conventional electronic computer is a machine that performs logical and arithmetic operations sequentially and/or in parallel on data coded according to binary logic. Quantum Computing has been the target of several researches due to its potential for increasing the speed of processing through the use of algorithms with intrinsic parallelism, pointing out to the possibility of polynomial time solutions for NP-Complete problems. The book describes the macro-architecture of the proposed quantum processor and its interaction with the conventional host wherein it is embedded. It defines quantum state measurement and propose an efficient micro-architecture for the unit that is responsible for the state observation of the quantum bits, thus allowing for quantum bit measurements.
We generalize Grover's unstructured quantum search algorithm to enable it to work with arbitrary starting superpositions and arbitrary unitary operators. We show that the generalized quantum search algorithm, when cast in a special orthonormal basis, can be understood as performing an exact rotation of a starting superposition into a target superposition. We derive a formula for the success probability of the generalized quantum search algorithm after n rounds of amplitude amplification. We then use this formula to determine the optimal strategy for a punctuated quantum search algorithm, i.e., one in which the amplitude amplified state is observed before the point of maximum success probability. On average, the optimal strategy is about 12% better than the naive use of Grover's algorithm. The speedup obtained is not dramatic but it illustrates that a hybrid use of quantum computing and classical computing techniques can yield a performance that is better than either alone. In addition, we show that a punctuated quantum algorithm that takes the same average computation time as Grover's standard algorithm only requires half the coherence time. We then extend the analysis to the case of a society of k quantum searches acting in parallel. We derive an analytic formula that connects the degree of parallelism with the expected computation time for k-parallel quantum search. The resulting parallel speedup scales as O(k),O(\sqrt{k}),O(k​), while the minimum number of agents needed to ensure success, k, decreases as the inverse of the square of the achievable coherence time. This result has practical significance for the design of rudimentary quantum computers that are likely to have a limited coherence time.
With current technologies, it seems to be very difficult to implement quantum computers with many qubits. It is therefore of importance to simulate quantum algorithms and circuits on the existing computers. However, for a large-size problem, the simulation often requires more computational power than is available from sequential processing. Therefore, simulation methods for parallel processors are required. We have developed a general-purpose simulator for quantum algorithms/circuits on the parallel computer (Sun Enterprise4500). It can simulate algorithms/circuits with up to 30 qubits. In order to test efficiency of our proposed methods, we have simulated Shor's factorization algorithm and Grover's database search, and we have analyzed robustness of the corresponding quantum circuits in the presence of both decoherence and operational errors. The corresponding results, statistics, and analyses are presented in this paper.