フォロー
Yasuhiro Takahashi
Yasuhiro Takahashi
確認したメール アドレス: cs.tsukuba.ac.jp
タイトル
引用先
引用先
Quantum addition circuits and unbounded fan-out
Y Takahashi, S Tani, N Kunihiro
Quantum Information & Computation 10 (9&10), 872-890, 2010
1662010
A linear-size quantum circuit for addition with no ancillary qubits
Y Takahashi, N Kunihiro
Quantum Information & Computation 5 (6), 440-448, 2005
932005
A quantum circuit for Shor's factoring algorithm using 2n+ 2 qubits
Y Takahashi, N Kunihiro
Quantum Information & Computation 6 (2), 184-192, 2006
642006
A fast quantum circuit for addition with few qubits
Y Takahashi, N Kunihiro
Quantum Information & Computation 8 (6), 636-649, 2008
582008
The quantum Fourier transform on a linear nearest neighbor architecture
Y Takahashi, N Kunihiro, K Ohta
Quantum Information & Computation 7 (4), 383-391, 2007
472007
Quantum arithmetic circuits: a survey
Y Takahashi
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 2009
392009
Collapse of the hierarchy of constant-depth exact quantum circuits
Y Takahashi, S Tani
computational complexity 25, 849-881, 2016
382016
Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates
Y Takahashi, T Yamazaki, K Tanaka
Quantum Information & Computation 14 (13&14), 1149-1164, 2014
142014
Classically simulating quantum circuits with local depolarizing noise
Y Takahashi, Y Takeuchi, S Tani
Theoretical Computer Science 893, 117-132, 2021
102021
Ancilla-driven instantaneous quantum polynomial time circuit for quantum supremacy
Y Takeuchi, Y Takahashi
Physical Review A 94 (6), 062336, 2016
92016
Divide-and-conquer verification method for noisy intermediate-scale quantum computation
Y Takeuchi, Y Takahashi, T Morimae, S Tani
Quantum 6, 758, 2022
82022
Power of uninitialized qubits in shallow quantum circuits
Y Takahashi, S Tani
Theoretical Computer Science 851, 129-153, 2021
82021
Commuting quantum circuits with few outputs are unlikely to be classically simulatable
Y Takahashi, S Tani, T Yamazaki, K Tanaka
Quantum Information & Computation 16 (3&4), 251-270, 2016
72016
An efficient dialogue control method using decision tree-based estimation of out-of-vocabulary word attributes.
Y Takahashi, K Dohsaka, K Aikawa
INTERSPEECH, 813-816, 2002
72002
Simple sets of measurements for universal quantum computation and graph state preparation
Y Takahashi
International Journal of Quantum Information 8 (06), 1001-1012, 2010
42010
Constant-depth quantum circuits with gates for addition
Y Takahashi, Y Kawano, M Kitagawa
Proc. ERATO Conference on Quantum Information Science (EQIS2003) 1, 2003
22003
Efficient quantum circuits for arithmetic operations and their applications
高橋康博, タカハシヤスヒロ
12008
Hardness of efficiently generating ground states in postselected quantum computation
Y Takeuchi, Y Takahashi, S Tani
Physical Review Research 3 (1), 013213, 2021
2021
Efficiently generating ground states is hard for postselected quantum computation
Y Takeuchi, Y Takahashi, S Tani
arXiv e-prints, arXiv: 2006.12125, 2020
2020
Shallow Quantum Circuits with Uninitialized Ancillary Qubits
Y Takahashi, S Tani
arXiv preprint arXiv:1608.07020, 2016
2016
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20