| 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-18 16:20 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
Rewindable quantum computation and its equivalence to cloning and adaptive postselection Yuki Takeuchi (NTT), Ryo Hiromasa (Mitsubishi Electric Corp.), Akihiro Mizutani (Univ. of Toyama), Seiichiro Tani (NTT) |
We define rewinding operators that invert quantum measurements. Then, we define complexity classes ${¥sf RwBQP}$, ${¥sf... [more] |
|
| QIT (2nd) |
2023-05-29 13:20 |
Kyoto | Katsura Campus, Kyoto University | Probabilistic state synthesis based on optimal convex approximation Seiseki Akibue (NTT), Go Kato (NICT), Seiichiro Tani (NTT) |
When preparing a pure state with a quantum circuit, there is an inevitable coherent error since each unitary gate suffer... [more] | |
| QIT (2nd) |
2022-12-08 14:00 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Probabilistic unitary synthesis with optimal accuracy Seiseki Akibue (NTT), Go Kato (NICT), Seiichiro Tani (NTT) |
[more] | |
| QIT (2nd) |
2022-05-31 17:00 |
Online | Online | Computational self-testing for entangled magic states Akihiro Mizutani (Mitsubishi Electric), Yuki Takeuchi (NTT), Ryo Hiromasa, Yusuke Aikawa (Mitsubishi Electric), Seiichiro Tani (NTT) |
[more] | |
| QIT (2nd) |
2021-11-30 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 bit-strings such as those representing probability ampl... [more] | |
| QIT (2nd) |
2021-12-01 14:00 |
Online | Online | Divide-and-conquer verification method for noisy intermediate-scale quantum computation Yuki Takeuchi, Yasuhiro Takahashi (NTT), Tomoyuki Morimae (Kyoto Univ.), Seiichiro Tani (NTT) |
Several noisy intermediate-scale quantum computations can be regarded as logarithmic-depth quantum circuits on a sparse ... [more] | |
| COMP, IPSJ-AL | 2021-08-25 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)  COMP2021-11 |
Recently, a new model of delegated quantum computing has been proposed, namely, rational delegated quantum computing. ... [more] |
COMP2021-11 pp.10-13 |
| COMP | 2021-03-08 14:45 |
Online | Online | Classically Simulating Quantum Circuits with Local Depolarizing Noise Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani (NTT) COMP2020-33 |
We study the effect of noise on the classical simulatability of quantum circuits defined by computationally tractable (C... [more] | COMP2020-33 pp.26-29 |
| QIT (2nd) |
2020-12-10 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) |
2020-12-10 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) |
2020-12-11 16:20 |
Online | Online | Almost entanglement-breaking 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) |
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] | |
[Return to Top Page]