| No. |
発表題名 |
発表会議名(発表誌等の媒体名) |
発表年月日 |
| 1 |
Reconstructing Strings from Substrings with Quantum Queries
|
To appear in the 13th Scandinavian Workshop on Algorithm Theory (SWAT2012).
|
2012/07
|
| 2 |
Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication
|
TAMC 2012
|
2012/05
|
| 3 |
Improved Quantum Algorithms for Reconstructing Strings from Substrings
|
Asian Association for Algorithms and Computation (AAAC2011)
|
2012/04
|
| 4 |
Bit Selective SAD and Its Evaluation
|
Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI), pp. 22-27
|
2012/03
|
| 5 |
A TMR-based Soft Error Mitigation Technique With Less Area Overhead in High-Level Synthesis
|
Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI), pp. pp. 396-401
|
2012/03
|
| 6 |
High-Level Synthesis Using Partially-Programmable Resources for Yield Improvement
|
Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI), pp. 414-419
|
2012/03
|
| 7 |
Evaluation of Migration Methods for Island Based Parallel Genetic Algorithm on CUDA
|
Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI), pp. 378-383
|
2012/03
|
| 8 |
トポロジカル量子コンピュータにおける量子回路の最適化手法
|
電子情報通信学会関西支部学生会 第17回学生会研究発表講演会
|
2012/03/09
|
| 9 |
SeqBDDにおける最長共通部分列・部分文字列アルゴリズム
|
電子情報通信学会関西支部学生会 第17回学生会研究発表講演会
|
2012/03/09
|
| 10 |
On Error Tolerance and Engineering Change with Partially Programmable Circuits
|
ASP-DAC'12, pp. 695-700
|
2012/02
|
| 11 |
Logic level circuit optimization for topological quantum computation (Invited Talk)
|
Dagstuhl Seminar 11502: Design of Reversible and Quantum Circuits
|
2011/12
|
| 12 |
Logic level circuit ooptimization for topological quantum computation
|
in Proc. of QIT25, pp. 185-188
|
2011/11
|
| 13 |
An Efficient Algorithm for Constructing a Sequence Binary Decision Diagram Representing a Set of Reversed Sequences
|
IEEE International Conference on Granular Computing 2011, pp. 54-55.
|
2011/11
|
| 14 |
SAD演算回路における最適な比較ビット使用箇所およびブロックサイズの検討
|
情報処理学会関西支部支部大会, Sep. 2011
|
2011/09
|
| 15 |
Quantum Query Complexity of Hamming Distance Estimation
|
in Proc. of AQIS’11, pp. 103-104
|
2011/08
|
| 16 |
リソースの再利用による実装面積を考慮した耐故障化高位合成手法 (in Japanese)
|
DAシンポジウム 2011 論文集, pp. 15-20
|
2011/08
|
| 17 |
Changing the Gate Order for Optimal LNN Conversion
|
Proc. of 3rd Workshop on Reversible Computation, pp. 175--186
|
2011/07/05
|
| 18 |
逆順の系列集合を表すSeqBDDの構築
|
電子情報通信学会技術研究報告, COMP, コンピュテーション, vol.111, no.20, pp.17-23
|
2011/04
|
| 19 |
Reconstructing Strings from Substrings with Quantum Queries
|
Asian Association for Algorithms and Computation (AAAC2011)
|
2011/04/17
|
| 20 |
Soft Error-Aware Scheduling in High-Level Synthesis (in English)
|
電子情報通信学会技術研究報告, vol.2011-SLDM-149/vol.2011-EMB-20, no.19, pp.1-6
|
2011/03
|
| 21 |
A Restricted Quantum Circuit Class for Designing Large Quantum Circuits
|
The 3rd ERATO-SORST Quantum Computation and Information Workshop
|
2011/03/01
|
| 22 |
ゲート順序を考慮したLNNアーキテクチャへの変換手法
|
第23回量子情報技術研究会資料, QIT2010-65, pp. 125-128
|
2010/11/15
|
| 23 |
Increasing Yield Using Partially-Programmable Circuits
|
Proc. of Conference of Synthesis And System Integration of Mixed Information technologies (SASIMI2010), pp. 237-242 (Best Paper Award)
|
2010/10
|
| 24 |
Towards Robust Circuit Design with Low Overhead
|
Asia South Pacific Design Automation Workshop
|
2010/09/11
|
| 25 |
A SAT Solver Based on Quantum and Classical Random Walks
|
Asian Conference on Quantum Information Science 2010 (AQIS2010)
|
2010/08/29
|
| 26 |
Asymptotics of Quantum Walks on the Line with Phase Parameters
|
Asian Conference on Quantum Information Science 2010 (AQIS2010)
|
2010/08/29
|
| 27 |
Synthesis of Semi-Classical Quantum Circuits
|
Proc. of 2nd Workshop on Reversible Computation, pp. 93-99
|
2010/07/03
|
| 28 |
Fast Equivalence-checking for Quantum Circuits
|
Proc. of NANOARCH '10, pp. 23 - 28
|
2010/06/16
|
| 29 |
少品種高信頼セルを用いた高信頼回路設計手法と信頼性評価手法の提案 (SLDM 研究会 優秀発表学生賞受賞)
|
組込み技術とネットワークに関するワークショップ ETNET2010
|
2010/03
|
| 30 |
Increasing Yield Using Partially-Programmable Circuits
|
電子情報通信学会技術研究報告，vol. 109, no. 315, pp. 125-130 (VLD2009-59)
|
2009/12
|
| 31 |
Discrete Quantum Walks on the Line with Phase Parameters
|
The International Conference on Quantum Information and Technology
|
2009/12/03
|
| 32 |
Quantum Communication Protocols with Public Coins
|
情報処理学会研究報告 2009-AL-126(6), 1-7
|
2009/09/15
|
| 33 |
Adaptive Equivalence-checking for Quantum Circuits
|
Proc. of Reed-Muller Workshop 2009, pp. 97-106
|
2009/05/24
|
| 34 |
An Efficient Method to Convert Arbitrary Quantum Circuits to Ones on a Linear Nearest Neighbor Architecture
|
Proc. of the Third International Conference on Quantum, Nano and Micro Technologiesv (ICQNM 2009), pp. 26-33
|
2009/02/02
|
| 35 |
Average/Worst-Case Gap of Quantum Query Complexities
|
The Twelfth Workshop on Quantum Information Processing (QIP2009)
|
2009/01/14
|
| 36 |
A Functional Unit with Small Variety of Highly Reliable Cells
|
Proc. of 14th Pacific Rim International Symposium on Dependable Computing (PRDC’08), pp. 353-354
|
2008/12
|
| 37 |
Quantum Query Complexity of Boolean Functions with Small On-Sets
|
Proc. of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), pp. 907-918
|
2008/12/17
|
| 38 |
Quantum Query Complexity of Boolean Functions with Small On-Sets
|
第19回量子情報技術研究会
|
2008/11/20
|
| 39 |
An Efficient Method to Convert Arbitrary Quantum Circuits to Ones on a Linear Nearest Neighbor Architecture
|
第19回量子情報技術研究会
|
2008/11/20
|
| 40 |
量子計算の並列シミュレーションにおける通信量削減手法
|
SWoPP2008
|
2008/08/06
|
| 41 |
An Efficient Verification of Quantum Circuits under a Practical Restriction
|
Proc. of IEEE 8th International Conference on Computer and Information Technology (CIT 2008), pp. 873-879
|
2008/07/08
|
| 42 |
Polynomial-Time Construction of Linear Network Coding
|
L. Aceto et al. (Eds.): ICALP 2008, Part I, LNCS 5125, pp. 271-282
|
2008/07/07
|
| 43 |
Multi-Party Quantum Communication Complexity with Routed Messages
|
Proc. of 14th Annual International Computing and Combinatorics Conference (COCOON 2008), LNCS 5092 (2008), pp. 180-190
|
2008/06/27
|
| 44 |
Equivalence-checking for Reversible Circuits
|
IEEE International Workshop on Logic Synthesis (IWLS 2008), pp. 51-58
|
2008/06/04
|
| 45 |
並列量子計算シミュレータにおける通信量削減手法の提案
|
第18回量子情報技術研究会
|
2008/05/22
|
| 46 |
線形ネットワーク符号の構成とその多項式時間アルゴリズム
|
(招待）第21回回路とシステム軽井沢ワークショップ, pp. 665-670
|
2008/04
|
| 47 |
An almost optimal quantum string sealing protocol and its security analysis
|
In Proc. of the First AAAC (Asian Association of Algorithms and Computation) Annual Meeting. AAAC, 2008
|
2008/04/26
|
| 48 |
A quantum secure direct communication protocol for sending a quantum state and its security analy
|
The 2008 Symposium on Cryptography and Information Security (SCIS2008)
|
2008/01/23
|
| 49 |
Quantum Network Coding
|
Proc. of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS 2007), W. Thomas and P. Weil (Eds.), Lecture Notes in Computer Science, Volume 4393, Springer-Verlag, pp. 610-621, 2007.
|
2007
|
| 50 |
Tight Bounds on Information Gains in Quantum Sealing Protocols
|
Workshop on Quantum Information Processing 2007
|
2007
|