8,780 research outputs found
Generalizing Binary Operations
Most day to day calculations take place within the field of real numbers with the two binary operations of addition and multiplication. In this field, these two operations are definitionally independent of one another. However, if we approach binary operations from a different point of view, e.g. that of recursive formulae, we can develop multipli cation from addition by use of the concept of repeated addition. Along similar lines, we can develop exponentiation from multiplication by re peated multiplication. The next logical step would be to try to develop another binary operation based on repeated exponentiation
Improved Memoryless RNS Forward Converter Based on the Periodicity of Residues
The residue number system (RNS) is suitable for DSP architectures because of its ability to perform fast carry-free arithmetic. However, this advantage is over-shadowed by the complexity involved in the conversion of numbers between binary and RNS representations. Although the reverse conversion (RNS to binary) is more complex, the forward transformation is not simple either. Most forward converters make use of look-up tables (memory). Recently, a memoryless forward converter architecture for arbitrary moduli sets was proposed by Premkumar in 2002. In this paper, we present an extension to that architecture which results in 44% less hardware for parallel conversion and achieves 43% improvement in speed for serial conversions. It makes use of the periodicity properties of residues obtained using modular exponentiation
Design of Quantum Circuits for Galois Field Squaring and Exponentiation
This work presents an algorithm to generate depth, quantum gate and qubit
optimized circuits for squaring in the polynomial basis. Further, to
the best of our knowledge the proposed quantum squaring circuit algorithm is
the only work that considers depth as a metric to be optimized. We compared
circuits generated by our proposed algorithm against the state of the art and
determine that they require fewer qubits and offer gates savings that
range from to . Further, existing quantum exponentiation are
based on either modular or integer arithmetic. However, Galois arithmetic is a
useful tool to design resource efficient quantum exponentiation circuit
applicable in quantum cryptanalysis. Therefore, we present the quantum circuit
implementation of Galois field exponentiation based on the proposed quantum
Galois field squaring circuit. We calculated a qubit savings ranging between
to and quantum gate savings ranging between to
compared to identical quantum exponentiation circuit based on existing squaring
circuits.Comment: To appear in conference proceedings of the 2017 IEEE Computer Society
Annual Symposium on VLSI (ISVLSI 2017
Remarks on Quantum Modular Exponentiation and Some Experimental Demonstrations of Shor's Algorithm
An efficient quantum modular exponentiation method is indispensible for
Shor's factoring algorithm. But we find that all descriptions presented by
Shor, Nielsen and Chuang, Markov and Saeedi, et al., are flawed. We also remark
that some experimental demonstrations of Shor's algorithm are misleading,
because they violate the necessary condition that the selected number ,
where is the number of qubits used in the first register, must satisfy , where is the large number to be factored.Comment: 12 pages,5 figures. The original version has 6 pages. It did not
point out the reason that some researchers took for granted that quantum
modlar exponentiation is in polynomial time. In the new version, we indicate
the reason and analyze some experimental demonstrations of Shor's algorithm.
Besides, the author Zhenfu Cao is added to the version for his contribution.
arXiv admin note: text overlap with arXiv:1409.735
- …