Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
QIT (2nd) 
20220531 17:00 
Online 
Online 
Computational selftesting for entangled magic states Akihiro Mizutani (Mitsubishi Electric), Yuki Takeuchi (NTT), Ryo Hiromasa, Yusuke Aikawa (Mitsubishi Electric), Seiichiro Tani (NTT) 
[more] 

QIT (2nd) 
20211130 11:30 
Online 
Online 
Halving the length of approximate classical representations of pure quantum states with probabilistic encoding Seiseki Akibue, Go Kato, Seiichiro Taniei (NTT) 
Pure quantum states are often approximately encoded as classical bitstrings such as those representing probability ampl... [more] 

QIT (2nd) 
20211201 14:00 
Online 
Online 
Divideandconquer verification method for noisy intermediatescale quantum computation Yuki Takeuchi, Yasuhiro Takahashi (NTT), Tomoyuki Morimae (Kyoto Univ.), Seiichiro Tani (NTT) 
Several noisy intermediatescale quantum computations can be regarded as logarithmicdepth quantum circuits on a sparse ... [more] 

COMP, IPSJAL 
20210825 16:30 
Online 
Online 
Rational sumcheck protocols for classically delegating quantum computing to a quantum server Yuki Takeuchi (NTT), Tomoyuki Morimae (Kyoto Univ.), Seiichiro Tani (NTT) COMP202111 
Recently, a new model of delegated quantum computing has been proposed, namely, rational delegated quantum computing.
... [more] 
COMP202111 pp.1013 
COMP 
20210308 14:45 
Online 
Online 
Classically Simulating Quantum Circuits with Local Depolarizing Noise Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani (NTT) COMP202033 
We study the effect of noise on the classical simulatability of quantum circuits defined by computationally tractable (C... [more] 
COMP202033 pp.2629 
QIT (2nd) 
20201210 16:30 
Online 
Online 
Classically Simulating Quantum Circuits with Local Depolarizing Noise Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani (NTT) 
We study the effect of noise on the classical simulatability of quantum circuits defined by computationally tractable (C... [more] 

QIT (2nd) 
20201210 17:10 
Online 
Online 
Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams Seiichiro Tani (NTT) 
An ordered binary decision diagram (OBDD) is a directed acyclic graph that represents a Boolean function.
Since OBDDs h... [more] 

QIT (2nd) 
20201211 16:20 
Online 
Online 
Almost entanglementbreaking channel approximately generating arbitrary separable states requires exponentially large input system
 Application for disentangler conjecture  Seiseki Akibue, Go Kato, Seiichiro Tani (NTT) 
(To be available after the conference date) [more] 

QIT (2nd) 
20191119 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) 
20191119 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) 
20191118 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) 
20190520 10:00 
Fukuoka 
Kyushu University, Chikushi Campus 
Improved Quantum MulticollisionFinding Algorithm Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa (NTT) 
[more] 

COMP, IPSJAL 
20190511 11:05 
Kumamoto 
Kumamoto University 
Improved Quantum MulticollisionFinding Algorithm Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa (NTT) COMP20194 
[more] 
COMP20194 pp.5965 
QIT (2nd) 
20180604 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, IPSJAL 
20180525 15:20 
Aichi 
Nagoya Institute of Technology 
Power of Uninitialized Qubits in Shallow Quantum Circuits Yasuhiro Takahashi, Seiichiro Tani (NTT) COMP20182 
We study the computational power of shallow quantum circuits with O(log n) initialized and n^O(1) uninitialized ancillar... [more] 
COMP20182 pp.2528 
QIT (2nd) 
20170530 11:10 
Kyoto 
Ritesumeikan University, Suzaku Campus 
[Invited Talk]
Toward quantum speedups with restricted models of quantum computers Seiichiro Tani (NTT) 
[more] 

QIT (2nd) 
20161125 15:10 
Ibaraki 
KEK Kobayashihall 
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 polynomialtime quantum computation in which only a very limited number of qubits a... [more] 

COMP 
20150901 10:30 
Nagano 

Impossibility of Classically Simulating OneCleanQubit Computation Keisuke Fujii (Kyoto Univ.), Hirotada Kobayashi (NII), Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.), Shuhei Tamate (NII), Seiichiro Tani (NTT) COMP201517 
Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input... [more] 
COMP201517 pp.512 
QIT (2nd) 
20131118 11:40 
Tokyo 
Waseda Univ. 
Quantum algorithms for finding constantsized subhypergraphs over 3uniform 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 constantsized subhypergraph in a $3$uniform hyper... [more] 

COMP 
20120427 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.) COMP20122 
This paper investigates the number of quantum queries made
to solve the problem of reconstructing an unknown string fro... [more] 
COMP20122 pp.714 