Rudy Raymond Harry Putra, Ph.D

Rudy Raymond Harry Putra, Ph.D.

Researcher, Analytics & Optimization
IBM Tokyo Research Laboratory

1623-14, Shimotsuruma, Yamato-shi
Kanagawa 242-8502 Japan

Email: raymond AT jp DOT ibm DOT com

Rudy Raymond was born in Padang, Indonesia. He was a student of SMA (Senior High School) Taruna Nusantara Magelang before coming to Japan in 1996 under Japanese Government Scholarship award. He joined Tokyo Research Laboratory (TRL) in 2006 after graduating from Kyoto University. He is actively pursuing research in the theoretical aspects of algorithms and optimization, in particular, Quantum Computation and Information (QCI). Some of his recent interests are to develop large-scale recommender systems using state-of-art techniques in data analytics and optimization, and to solve large scale optimization problems using convex programming (LP and SDP). He is familiar with various programming languages such as C, C++, Java, Python, R, and Mathematica. He is a member of Analytics and Optimization group of IBM Research Tokyo.

• 1996: Osaka Univ. of Foreign Studies (Japanese)
• 2001: Kyoto Univ., Dept. of Information Science (B. Eng.)
• 2003: Kyoto Univ., School of Informatics (M. Inf.)
• 2003: McGill Univ., School of Computer Science (joint Ph. D program with Kyoto Univ.)
• 2006: Kyoto Univ., School of Informatics (Ph. D)
• 2006: IBM Research Tokyo.

• Quantum Query Complexity of Boolean Functions with Small On-Sets,
  with Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Seiichiro Tani and Shigeru Yamashita.
  The 19th International Symposium on Algorithms and Computation ( ISAAC 2008 ), pp. 907 -- 918, Gold Coast, Australia, December 2008.
• Unbounded Error Quantum Query Complexity,
  with Ashley Montanaro and Harumichi Nishimura..
  The 19th International Symposium on Algorithms and Computation ( ISAAC 2008 ), pp. 919 -- 930, Gold Coast, Australia, December 2008.
  Preprint at: quant-ph/0712.1446.
• Polynomial-Time Construction of Linear Network Coding,
  with Kazuo Iwama, Harumichi Nishimura, Mike Paterson and Shigeru Yamashita.
  The 35th International Colloquium on Automata, Languages and Programming (ICALP 2008), LNCS 5125 pp. 271 -- 282, Reykjavik, Iceland, July 2008.
• Sensitivity Analysis on Causal Events of WIP Bubbles by a Log-Driven Simulator,
  with Ryo Hirade and Hiroyuki Okano.
  Winter Simulation Conference (WSC) pp. 1747--1754, 2007.
• Unbounded-Error Classical and Quantum Communication Complexity,
  with Kazuo Iwama, Harumichi Nishimura and Shigeru Yamashita.
  A contributed talk at the 11th Workshop on Quantum Information Processing (QIP 2008), New Delhi, December 2007.
  
• Unbounded-Error Classical and Quantum Communication Complexity,
  with Kazuo Iwama, Harumichi Nishimura and Shigeru Yamashita.
  The 18th International Symposium on Algorithms and Computation (ISAAC 2007), LNCS 4835 pp. 100 -- 111, Sendai, Japan, December 2007.
  Preprint at: quant-ph/0709.2761.
• Unbounded-Error One-Way Classical and Quantum Communication Complexity,
  with Kazuo Iwama, Harumichi Nishimura and Shigeru Yamashita.
  The 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), LNCS 4596 pp. 110 -- 121, Wroclaw, Poland, July 2007.
  Preprint at: quant-ph/0706.3265.
• Quantum Network Coding,
  with Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura and Shigeru Yamashita.
  The 24th International Symposium on Theoretical Aspects of Computer Science (STACS 2007), LNCS 4393 pp. 610 -- 621, Aachen, Germany.
  Preprint at: quant-ph/0601088.
• (4,1)-quantum Random Access Coding does not Exist,
  with Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura and Shigeru Yamashita.
  In Proceedings of IEEE Symposium on Information Theory 2006 (ISIT 2006), pp. 446-450, Seattle, Washington, USA, July 2006.
• Improved Algorithms for Quantum Identification of Boolean Oracles,
  with Andris Ambainis, Kazuo Iwama, Akinori Kawachi and Shigeru Yamashita.
  In Proceedings of 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006) LNCS 4059 pp. 280 -- 291, Riga, Latvia, July 2006.

• [Invited] Quantum Random Access Coding,
  with Harumichi Nishimura.
  IEICE Trans. Fundamentals, Vol.E92-A, No.5 May 2009.
• Improved Algorithms for Quantum Identification of Boolean Oracles,
  with Andris Ambainis, Kazuo Iwama, Akinori Kawachi and Shigeru Yamashita.
  Theoretical Computer Science 378(1): 41--53, 2007.
• [Invited] Quantum Communication Complexity -- From Alice to Bob （in Japanese）,
  with Harumichi Nishimura.
  IPSJ Magazine Vol. 47 No. 12 pp. 1347 -- 1352, Dec. 2006.
• (4,1)-Quantum random access coding does not exist -- one qubit is not enough to recover one of four bits
  with Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura and Shigeru Yamashita.
  New J. Phys. 8 (2006) 129.
• Query Complexity of Quantum Biased Oracles,
  with Kazuo Iwama and Shigeru Yamashita.
  In Quantum Computation and Information -- From Theory to Experiment, H. Imai and M. Hayashi (Eds.), TAP 102, pp. 19 -- 42, 2006.
• Quantum Identification of Boolean Oracles,
  with Andris Ambainis, Kazuo Iwama, Akinori Kawachi and Shigeru Yamashita.
  In Quantum Computation and Information -- From Theory to Experiment, H. Imai and M. Hayashi (Eds.), TAP 102, pp. 3 -- 18, 2006.

• 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.

• Kazuo Iwama, Harumichi Nishimura, Rudy Raymond and Junichi Teruyama.
  Quantum Counterfeit Coin Problems. LA Summer Symposium, July 2009.
• Kazuo Iwama, Harumichi Nishimura and Rudy Raymond.
  Designing Quantum Game Strategies from Quantum Communication Protocols. IEICE COMP-KEN 2009-12, pp. 21--38, May 2009.
• Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani and Shigeru Yamashita.
  Average/Worst-case Gaps of Quantum Query Complexities. Twelfth Workshop on Quantum Information Processing (QIP 2009), Poster presentation, Santa Fe, USA, 2009.
• A. Ambainis, K. Iwama, M. Nakanishi, H. Nishimura, R. Raymond, S. Tani, and S. Yamashita.
  Quantum Query Complexity of Boolean Functions with Small On-Sets. IEICE Technical Report, QIT2008-56, pp.39-44, November 2008.
• Rudy Raymond.
  Introduction to IBM Global Technology Outlook (GTO) 2008 and IBM Tokyo Research Lab. Presentation at The University of Aizu, Aizu, July 2, 2008.
• A. Montanaro, H. Nishimura and Rudy Raymond.
  Unbounded-Error Quantum Query Complexity. IEICE COMP-KEN 2007-56, pp. 9--14, March 2008.
• Rudy Raymond.
  Unbounded-error Quantum Query Complexity. Presentation at JST-ERATO Meeting, Kyoto, January 10-11, 2008.
• Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond and Shigeru Yamashita.
  Fidelity-Efficient Quantum Network Coding. Eleventh Workshop on Quantum Information Processing (QIP 2008), Poster presentation, New Delhi, India, 2007.
• Rudy Raymond.
  Arrangements and Unbouded-error Communication Complexity. Presentation at JST-ERATO Meeting, Kyoto, June 18-19, 2007.
• K. Iwama, H. Nishimura, R. Raymond and S. Yamashita.
  Unbounded-error Quantum Communication Complexity. IEICE Technical Report, QIT2007-26, pp.106-111, May 2007.
• Kazuo Iwama, Harumichi Nishimura, Rudy Raymond and Shigeru Yamashita.
  Quantum Random Access Coding using Multiple Qubits. Tenth Workshop on Quantum Information Processing (QIP 2007). Poster presentation, Brisbane, Australia, 2007.
• Kazuo Iwama, Harumichi Nishimura, Rudy Raymond and Shigeru Yamashita.
  Quantum Network Coding for General Graphs Tenth Workshop on Quantum Information Processing (QIP 2007). Poster presentation, Brisbane, Australia, 2007.
• Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond and Shigeru Yamashita.
  (4,1)-Quantum Random Access Coding Does Not Exist . One qubit is not enough to recover one of four bits. Proc. of Asian Conference on Quantum Information Science 2006 (AQIS 2006), pp. 188--189, Beijing, China, Sep. 2006.
• Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond and Shigeru Yamashita.
  (4,1)-Quantum Random Access Coding Does Not Exist. IEICE COMP-KEN 2006-14, pp. 33--38, May 2006.

English page

Japanese page