| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| QIT (2nd) |
2023-12-17 17:30 |
Okinawa | OIST (Okinawa, Online) (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Solving Not-All-Equal 3SAT using Quantum Random Access Optimization Benedek Hauer, Rudy Raymond, Hiroshi Imai (UTokyo) |
Quadratic unconstrained binary optimization (QUBO) is one of target applications of near-term quantum algorithms with ma... [more] | |
| QIT (2nd) |
2023-05-29 16:30 |
Kyoto | Katsura Campus, Kyoto University (Kyoto) | [Poster Presentation]
Method to reduce the number of qubits used in QAOA using QRAC Tatsuya Nakao (Ritsumeikan Univ), Rudy Raymond (IBM Japan), Shigeru Yamashita (Ritsumeikan Univ) |
[more] | |
| QIT (2nd) |
2022-12-08 17:45 |
Kanagawa | Keio Univ. (Kanagawa, Online) (Primary: On-site, Secondary: Online) |
Optimal Measurement Configurations for Sequential Quantum Optimization of Variational Quantum Eigensolver Katsuhiro Endo (AIST/Keio Univ.), Hiroshi Watanabe (Keio Univ.), Yuki Sato (Toyota Central R&D Labs., Inc./Keio Univ.), Rudy Raymond (IBM Japan,Ltd./Keio Univ./The Univ. of Tokyo), Naoki Yamamoto, Mayu Muramatsu (Keio Univ.) |
Variational Quantum Eigenvalue solver (VQE) is a hybrid algorithm that optimizes a quantum state represented by a parame... [more] | |
| QIT (2nd) |
2021-12-01 14:40 |
Online | Online (Online) | Simulating Time Evolution with Fully Optimized Single-Qubit Gates Kaito Wada (Keio Univ.), Rudy Raymond (IBM), Yu-ya Ohnishi (JSR Corp.), Eriko Kaminishi, Michihiko Sugawara, Naoki Yamamoto, Hiroshi Watanabe (Keio Univ.) |
We propose a novel method to sequentially optimize arbitrary single-qubit gates in parameterized quantum circuits for si... [more] | |
| QIT (2nd) |
2021-05-24 16:40 |
Online | Online (Online) | Experimental Realization of Quantum Non-locality on IBM Quantum Devices Kosei Teramoto, Yang Bo (Univ. of Tokyo), Rudy Raymond (IBM Japan), Atsuya Hasegawa, Hiroshi Imai (Univ. of Tokyo), Hidefumi Hiraishi (Nihon Univ.) |
Quantum non-locality is a phenomenon in which the measurement results of a quantum state cannot be reproduced locally in... [more] | |
| QIT (2nd) |
2020-12-11 17:30 |
Online | Online (Online) | Independency Analysis of the Output of Quantum Computers via Random Number Generation Kentaro Tamura, Yutaka Shikano (Keio Univ.), Rudy Raymond (IBM Research Tokyo) |
[more] | |
| QIT (2nd) |
2018-11-26 17:30 |
Tokyo | The University of Tokyo (Tokyo) | Dynamic Boltzmann Machine for Improving Readout Fidelity of Near-Term Intermediate Scale Quantum Devices Rudy Raymond, Takayuki Osogami (TRL) |
[more] | |
| COMP | 2009-05-26 11:15 |
Saitama | Saitama Univ. (Saitama) | Designing Quantum Game Strategies from Quantum Communication Protocols Kazuo Iwama (Kyoto Univ.), Harumichi Nishimura (Osaka Pref. Univ.), Rudy Raymond (IBM Japan)  COMP2009-12 |
In their recent paper, Cleve , Slofstra, Unger and Upadhyay showed that the $CHSH^{\oplus{n}}$, a natural extension of t... [more] | COMP2009-12 pp.21-28 |
| COMP | 2008-03-10 09:55 |
Kanagawa | (Kanagawa) | Unbounded-Error Quantum Query Complexity Ashley Montanaro (Univ. of Bristol), Harumichi Nishimura (Osaka Prefecture Univ.), Rudy Raymond (IBM) COMP2007-56 |
This work studies the quantum query complexity of Boolean functions in an unbounded-error scenario where it is only requ... [more] | COMP2007-56 pp.9-14 |
| COMP | 2006-05-24 14:10 |
Fukuoka | Kyushu Institute of Technology (Fukuoka) | (4,1)-Quantum Random Access Coding Does Not Exist Masahito Hayashi (JST), Kazuo Iwama (Kyoto Univ.), Harumichi Nishimura (Osaka Prefecture Univ.), Rudy Raymond (Kyoto Univ.), Shigeru Yamashita (NAIST) |
An (n,1,p)-Quantum Random Access (QRA) coding, introduced by Ambainis, Nayak, Ta-shma and Vazirani in ACM Symp. on The... [more] |
COMP2006-14 pp.33-38 |
| COMP | 2005-12-22 13:00 |
Tokushima | The University of Tokushima (Tokushima) | Transmitting classical information on the quantum network efficiently Kazuo Iwama, Harumichi Nishimura, Rudy Raymond (Kyoto Univ.), Shigeru Yamashita (NAIST) |
The question in this paper is whether the quantum random access (QRA) coding, given by Ambainis et al., on the {\it netw... [more] | COMP2005-51 pp.15-20 |
[Return to Top Page]