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

arXiv:quant-ph/9910091 · Chinese Physics Letters

Quantum Central Processing Unit and Quantum Algorithm

Wang An-Min

Published Apr 18, 2002• 7 citations
arXivHTMLPDF

Abstract

Based on a scalable and universal quantum network, quantum central processing unit, proposed in our previous paper [Chin. Phys. Lett. 18 (2001) 166], the whole quantum network for the known quantum algorithms, including quantum Fourier transformation, Shor's algorithm and Grover's algorithm, is obtained in a unified way.
DOI
10.1088/0256-307x/19/5/304

Related papers

Quantum Central Processing Unit and Quantum Algorithm

王安民

Based on a scalable and universal quantum network,quantum central processing unit,proposed in our previous paper [Chin.Phys.Lett.18(2001) 166],the whole quantum network for the known quantum algorithms,including quantum Fouries transformation,Shor's algorithm and Grover's algorithm,is obtained in a unified way.

Chinese Physics Letters•Jan 1, 2002•0 citations

A Universal Quantum Network-Quantum Central Processing Unit

Wang An-Min

A new construction scheme of a universal quantum network which is compatible with the known quantum gate-assembly schemes is proposed. Our quantum network is standard, easy-assemble, reusable, scalable and even potentially programmable. Moreover, we can construct a whole quantum network to implement the general quantum algorithm and quantum simulation procedure. In the above senses, it is a realization of the quantum central processing unit.

arXiv:quant-ph/9910089•Chinese Physics Letters•Feb 1, 2001•3 citations

New Construction of an Universal Quantum Network and Its Applications

An Min Wang

We proposed a new candidate for the construction of an universal quantum network, which are built from the elementary quantum gates to the elements of quantum circuit, again to quantum subnetworks and finally to a whole quantum network. The main advantages of our scheme are its simplicity and standardization in construction, facility and directness in assembly and scale, reusage and update in engineering, realizability and procedurization in an effective construction. Moreover our universal quantum networks are potentially programmable. It is proved that all the elementary quantum gates can be written as our quantum subnetwork. This implies that our scheme is compatible with the known quantum gate-assembly schemes, and so the known results from a quantum computation to a set of the elementary quantum gates can be directly inherited and used in our scheme. As the applications of our construction scheme, we obtain the whole quantum networks for Shor's algorithm, Grover's algorithm and simulating Schr\\"odinger equation in general. This means that our universal quantum network can generally describe the known main results in quantum computation.

•Jun 27, 2000•0 citations

Construction of a Scalable, Uniform and Universal Quantum Network and Its Applications

An Min Wang

We present a possible candidate of construction of a scalable, uniform and universal quantum network, which is built from quantum gates to elements of quantum circuit, again to quantum subnetworks and finally to an entire quantum network. Our scheme can overcome some difficulties of the existing schemes and makes improvements to different extent in the scale of quantum network, ability of computation, implementation of engineering, efficiency of quantum network, universality, compatibility, design principle, programmability, fault tolerance, error control, industrialization and commercialization {\it et. al} aspects. As the applications of this construction scheme, we obtain the entire quantum networks for Shor's algorithm, Grover's algorithm and solving Schrödinger equation in general. This implies that the scalable, uniform and universal quantum networks are able to generally describe the known main results and can be further applied to more interesting examples in quantum computations.

arXiv:quant-ph/0006122•Jun 27, 2000•0 citations

Mathematical Analysis and Simulation of Shor's Algorithm and the Quantum Fourier Transform

Marcus Ahlström, Peda Dizdarevic, Patrik Henelius

In 1994, Peter Shor presented an algorithm for integer factorization that used exponentiallyless operations than the most efficient known algorithm. His algorithm requiresthe use of a quantum computer, a theoretical computational device using quantum mechanicaleffects not utilized in contemporary computers. In this paper we have analysedthe mathematics behind Shor’s algorithm and the quantum circuits on which it operates.We have also studied the Quantum Fourier Transform, a central component of Shor’sAlgorithm. Furthermore we have written a program in C++ to simulate a quantum circuitperforming Shor’s algorithm and the quantum Fourier transform. We were able tounderstand the critical parts of Shor’s algorithm that contribute with the great increasein efficiency compared to classical algorithms.

•Jan 1, 2012•1 citation

Universal Quantum Algorithm

Avatar Tulsi

Quantum amplitude amplification and quantum phase estimation are two fundamental quantum algorithms. All known quantum algorithms are derived from these two algorithms. Even the adiabatic quantum algorithms can also be efficiently simulated using quantum phase estimation. We present a universal quantum algorithm which explains these two algorithms as special cases. An interesting result is that we do not need quantum fourier transform to do quantum phase estimation.

arXiv:1611.03472•Nov 10, 2016•1 citation
We proposed a new candidate for the construction of an universal quantum network, which are built from the elementary quantum gates to the elements of quantum circuit, again to quantum subnetworks and finally to a whole quantum network. The main advantages of our scheme are its simplicity and standardization in construction, facility and directness in assembly and scale, reusage and update in engineering, realizability and procedurization in an effective construction. Moreover our universal quantum networks are potentially programmable. It is proved that all the elementary quantum gates can be written as our quantum subnetwork. This implies that our scheme is compatible with the known quantum gate-assembly schemes, and so the known results from a quantum computation to a set of the elementary quantum gates can be directly inherited and used in our scheme. As the applications of our construction scheme, we obtain the whole quantum networks for Shor's algorithm, Grover's algorithm and simulating Schr\\"odinger equation in general. This means that our universal quantum network can generally describe the known main results in quantum computation.
We present a possible candidate of construction of a scalable, uniform and universal quantum network, which is built from quantum gates to elements of quantum circuit, again to quantum subnetworks and finally to an entire quantum network. Our scheme can overcome some difficulties of the existing schemes and makes improvements to different extent in the scale of quantum network, ability of computation, implementation of engineering, efficiency of quantum network, universality, compatibility, design principle, programmability, fault tolerance, error control, industrialization and commercialization {\it et. al} aspects. As the applications of this construction scheme, we obtain the entire quantum networks for Shor's algorithm, Grover's algorithm and solving Schrödinger equation in general. This implies that the scalable, uniform and universal quantum networks are able to generally describe the known main results and can be further applied to more interesting examples in quantum computations.
In 1994, Peter Shor presented an algorithm for integer factorization that used exponentiallyless operations than the most efficient known algorithm. His algorithm requiresthe use of a quantum computer, a theoretical computational device using quantum mechanicaleffects not utilized in contemporary computers. In this paper we have analysedthe mathematics behind Shor’s algorithm and the quantum circuits on which it operates.We have also studied the Quantum Fourier Transform, a central component of Shor’sAlgorithm. Furthermore we have written a program in C++ to simulate a quantum circuitperforming Shor’s algorithm and the quantum Fourier transform. We were able tounderstand the critical parts of Shor’s algorithm that contribute with the great increasein efficiency compared to classical algorithms.