量子コンピュータの電気回路による実現
スポンサーリンク
概要
- 論文の詳細を見る
One of most important features in quantum computation might be said to be the linearity of state transitions. This feature strongly suggests a possibility such that linear circuits may give a new computational machinery with natural parallelism. The present article describes such a possibility. After noting that linear circuits with two-terminals may realize a linear mapping represented by a diagonal matrix, we show how to build both of one bit unitary operation and Controlled-NOT. Based on these facts it will be proved that the computation ability of linear circuits is not less than that of Turing machines and the number of computational steps of linear circuits is equal to or less than the one of quantum computation. Based on these facts, the NP complete problem such as TSP is shown to be solved within the polynomial time in the sense of linear circuits.
- 山梨英和大学の論文
山梨英和大学 | 論文
- 学校臨床場面における心理査定活用についての一考察--面接導入への有効性の観点から
- 日本語聖書翻訳史序章
- 聖書解釈の方法論の問題について(1) : R・ブルトマンをめぐって
- 情報文化ビジネスのオフィス・スタディ : インテリジェンス・ワークの共通実務を考える
- 編集責任と事実確認 : 情報・通信メディアの規制とルール(3)(第2部)