Rudy Raymond H.P.  Rudy Raymond H.P. photo       

contact information

Doctor of Informatics
Tokyo Research Laboratory, Yamato, Japan



Quantum Computing PIC Co-Chair in IBM Research -- Tokyo.

Skills in Algorithms, Data Mining, and Optimization with 40+ scientific papers published in prestigious international conferences and journals (with 420+ citations according to Google Scholar), and 15+ patents. Working experiences in various fields of industries, such as, automotives, telecommunications, finance, energy and smarter cities by applying data analytics and optimization technologies.

IBM recently announced the initiative to build a Quantum Community by the Quantum Experience following the progress in technologies for realizing quantum computers and quantum algorithms that have significant speed-up factors with regards to their classical counterparts. The list of such quantum algorithms  can be found in the quantum algorithm zoo, where Quantum Counterfeit Coin Algorithms (co-invented by the author) is listed  as the first-known "quartic" speed-up.


Recently wrote an article introducing IBM Q in ProVision 92.




  • "Introduction to Mathematical Optimization Methods and Applications at IBM Research - Tokyo", Kyoto University Informatics Seminar, April 25, 2016.
  • “Quantum Query Complexity and Coin Problems”. Centre for Quantum Technologies. Workshop on Quantum Algorithms & Complexity Theory (WQACT 2008). National University of Singapore (NUS), November 17--21, 2008.
  • “Quantum Query Complexity of Boolean Functions with Small On-Set”. JST-CNRS Quantum Computation: Theory and Feasibility. Joint workshop in Paris, France. Institut Henri Poincare, September 25--26, 2008.
  • “Quantum Random Access Coding with Multiple Qubits”. Workshop on Theory of Quantum Computation, Communication and Cryptography (TQC 2007). Nara Institute of Science and Technology, Nara, Japan. January 24, 2007.
  • “Characterizing the Existence of Quantum One-Way Permutations”. McGill University, Montreal, Canada. October 9, 2003.
  • “Quantum Query Complexity of Biased Oracles”. Kyoto University Inter-Department Symposium (KIDS), Kyoto, Japan. June 26, 2003.



Ph. D Thesis

"Studies on Quantum Query Complexities and Quantum Network Coding", Kyoto University, March 2006.