IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 10 of 10  /   
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] Reducing Quantum Communication Complexity of Linear Regression
Sayaki Matsushita (Nagoya)
Quantum coordinator model is a model that has a referee and multiple parties that can only communicate with the referee.... [more]
QIT
(2nd)
2023-12-17
17:30
Okinawa OIST
(Primary: On-site, Secondary: Online)
[Poster Presentation] Optical Nanofiber Microcavity for Strong Coupling Quantum System
Maki Maeda, Jameesh Keloth, Priscila Romagnoli, Sile Nic Chormaic (OIST)
The strong coupling (SC) regime of optical nanofiber (ONF)-based cavity quantum electrodynamics (cQED) was only observed... [more]
COMP, IPSJ-AL 2023-05-11
10:00
Hokkaido Hokkaido University A computational complexity assumption necessary for pseudorandom quantum states generators
Yuki Shirakawa (Kyoto Univ.) COMP2023-2
Pseudorandom quantum states generators (PRSGs) are efficient quantum algorithms that output quantum states which are com... [more] COMP2023-2
pp.2-7
SR 2022-05-13
15:35
Tokyo NICT Koganei
(Primary: On-site, Secondary: Online)
[Invited Lecture] Mathematical Similarity Between Wireless Communication and Quantum Computation: Basic Principles and State-of-the-Art Studies
Naoki Ishikawa, Masaya Norimoto, Yuki Sano (Yokohama National Univ.) SR2022-18
Focusing on the mathematical similarity between wireless communication and quantum computation, our presentation reviews... [more] SR2022-18
p.77
WBS, IT, ISEC 2021-03-04
11:45
Online Online Streaming Data Compression and Decompression by One-Way Quantum Finite-State Automata, Leading to Quantum Finite-State Deep and Shallow Information (Preliminary Report)
Tomoyuki Yamakami (U of Fukui) IT2020-117 ISEC2020-47 WBS2020-36
The logical depth of a piece of data has served as a complexity measure to
describe the amount of “useful” and "non-ran... [more]
IT2020-117 ISEC2020-47 WBS2020-36
pp.31-36
QIT
(2nd)
2019-11-18
13:50
Tokyo Gakushuin University [Poster Presentation] Quantum Communication Complexity of Distribution Testing
Aleksandrs Belovs (Univ. of Latvia), Arturo Castellanos (Kyoto Univ.), Francois Le Gall, Guillaume Malod (Nagoya Univ.)
We study the quantum version of the closeness testing problem in communication complexity, in the case where Alice and B... [more]
PN 2013-03-12
14:10
Okinawa Okinawa-ken Seinen-Kaikan Prevention Properties of Optical-CDMA and Y-00 Quantum Stream Cipher against Signal Altenation Attacks
Takehisa Iwakoshi, Osamu Hirota (Tamagawa Univ.) PN2012-89
In the modern society, mathematical ciphers are often used to protect transmitted data. However, there are possibilities... [more] PN2012-89
pp.65-69
QIT
(2nd)
2012-11-27
11:20
Kanagawa Keio Univ. Hiyoshi Campus A Quantum Relay using Quantum Scret Sharing
Takashi Suzuki, Akihisa Tomita (Hokkaido Univ)
In order to relax the demand for the trusted relay points in a quantum relay, we propose a protocol of the quantum relay... [more]
COMP 2009-05-26
11:15
Saitama Saitama Univ. 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   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
 Results 1 - 10 of 10  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan