Quantum networks for elementary arithmetic operations
- 1 July 1996
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 54 (1) , 147-153
- https://doi.org/10.1103/physreva.54.147
Abstract
Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most difficult (time and space consuming) part of Shor’s quantum factorizing algorithm. We show that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorized. © 1996 The American Physical Society.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Elementary gates for quantum computationPhysical Review A, 1995
- Almost Any Quantum Logic Gate is UniversalPhysical Review Letters, 1995
- A universal two-bit gate for quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1995
- Universality in quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1995
- Realizable Universal Quantum Logic GatesPhysical Review Letters, 1995
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Quantum computational networksProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1989
- Time/Space Trade-Offs for Reversible ComputationSIAM Journal on Computing, 1989
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1985
- Bicontinuous extensions of invertible combinatorial functionsTheory of Computing Systems, 1981