default search action
Raymond H. Putra
Person information
- affiliation: IBM Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Feng Chen, Shuhan Yuan, Jilin Hu
, Cheng-Te Li, Rudy Raymond, Lidan Shou:
Editorial: Rising stars in data mining and management 2022. Frontiers Big Data 6 (2024) - [c49]Ryosuke Matsuo, Rudy Raymond, Shigeru Yamashita, Shin-ichi Minato:
Optimizing Decision Diagrams for Measurements of Quantum Circuits. ASPDAC 2024: 134-139 - [i16]Tsuyoshi Idé, Dzung T. Phan, Rudy Raymond:
Decentralized Collaborative Learning Framework with External Privacy Leakage Analysis. CoRR abs/2404.01270 (2024) - [i15]Zichang He, Ruslan Shaydulin, Dylan Herman, Changhao Li, Rudy Raymond, Shree Hari Sureshbabu, Marco Pistoia:
Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era. CoRR abs/2408.09538 (2024) - 2023
- [c48]Izuho Koyasu, Rudy Raymond, Hiroshi Imai:
Distributed Coordinate Descent Algorithm for Variational Quantum Classification. QCE 2023: 457-467 - [c47]Kosei Teramoto, Rudy Raymond, Hiroshi Imai:
The Role of Entanglement in Quantum-Relaxation Based Optimization Algorithms. QCE 2023: 543-553 - [i14]Yaswitha Gujju, Atsushi Matsuo, Rudy Raymond:
Quantum Machine Learning on Near-Term Quantum Devices: Current State of Supervised and Unsupervised Techniques for Real-World Applications. CoRR abs/2307.00908 (2023) - 2022
- [j14]Kaito Kishi, Takahiko Satoh
Graph Kernels Encoding Features of All Subgraphs by Quantum Superposition. IEEE J. Emerg. Sel. Topics Circuits Syst. 12(3): 602-613 (2022) - [j13]Bo Yang
Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices. IEEE J. Emerg. Sel. Topics Circuits Syst. 12(3): 638-647 (2022) - [i13]Tsuyoshi Idé, Rudy Raymond:
Decentralized Collaborative Learning with Probabilistic Data Protection. CoRR abs/2208.10674 (2022) - 2021
- [j12]Tomoki Tanaka
Amplitude estimation via maximum likelihood on noisy quantum computer. Quantum Inf. Process. 20(9): 293 (2021) - [c46]Napat Thumwanit, Chayaphol Lortaraprasert, Rudy Raymond
Invited: Trainable Discrete Feature Embeddings for Quantum Machine Learning. DAC 2021: 1352-1355 - [c45]Yudai Suzuki, Hiroshi Yano, Rudy Raymond
Normalized Gradient Descent for Variational Quantum Algorithms. QCE 2021: 1-9 - [c44]Stefan Hillmich
Decision Diagrams for Quantum Measurements with Shallow Circuits. QCE 2021: 24-34 - [c43]Hiroshi C. Watanabe
Optimizing Parameterized Quantum Circuits with Free-Axis Selection. QCE 2021: 100-111 - [c42]Toshinari Itoko, Rudy Raymond
Sampling Strategy Optimization for Randomized Benchmarking. QCE 2021: 188-198 - [c41]Napat Thumwanit, Chayaphol Lortaraprasert, Hiroshi Yano, Rudy Raymond
Trainable Discrete Feature Embeddings for Quantum Machine Learning. QCE 2021: 479-480 - [c40]Lukas Burgholzer
Efficient Construction of Functional Representations for Quantum Algorithms. RC 2021: 227-241 - [c39]Tsuyoshi Idé, Rudy Raymond
Decentralized Collaborative Learning with Probabilistic Data Protection. SMDS 2021: 234-243 - [i12]Lukas Burgholzer, Rudy Raymond, Indranil Sengupta, Robert Wille:
Efficient Construction of Functional Representations for Quantum Algorithms. CoRR abs/2103.08281 (2021) - [i11]Stefan Hillmich, Charles Hadfield, Rudy Raymond, Antonio Mezzacapo, Robert Wille:
Decision Diagrams for Quantum Measurements with Shallow Circuits. CoRR abs/2105.06932 (2021) - [i10]Napat Thumwanit, Chayaphol Lortaraprasert, Hiroshi Yano, Rudy Raymond:
Trainable Discrete Feature Embeddings for Variational Quantum Classifier. CoRR abs/2106.09415 (2021) - [i9]Toshinari Itoko, Rudy Raymond:
Sampling Strategy Optimization for Randomized Benchmarking. CoRR abs/2109.07653 (2021) - 2020
- [j11]Toshinari Itoko, Rudy Raymond
Optimization of quantum circuit mapping using gate transformation and commutation. Integr. 70: 43-50 (2020) - [j10]Yohichi Suzuki, Shumpei Uno, Rudy Raymond
Amplitude estimation without phase estimation. Quantum Inf. Process. 19(2): 75 (2020) - [c38]Hiroshi Yano, Yudai Suzuki, Rudy Raymond
Efficient Discrete Feature Encoding for Variational Quantum Classifier. QCE 2020: 11-21 - [c37]Lukas Burgholzer
Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flow. QCE 2020: 356-365 - [c36]Masayasu Muraoka, Tetsuya Nasukawa, Rudy Raymond
Visual Concept Naming: Discovering Well-Recognized Textual Expressions of Visual Concepts. WWW 2020: 2556-2562 - [c35]Yutaka Shikano, Kentaro Tamura, Rudy Raymond
Detecting Temporal Correlation via Quantum Random Number Generation. QSQW 2020: 18-25
2010 – 2019
- 2019
- [c34]Takayuki Osogami, Rudy Raymond:
Determinantal Reinforcement Learning. AAAI 2019: 4659-4666 - [c33]Toshinari Itoko, Rudy Raymond
Quantum circuit compilers using gate commutation rules. ASP-DAC 2019: 191-196 - [c32]Jun Doi, Hitomi Takahashi, Rudy Raymond
Quantum computing simulator on a heterogenous HPC system. CF 2019: 85-93 - [c31]Tsuyoshi Idé
Efficient Protocol for Collaborative Dictionary Learning in Decentralized Networks. IJCAI 2019: 2585-2591 - [i8]Toshinari Itoko, Rudy Raymond, Takashi Imamichi, Atsushi Matsuo:
Optimization of Quantum Circuit Mapping using Gate Transformation and Commutation. CoRR abs/1907.02686 (2019) - 2018
- [c30]Takayuki Osogami, Rudy Raymond, Akshay Goel
Dynamic Determinantal Point Processes. AAAI 2018: 3868-3875 - [i7]Taro Sekiyama, Takashi Imamichi, Haruki Imai, Rudy Raymond:
Profile-guided memory optimization for deep neural networks. CoRR abs/1804.10001 (2018) - 2017
- [i6]Muhammad Anis Uddin Nasir, Hiroshi Horii, Marco Serafini, Nicolas Kourtellis, Rudy Raymond, Sarunas Girdzijauskas, Takayuki Osogami:
Load Balancing for Skewed Streams on Heterogeneous Cluster. CoRR abs/1705.09073 (2017) - [i5]Rudy Raymond, Takayuki Osogami, Sakyasingha Dasgupta:
Dynamic Boltzmann Machines for Second Order Moments and Generalized Gaussian Distributions. CoRR abs/1712.06132 (2017) - 2016
- [j9]Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura
Quantum Query Complexity of Almost All Functions with Fixed On-set Size. Comput. Complex. 25(4): 723-735 (2016) - [c29]Rudy Raymond
Bus trajectory identification by map-matching. ICPR 2016: 1618-1623 - [c28]Takashi Imamichi, Takayuki Osogami, Rudy Raymond:
Truncating Shortest Path Search for Efficient Map-Matching. IJCAI 2016: 589-595 - [i4]Yuko Hada Muranushi, Takayuki Muranushi, Ayumi Asai, Daisuke Okanohara, Rudy Raymond, Gentaro Watanabe, Shigeru Nemoto, Kazunari Shibata:
A Deep-Learning Approach for Operation of an Automated Realtime Flare Forecast. CoRR abs/1606.01587 (2016) - 2015
- [j8]Takayuki Osogami, Rudy Raymond
Erratum to: Analysis of transient queues with semidefinite optimization. Queueing Syst. Theory Appl. 80(4): 387-388 (2015) - 2014
- [c27]Rudy Raymond
An Approximate Counting for Big Textual Data Streams. ECAI 2014: 1085-1086 - [c26]Takayuki Osogami, Rudy Raymond
Efficient Policy Iteration for Periodic Markov Decision Processes. ECAI 2014: 1167-1172 - [c25]Satoshi Hara, Rudy Raymond
Predicting halfway through simulation: early scenario evaluation using intermediate features of agent-based simulations. WSC 2014: 334-343 - [c24]Hidemasa Muta, Rudy Raymond
A multi-objective genetic algorithm using intermediate features of simulations. WSC 2014: 793-804 - 2013
- [j7]Takayuki Osogami, Rudy Raymond
Analysis of transient queues with semidefinite optimization. Queueing Syst. Theory Appl. 73(2): 195-234 (2013) - [c23]Takayuki Osogami, Rudy Raymond:
Map Matching with Inverse Reinforcement Learning. IJCAI 2013: 2547-2553 - [c22]Hiroki Yanagisawa, Takayuki Osogami, Rudy Raymond
Dependable virtual machine allocation. INFOCOM 2013: 629-637 - [c21]Takashi Imamichi, Rudy Raymond
Simple and fast trip generation for large scale traffic simulation. WSC 2013: 2020-2031 - 2012
- [j6]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond
Quantum counterfeit coin problems. Theor. Comput. Sci. 456: 51-64 (2012) - [c20]Rudy Raymond, Tetsuro Morimura, Takayuki Osogami, Noriaki Hirosue:
Map matching with Hidden Markov Model on sampled road network. ICPR 2012: 2242-2245 - [c19]Miki Enoki, Yohei Ikawa, Rudy Raymond
User community reconstruction using sampled microblogging data. WWW (Companion Volume) 2012: 657-660 - 2011
- [j5]Ashley Montanaro
Unbounded-error quantum query complexity. Theor. Comput. Sci. 412(35): 4619-4628 (2011) - [c18]Takayuki Osogami, Rudy Raymond
Simple bounds for a transient queue. DSN 2011: 562-573 - [c17]Rudy Raymond
Location recommendation based on location history and spatio-temporal correlations for an on-demand bus system. GIS 2011: 377-380 - 2010
- [c16]Akiko Murakami, Rudy Raymond:
Support or Oppose? Classifying Positions in Online Debates from Reply Activities and Opinion Expressions. COLING (Posters) 2010: 869-875 - [c15]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond
Quantum Counterfeit Coin Problems. ISAAC (1) 2010: 85-96 - [c14]Rudy Raymond
Fast and Scalable Algorithms for Semi-supervised Link Prediction on Static and Dynamic Graphs. ECML/PKDD (3) 2010: 131-147 - [c13]Takayuki Osogami, Rudy Raymond
Semidefinite optimization for transient analysis of queues. SIGMETRICS 2010: 363-364 - [i3]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum Counterfeit Coin Problems. CoRR abs/1009.0416 (2010)
2000 – 2009
- 2009
- [j4]Harumichi Nishimura, Rudy Raymond
Quantum Random Access Coding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(5): 1268-1275 (2009) - [i2]Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita:
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size. CoRR abs/0908.2468 (2009) - 2008
- [c12]Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond
Polynomial-Time Construction of Linear Network Coding. ICALP (1) 2008: 271-282 - [c11]Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond
Quantum Query Complexity of Boolean Functions with Small On-Sets. ISAAC 2008: 907-918 - [c10]Ashley Montanaro
Unbounded-Error Quantum Query Complexity. ISAAC 2008: 919-930 - 2007
- [j3]Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond
Improved algorithms for quantum identification of Boolean oracles. Theor. Comput. Sci. 378(1): 41-53 (2007) - [c9]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond
Unbounded-Error One-Way Classical and Quantum Communication Complexity. ICALP 2007: 110-121 - [c8]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond
Unbounded-Error Classical and Quantum Communication Complexity. ISAAC 2007: 100-111 - [c7]Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond Harry Putra
Quantum Network Coding. STACS 2007: 610-621 - [c6]Ryo Hirade, Rudy Raymond
Sensitivity analysis on causal events of WIP bubbles by a log-driven simulator. WSC 2007: 1747-1754 - 2006
- [b1]Raymond H. Putra:
Studies on quantum query complexities and quantum network coding. Kyoto University, Japan, 2006 - [j2]Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita:
Quantum lower bounds for the Goldreich-Levin problem. Inf. Process. Lett. 97(5): 208-211 (2006) - [c5]Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond
(4, 1)-Quantum Random Access Coding Does Not Exist. ISIT 2006: 446-450 - [c4]Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond Harry Putra
Improved Algorithms for Quantum Identification of Boolean Oracles. SWAT 2006: 280-291 - [i1]Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
Quantum Network Coding. Complexity of Boolean Functions 2006 - 2005
- [j1]Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba
Universal test for quantum one-way permutations. Theor. Comput. Sci. 345(2-3): 370-385 (2005) - 2004
- [c3]Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Raymond H. Putra:
Universal Test for Quantum One-Way Permutations. MFCS 2004: 839-850 - [c2]Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita:
Quantum Identification of Boolean Oracles. STACS 2004: 105-116 - 2002
- [c1]Masami Amano, Kazuo Iwama, Raymond H. Putra:
Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations. UMC 2002: 100-114
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: