数理解析研究所講究録

Upper bounds for quantum biased oracles with explicit bias rate (計算理論とアルゴリズムの新展開 RIMS研究集会報告集)

智哉鈴木, 茂山下, 正樹中西

Published May 1, 2006• 0 citations

Related papers

Query complexity of quantum biased oracles with explicit bias rate

Tomoya Suzuki

Geometric Characterization of Quantum Oracle Identification (計算理論とアルゴリズムの新展開 RIMS研究集会報告集)

亮周河内, 茂山下

Efficient Transmission of Information on the Quantum Network (計算理論とアルゴリズムの新展開 RIMS研究集会報告集)

正人林, 一雄岩間, 治道西村

Upper bound on our knowledge about noncommuting observables for a qubit system (非可換解析とミクロ・マクロ双対性--RIMS研究集会報告集)

貴大沙川, 雄司黒谷, 正仁上田

Quantum Biased Oracles

亮周河内, Akinori Kawachi

Query Complexity of Quantum Biased Oracles

Kazuo Iwama, Rudy Raymond, Shigeru Yamashita