Systems, methods and apparatus for factoring numbers

Details Systems, methods and apparatus for factoring numbers Systems, methods and apparatus for factoring numbers

2006-07-10

2010-11-30

Mai, Tan V (Department: 2193)

Electrical computers: arithmetic processing and calculating

Electrical analog calculating computer

Particular function performed

Reexamination Certificate

active

07844656

ABSTRACT:
Systems, methods and apparatus for factoring numbers are provided. The factoring may be accomplished by creating a factor graph, mapping the factor graph onto an analog processor, initializing the analog processor to an initial state, evolving the analog processor to a final state, and receiving an output from the analog processor, the output comprising a set of factors of the number.

REFERENCES:
patent: 6838694 (2005-01-01), Esteve et al.
patent: 2005/0082519 (2005-04-01), Amin et al.
patent: 2005/0224784 (2005-10-01), Amin et al.
patent: 2005/0250651 (2005-11-01), Amin et al.
patent: 2005/0256007 (2005-11-01), Amin et al.
patent: 2006/0147154 (2006-07-01), Thom et al.
Averin, et al., “Variable Electrostatic Transformers,” U.S. Appl. No. 11/100,931, filed Apr. 6, 2005.
Hilton et al., “Factoring on an Optimization Type Quantum Computer,” U.S. Appl. No. 60/698,362, filed Jun. 6, 2005.
Agrawal, M. et al., “PRIMES is in P,” URL=http://www.cse.iitk.ac.in
ews/primality.html, Aug. 2002.
Burges, C., “Factoring as Optimization,”Microsoft Technical Report MSR-TR-2002-83: Aug. 2002.
Cohen, H. et al., “Primality Testing and Jacobi Sums,”Mathematics of Computation 42(165): 297-330, Jan. 1984.
Cormen, T. et al.,Introduction to Algorithms, 2d ed., MIT Press, Cambridge, 2001, p. 887-896.
Eades, P. et al., “Algorithms for Drawing Graphs: An Annotated Bibliography,”Technical Report CS-89-09, Revised Version, Oct. 1989.
Farhi, E. et al., “Quantum Adiabatic Evolution Algorithms versus Simulated Annealing,”arXiv:quant-ph/0201031 1:1-16, Jan. 8, 2002.
Feynman, R., “Simulating Physics with Computers,”International Journal of Theoretical Physics 21(6/7): 467-488, May 1982.
Gallop, J. C. et al., “SQUIDs and their applications,”Journal of Physics E: Scientific Instruments 9:417-429, 1976.
Garey, M. et al.,Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979, 1-15.
Jung, K. R. et al., “A rapid single flux quantum 1 bit arithmetic logic unit constructed with a half-adder cell,”Supercond. Sci. Technol. 17:770-774, 2004.
Kleiner, R. et al., “Superconducting Quantum Interference Devices: State of the Art and Applications,”Proceedings of the IEEE 92(10):1534-1548, Oct. 2004.
Lenstra, A., “Integer Factoring,”Designs, Codes and Cryptography 19(101-128):31-58, 2000.
Makhlin, Y. et al., “Quantum-state engineering with Josephson-junction devices,”Reviews of Modern Physics 73(2):357-400, Apr. 2001.
Mehlhorn, K., “LEDA: A Platform for Combinatorial and Geometric Computing,”Communications of the ACM, 38(1):96-102, Jan. 1995.
Nielsen, M. et al.,Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000, p. 343-345.
Shor, P., “Introduction to Quantum Algorithms,”arXiv:quant-ph/0005003 2:1-17, Jul. 6, 2001.
Shor, P., “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,”SIAM J. Comput. 26(5):1484-1509, Oct. 1997.
Vandersypen, L. et al., “Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance,”Nature 414(20):883-887, Dec. 27, 2001.

Affiliated with

Also associated with

Rating

Systems, methods and apparatus for factoring numbers does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Systems, methods and apparatus for factoring numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems, methods and apparatus for factoring numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4167427