| 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 (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 09:40 |
Kyoto | Katsura Campus, Kyoto University | `Quantum Supremacy' Revisited - Role of Computational Complexity Theory Hiroshi Imai (UTokyo) |
[more] | |
| IN, NS (Joint) |
2023-03-02 14:20 |
Okinawa | Okinawa Convention Centre + Online (Primary: On-site, Secondary: Online) |
Free-space optical communication system with wide-steering beam for terrestrial access networks Yohei Hasegawa, Atsushi Kamoi, Hisashi Mizumoto, Hiroshi Imai, Masaki Aizono, Takeshi Kato (NEC Corp)  NS2022-195 |
We propose an free-space optical communication (FSO) system for terrestrial access networks. The proposed system has a m... [more] | NS2022-195 pp.163-168 |
| QIT (2nd) |
2021-05-24 16:40 |
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] | |
| COMP | 2016-09-06 14:30 |
Toyama | Toyama Prefectural University | On Enumeration of Spatial Proximity Patterns by Rectangle of Fixed Range in two Dimensions Tomoaki Ogasawara, Hiroshi Imai (Univ. of Tokyo), Takuya Kida (Hokkaido Univ.) COMP2016-19 |
(To be available after the conference date) [more] | COMP2016-19 pp.29-35 |
| QIT (2nd) |
2015-05-25 11:40 |
Osaka | Osaka University | Max Cuts in Graphs and Universal Optimization Software, and Benchmark Hiroshi Imai, Yosuke Yano (UTokyo) |
[more] | |
| QIT (2nd) |
2014-11-18 10:20 |
Miyagi | Tohoku Univ. | Extended Formulations of Cut Polytopes and Quantum Correlation/Interaction Hiroshi Imai, Hidefumi Hiraishi, Shuichi Hirahara (UTokyo) |
[more] | |
| COMP | 2014-10-08 10:20 |
Tokyo | Chuo University | On Extended Complexity of Generalized Transversal Matroids Shuichi Hirahara, Hiroshi Imai (Univ. of Tokyo) COMP2014-25 |
[more] | COMP2014-25 pp.1-4 |
| QIT (2nd) |
2013-11-18 11:20 |
Tokyo | Waseda Univ. | A Representation of Quantum Graph States Using Binary Decision Diagrams Yuto Hirakuri, Hidefumi Hiraishi, Hiroshi Imai (Univ. of Tokyo) |
We discuss an efficient classical simulation of measurement-based quantum computation (MQC), focusing on relationships b... [more] | |
| COMP | 2013-04-24 15:20 |
Hyogo | Kobe University | Notes on Parametric Analysis of k-Route Flow Hiroshi Imai, Jean-Francois Baffier, Hidefumi Hiraishi (Univ. of Tokyo) COMP2013-6 |
[more] | COMP2013-6 pp.33-34 |
| QIT (2nd) |
2012-11-27 11:40 |
Kanagawa | Keio Univ. Hiyoshi Campus | Classical and Quantum Algorithms for Ising Partition Function Hiroshi Imai, Yuto Hirakuri, Hidefumi Hiraishi, Norie Fu (Univ. Tokyo) |
[more] | |
| COMP | 2012-06-21 15:40 |
Hokkaido | Hokkaido University | Optimal Average Joint Hamming Weight for Asymmetric Representation Vorapong Suppakitpaisarn (Univ. of Tokyo), Masato Edahiro (Nagoya Univ.), Hiroshi Imai (Univ. of Tokyo) COMP2012-22 |
[more] | COMP2012-22 pp.79-86 |
| COMP | 2012-06-21 17:10 |
Hokkaido | Hokkaido University | Notes on weighted Delaunay triangulations and discrete Ricci flow
-- Relation between weighted Delaunay triangulations and circle packing metrics -- Toshihiro Tanuma, Hiroshi Imai (Univ. of Tokyo) COMP2012-25 |
This research is related to weighted Delaunay triangulations and a discrete Ricci flow. Specifically, we consider the fo... [more] | COMP2012-25 pp.103-109 |
| COMP | 2012-04-27 11:10 |
Osaka | Osaka Prefecture University | Generation of Ternary Matroids and Experiments on White's Conjecture Hidefumi Hiraishi, Hiroshi Imai (Univ. of Tokyo), Sonoko Moriyama (Tohoku Univ.) COMP2012-3 |
In this paper, we deal with White's conjectures. White's conjectures are two classical conjectures of matroid theory, ... [more] |
COMP2012-3 pp.15-21 |
| QIT (2nd) |
2011-11-21 11:20 |
Osaka | Osaka Univ. Engr. Sci. Sigma Hall (Toyonaka) | Towards Computational Complexity Theory for Quantum Simulation Hiroshi Imai (Univ. Tokyo) |
[more] | |
| COMP | 2010-09-29 15:10 |
Niigata | Nagaoka Univ. of Tech. | Considerations on static graphs of periodic graphs Akihiro Hashikura, Norie Fu, Hiroshi Imai (Tokyo Univ.) COMP2010-29 |
Periodic graphs are infinite graphs, which have repetitive structures. They are called static graphs.Chavey enumerated e... [more] | COMP2010-29 pp.39-43 |
| COMP | 2008-10-10 13:30 |
Miyagi | Tohoku Univ. | Computing the Tutte Polynomial of a Graph via BDD Revisited Hiroshi Imai (Univ. Tokyo), Keiko Imai (Chuo Univ.), Yoshitake Matsumoto, Sonoko Moriyama (Univ. Tokyo) COMP2008-39 |
The computation of the Tutte polynomial of a graph, even a planar one, is \#P-complete, and yet more efficient exponent... [more] |
COMP2008-39 pp.41-46 |
| COMP | 2006-06-23 15:35 |
Saitama | Saitama Univ. | Notes on Voronoi Diagrams for Pure Quantum States Kimikazu Kato (Nihon Unisys/Univ. of Tokyo), Mayumi Oto (Toshiba), Hiroshi Imai (Univ. of Tokyo), Keiko Imai (Chuo Univ.) |
We give a new geometric interpretation of quantum pure states. We reinterpret the structure of the space of pure states ... [more] | COMP2006-24 pp.49-55 |
| COMP | 2004-10-15 15:55 |
Miyagi | Tohoku University | An algorithm for computing the Holevo capacity of 1-qubit channel with using computational gemetry Mayumi Oto, Hiroshi Imai (Univ. of Tokyo), Keiko Imai (Chuo Univ.) |
Let a parameter space of qubits be a quantum space. In this space, computational-geometric problems can be treated for ... [more] |
COMP2004-51 pp.55-59 |
[Return to Top Page]