Parallelization of Quantum Circuits with Ancillae (<Special Issue>Special Issue on Selected Papers from LA Symposium)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, parallelization mothods for quantum circuits arc studied, where parallelization of quantum circuits means to reconstruct a given quantum circuit to one which realizes the same quantum computation with a smaller depth, and it is based on using additional bits, called ancillae, each of which is initialized to be in a certain state. We propose parallelization methods in terms of the number of available ancillae, for three types of quantum circuits. The proposed parallelization methods are more general than previous one in the sense that the methods are applicable when the number of available ancillae is fixed arbitrarily. As consequences, for the three types of n-bit quantum circuits, we show new upper bounds of the number of ancillae for parallelizing to logarithmic depth, which are 1/log n of previous upper bounds.
- 社団法人電子情報通信学会の論文
- 2003-02-01
著者
-
Abe Hideaki
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Sung S
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Sung Shao
School Of Information Sc
-
Abe Hideaki
School Of Information Science Japan Advanced Institute Of Science And Te
関連論文
- Coterie for Generalized Mutual Exclusion Problem
- Multiple-choice project scheduling
- A procedure for competitive fair division
- Competitive Envy-Free Division
- Scheduling with Fuzzy Delays and Fuzzy Precedences (第16回ファジィシステムシンポジウム--ファジィとノン・ファジィの統合)
- Parallelization of Quantum Circuits with Ancillae (Special Issue on Selected Papers from LA Symposium)
- Parallelizing with limited number of ancillae
- JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS
- Providing a framework for conflict resolution