Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
QIT (2nd) |
2021-11-30 13:30 |
Online |
Online |
[Poster Presentation]
Effect of additional operations for quantum annealing Yuta Otsubo (Keio Univ.), Tatsuhiko Shirai (Waseda Univ.), Shu Tanaka (Keio Univ.) |
When we solve combinatorial optimization problems with constraints by quantum annealing, it is neces- sary to adjust the... [more] |
|
IPSJ-AVM, CS, IE, ITE-BCT [detail] |
2021-11-25 11:15 |
Online |
Online |
CS2021-62 IE2021-21 |
A light field (LF) image is composed of multi-view images acquired by slightly offset viewpoints. We propose a novel met... [more] |
CS2021-62 IE2021-21 pp.13-18 |
MSS, CAS, IPSJ-AL [detail] |
2021-11-19 10:55 |
Online |
Online |
Ising Model Formulation for Job-shop Scheduling Problems based on Petri Nets Modeling Kohei Kaneshima, Morikazu Nakamura (Univ. of the Ryukyus) CAS2021-48 MSS2021-28 |
Quantum annealing has been drawing attention as a fast algorithm for solving combinatorial optimization problems.
The o... [more] |
CAS2021-48 MSS2021-28 pp.64-69 |
MBE, NC (Joint) |
2021-10-29 11:15 |
Online |
Online |
Visualization and quantification of the difficulty of combinatorial optimization problems in Ising formulation Keiichi Soejima (Saitama Univ.), Makiko Konoshima, Hirotaka Tamura (Fujitsu), Jun Ohkubo (Saitama Univ.) NC2021-25 |
With the aim of rapidly solving combinatorial optimization problems, dedicated hardware using the Ising Model is being d... [more] |
NC2021-25 pp.40-45 |
SDM |
2021-06-22 17:10 |
Online |
Online |
Influence of quantized bit precision and bit-error rate in Computation-in-Memory with ReRAM on optimal answers of combinatorial optimization problems Naoko Misawa, Kenta Taoka, Shunsuke Koshino, Chihiro Matsui, Ken Takeuchi (Univ. Tokyo) SDM2021-28 |
The knapsack problem, one of combinatorial optimization problems, is solved effectively by simulated annealing in ReRAM ... [more] |
SDM2021-28 pp.23-26 |
RECONF |
2021-06-09 13:00 |
Online |
Online |
[Invited Talk]
Large-scale combinatorial optimization in real-time systems by FPGA-based accelerators for simulated bifurcation Kosuke Tatsumura (TOSHIBA) RECONF2021-11 |
Combinatorial optimization problems are economically valuable but computationally hard to solve. Many practical combinat... [more] |
RECONF2021-11 pp.56-61 |
WBS, IT, ISEC |
2021-03-04 10:55 |
Online |
Online |
Solving Shortest Vector Problem using annealing computation
-- How to generate a hamiltonian using pseudo multispin flip method -- Junpei Yamaguchi (Fujitsu Llaboratories), Takuya Ohwa (Kyushu Institute of Technology), Kazuyoshi Furukawa (Fujitsu Llaboratories) IT2020-121 ISEC2020-51 WBS2020-40 |
Lattice-based cryptography is mainly based on the security of the Shortest Vector Problem (SVP) and considered to be a p... [more] |
IT2020-121 ISEC2020-51 WBS2020-40 pp.58-65 |
NC, MBE (Joint) |
2021-03-05 11:20 |
Online |
Online |
Memory Capacity of Sparse-Coding Hopfield model Implemented on Coherent Ising Machine Ryuta Sasaki, Toru Aonishi (TokyoTech), Kazushi Mimura (Hiroshima City Univ.), Masato Okada (Univ. Tokyo), Yoshihisa Yamamoto (NTT/Stanford Univ.) NC2020-68 |
The coherent Ising machine (CIM) is being developed as one of the Ising computers for solving combinatorial optimization... [more] |
NC2020-68 pp.145-150 |
WPT, AP (Joint) |
2021-01-22 11:35 |
Online |
Online |
[Invited Lecture] Modeling for radio propagation analysis by quantum computing Tetsuro Imai (TDU), Wataru Yamada, Minoru Inomata, Nobuaki Kuno (NTT) AP2020-113 |
At present, the development of quantum computers is remarkable, and the quantum annealing method specializing in combina... [more] |
AP2020-113 pp.56-60 |
PRMU |
2020-12-17 16:30 |
Online |
Online |
Towards Discovery of Relevant Latent Factors with Limited Data Mohit Chhabra, Quan Kong, Tomoaki Yoshinaga (Hitachi) PRMU2020-49 |
The remarkable effectiveness of neural networks on vision tasks has led to an interest in adapting neural network models... [more] |
PRMU2020-49 pp.63-68 |
IT, SIP, RCS |
2020-01-24 13:00 |
Hiroshima |
Hiroshima City Youth Center |
Proposal of Denoising Method Based on Sparseness of NMRS Signals Satoru Kubota (TUS), Kazunori Uruma (Kogakuin), Yuuho Tanaka, Norisato Suga, Toshihiro Furukawa (TUS) IT2019-74 SIP2019-87 RCS2019-304 |
Nuclear magnetic resonance spectroscopy (NMRS) is very useful in basic chemical and physiological research, including th... [more] |
IT2019-74 SIP2019-87 RCS2019-304 pp.221-225 |
NC, MBE |
2019-12-06 14:40 |
Aichi |
Toyohashi Tech |
Implementation of an FPGA-based energy-efficient MCMC method for 2D Lenz-Ising model Patrick Tchicali, Hayaru Shouno (UEC) MBE2019-54 NC2019-45 |
MCMC methods are arguably one of the most useful sampling methods. MCMC while being very useful and practical remains a ... [more] |
MBE2019-54 NC2019-45 pp.55-60 |
QIT (2nd) |
2019-11-18 13:50 |
Tokyo |
Gakushuin University |
[Poster Presentation]
Accelerating Quantum Dynamics Simulation with GPU Yoshiaki Kawase, Keisuke Fujii (Osaka Univ.) |
In recent years, noisy intermediate-scale quantum computer (NISQ) has appeared, and it is expected that quantum algorith... [more] |
|
VLD, DC, CPSY, RECONF, ICD, IE, IPSJ-SLDM, IPSJ-EMB, IPSJ-ARC (Joint) [detail] |
2019-11-14 14:15 |
Ehime |
Ehime Prefecture Gender Equality Center |
Solving Traveling Salesman Problem Using Grid Partitioning via Ising-Model based Solver Akira Dan, Takeshi Nishikawa, Takashi Sato (Kyoto Univ.) VLD2019-40 DC2019-64 |
Ising-model based solver is gaining increasing attention
for its efficiency in finding approximate solutions for
com... [more] |
VLD2019-40 DC2019-64 pp.97-102 |
MIKA (2nd) |
2019-10-04 10:15 |
Hokkaido |
Hokkaido Univ. |
[Poster Presentation]
Optimization of Channel Allocation and Transmission Power for D2D Communication Using Coherent Ising Machine Yuchang Jiang, Hirotake Ito, Shoya Kobayashi (TUS), Hiroki Takesue (NTT), Kazuyuki Aihara (UT), Mikio Hasegawa (TUS) |
The effectiveness of a high-speed combinatorial optimization method using a coherent Ising machine (CIM) has been shown.... [more] |
|
NLP |
2019-09-23 15:35 |
Kochi |
Eikokuji Campus, University of Kochi |
An Attempt to Construct Layered GF(2^q) LDPC Decoders Akiyoshi Yasuda, Hisato Fujisaka, Takeshi Kamio (Hiroshima City Univ.) NLP2019-47 |
It has been reported that the sum-product algorithm for error correction of LDPC sequences is equivalent to a kind of th... [more] |
NLP2019-47 pp.61-66 |
SDM, ICD, ITE-IST [detail] |
2019-08-07 13:30 |
Hokkaido |
Hokkaido Univ., Graduate School /Faculty of Information Science and |
[Invited Talk]
A Scalable CMOS Annealing Processor for Solving Large-scale Combinatorial Optimization Problems Masato Hayashi, Takashi Takemoto, Chihiro Yoshimura, Masanao Yamaoka (Hitachi) SDM2019-36 ICD2019-1 |
This paper presents a CMOS annealing processor (CMOS-AP) that accelerates ground state searches of the Ising model. The ... [more] |
SDM2019-36 ICD2019-1 pp.1-5 |
VLD, IPSJ-SLDM |
2019-05-15 13:55 |
Tokyo |
Ookayama Campus, Tokyo Institute of Technology |
A study on replica topology and temperature assignment for Ising-Model based Solver via Parallel Tempering Akira Dan, Takashi Sato (Kyoto Univ.) VLD2019-1 |
Ising-model based solver {¥sato{is gaining increasing}} attention
{¥sato{for its efficiency in}} finding approximate s... [more] |
VLD2019-1 pp.7-12 |
NC, MBE (Joint) |
2019-03-06 16:15 |
Tokyo |
University of Electro Communications |
Examination of Super Resolution and Noise Removal for MicroCT Image Miku Mashimo, Hayaru Shouno (UEC) NC2018-86 |
The purpose of this research is to increase the resolution of MicroCT (Computed Tomography) images.
The MicroCT image i... [more] |
NC2018-86 pp.227-232 |
IPSJ-SLDM, RECONF, VLD, CPSY, IPSJ-ARC [detail] |
2019-01-30 15:05 |
Kanagawa |
Raiosha, Hiyoshi Campus, Keio University |
Design and implementation of FPGA measurement feedback system in Coherent Ising Machine Toshimori Honjo, Takahiro Inagaki, Kensuke Inaba, Takuya Ikuta, Hiroki Takesue (NTT) VLD2018-78 CPSY2018-88 RECONF2018-52 |
To solve combinatorial optimization problems, the way to utilize new type of computer that can find ground state of Isin... [more] |
VLD2018-78 CPSY2018-88 RECONF2018-52 pp.37-42 |