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

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 13件中 1~13件目  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
QIT
(2nd)
2019-11-19
15:10
Tokyo Gakushuin University Impossibility of blind quantum sampling for classical client
Tomoyuki Morimae (Kyoto Univ.), Harumichi Nishimura (Nagoya Univ.), Yuki Takeuchi, Seiichiro Tani (NTT)
 [more]
QIT
(2nd)
2019-11-19
15:30
Tokyo Gakushuin University Rational sumcheck protocols for classically delegating quantum computing to a quantum server
Yuki Takeuchi (NTT), Tomoyuki Morimae (Kyoto Univ.), Seiichiro Tani (NTT)
Delegated quantum computing enables a client with a weak computational power to delegate quantum computing to a remote q... [more]
QIT
(2nd)
2019-11-18
13:50
Tokyo Gakushuin University [Poster Presentation] Complexity of CPTP maps mapping quantum states into separable states
Seiseki Akibue, Go Kato, Seiichiro Tani (NTT)
(To be available after the conference date) [more]
QIT
(2nd)
2019-05-20
10:00
Fukuoka Kyushu University, Chikushi Campus Improved Quantum Multicollision-Finding Algorithm
Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa (NTT)
 [more]
COMP, IPSJ-AL 2019-05-11
11:05
Kumamoto Kumamoto University Improved Quantum Multicollision-Finding Algorithm
Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa (NTT) COMP2019-4
 [more] COMP2019-4
pp.59-65
QIT
(2nd)
2018-06-04
11:00
Hiroshima ICCH Ran Power of Uninitialized Qubits in Shallow Quantum Circuits
Yasuhiro Takahashi, Seiichiro Tani (NTT)
We study the computational power of shallow quantum circuits with $O(log n)$ initialized
and $n^{O(1)}$ uninitialized a... [more]

COMP, IPSJ-AL 2018-05-25
15:20
Aichi Nagoya Institute of Technology Power of Uninitialized Qubits in Shallow Quantum Circuits
Yasuhiro Takahashi, Seiichiro Tani (NTT) COMP2018-2
We study the computational power of shallow quantum circuits with O(log n) initialized and n^O(1) uninitialized ancillar... [more] COMP2018-2
pp.25-28
QIT
(2nd)
2017-05-30
11:10
Kyoto Ritesumeikan University, Suzaku Campus [Invited Talk] Toward quantum speed-ups with restricted models of quantum computers
Seiichiro Tani (NTT)
 [more]
QIT
(2nd)
2016-11-25
15:10
Ibaraki KEK Kobayashi-hall Power of Quantum Computation with Few Clean Qubits
Keisuke Fujii (Univ. Tokyo), Hirotada Kobayashi (NII), Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.), Shuhei Tamate (NII), Seiichiro Tani (NTT)
This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits a... [more]
COMP 2015-09-01
10:30
Nagano   Impossibility of Classically Simulating One-Clean-Qubit Computation
Keisuke Fujii (Kyoto Univ.), Hirotada Kobayashi (NII), Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.), Shuhei Tamate (NII), Seiichiro Tani (NTT) COMP2015-17
Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input... [more] COMP2015-17
pp.5-12
QIT
(2nd)
2013-11-18
11:40
Tokyo Waseda Univ. Quantum algorithms for finding constant-sized sub-hypergraphs over 3-uniform hypergraphs
Francois Le Gall (Tokyo Univ.), Harumichi Nishimura (Nagoya Univ.), Seiichiro Tani (NTT)
We develop a framework based on nested quantum walks for finding a constant-sized sub-hypergraph in a $3$-uniform hyper... [more]
COMP 2012-04-27
10:35
Osaka Osaka Prefecture University Reconstructing Strings from Substrings with Quantum Queries
Richard Cleve (Univ. of Waterloo), Kazuo Iwama (Kyoto Univ.), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.), Seiichiro Tani (NTT), Junichi Teruyama (Kyoto Univ.), Shigeru Yamashita (Ritsumeikan Univ.) COMP2012-2
This paper investigates the number of quantum queries made
to solve the problem of reconstructing an unknown string fro... [more]
COMP2012-2
pp.7-14
QIT
(2nd)
2011-11-22
13:00
Osaka Osaka Univ. Engr. Sci. Sigma Hall (Toyonaka) Computing on Quantum Anonymous Network
Hirotada Kobayashi, Keiji Matsumoto (NII), Seiichiro Tani (NTT)
 [more]
 13件中 1~13件目  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : 以上の論文すべての著作権はIEICEに帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


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