3 papers
math.NT2006
What is the Inverse of Repeated Square and Multiply Algorithm?
H. Gopalkrishna Gadiyar, K M Sangeeta Maini, R. Padma +1
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse whic…
quant-ph2003
The Signals and Systems Approach to Quantum Computation
H. Gopalkrishna Gadiyar, K. M. Sangeeta Maini, R. Padma +1
In this note we point out the fact that the proper conceptual setting of quantum computation is the theory of Linear Time Invariant systems. To convince readers of the utility of t…
math-ph2002
Entropy and Hadamard Matrices
H. Gopalkrishna Gadiyar, K. M. Sangeeta Maini, R. Padma +1
The entropy of an orthogonal matrix is defined. It provides a new interpretation of Hadamard matrices as those that saturate the bound for entropy.It appears to be a useful Morse f…