ArXiv.org · 2002 · 16 citations · 6 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureQuantum ComputingQuantum MechanicsQuantum BitsQuantum CircuitsQuantum ComputationQuantum GatesQuantum Hardware ArchitecturesAddersCarry Lookahead AdditionElementary Quantum GatesQuantum Arithmetic CircuitsQuantum Circuit ArchitectureQuantum NetworksThroughput TimeThroughput Time Analysis
In this paper, two quantum networks for the addition operation are presented. One is the Modified Quantum Plain (MQP) adder, and the other is the Quantum Carry Look-Ahead (QCLA) adder. The MQP adder is obtained by modifying the Conventional Quantum Plain (CQP) adder. The QCLA adder is an extension of conventional digital Carry Look-Ahead adder. Compared with the CQP adder, two main advantages are as follows: First, the proposed MQP and QCLA adders have less number of elementary gates than the CQP adder. Secondly, the number of processing stages of the MQP and QCLA adder are less than ones of the CQP adder. As a result, the throughput time for computing the sum of two numbers on the quantum computer can be improved.
6
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor · 2002 · 8.5K citations
Computing, Computer Science, Physics +12
Quantum networks for elementary arithmetic operations
Vlatko Vedral, Adriano Barenco, Artur Ekert · Physical Review A · 1996 · 822 citations · Full text
Computing, Computer Science, Physics +17
Efficient networks for quantum factoring
David Beckman, Amalavoyal N. Chari, Devabhaktuni Srikrishna et al. · Physical Review A · 1996 · 266 citations · Full text
Computing, Computer Science, Physics +17
Addition on a Quantum Computer
Thomas G. Draper · ArXiv.org · 2000 · 200 citations · Full text
Computing, Computer Science, Physics +15
Fast versions of Shor's quantum factoring algorithm
Christof Zalka · ArXiv.org · 1998 · 77 citations · Full text
Computing, Computer Science, Physics +13