Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

数理解析研究所講究録

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

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

Published May 1, 2006• 0 citations
OpenAlex

Related papers

Note on information transmission in quantum systems (非加法の数理と情報:函数解析の観点から RIMS研究集会報告集)

昇 渡邉

数理解析研究所講究録•Jun 1, 2007•0 citations

Efficient quantum state transmission via perfect quantum network coding

Zhenzhen Li, Gang Xu, Xiu‐Bo Chen +3 more

Science China Information Sciences•Nov 22, 2018•21 citations

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

Akinori Kawachi, Shigeru Yamashita

We geometrically characterize the query complexity of the oracle identification prob- lem in this paper.By defining an inner product between two oracles, we construct a quantum algo- rithm, which generalizes Bemstein-Vazirani and Grover algorithms, for a certain class of the oracle identification problem characterized by the inner product.We also show the optimality of this quantum algorithm.

数理解析研究所講究録•May 1, 2006•0 citations

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

Tomoya Suzuki, Shigeru Yamashita, Masaki Nakanishi +1 more

We investigate the query complexity of quantum biased oracles.$\mathrm{S}\mathrm{u}\mathrm{p}\mathrm{p}\mathrm{o}\mathrm{s}\epsilon$ that the biased oracles answer queries correctly with probability at least $1/2+\epsilon$ .Given such an oracle, we present an algorithm to simulate a single query to an oracle that answers queries $\mathrm{C}\mathrm{O}\alpha \mathrm{e}\mathrm{c}\mathrm{u}_{\mathrm{y}}$ with probability at least 2/3, using $0(1/\epsilon)$ queries to the given oracle.For searching problems, combining the algorithm with a known result.we can obtain an optimal algorithm.The simulating algorithm works effectively when we know the value of $\epsilon$ .We also consider the situation where no knowledge about $\epsilon$ is given.

数理解析研究所講究録•May 1, 2006•0 citations

Transmitting classical information on the quantum network efficiently

一雄 岩間, 治道 西村, ルディ レイモンド +1 more

電子情報通信学会技術研究報告. COMP, コンピュテーション•Dec 15, 2005•0 citations

Retrieving and routing quantum information in a quantum network

Sk Sazim, V. Chiranjeevi, Indranil Chakrabarty +1 more

arXiv:1311.5378•Quantum Information Processing•Sep 14, 2015•30 citations
We investigate the query complexity of quantum biased oracles.Supposϵ\mathrm{S}\mathrm{u}\mathrm{p}\mathrm{p}\mathrm{o}\mathrm{s}\epsilonSupposϵ that the biased oracles answer queries correctly with probability at least 1/2+ϵ1/2+\epsilon1/2+ϵ .Given such an oracle, we present an algorithm to simulate a single query to an oracle that answers queries COαecuy\mathrm{C}\mathrm{O}\alpha \mathrm{e}\mathrm{c}\mathrm{u}_{\mathrm{y}}COαecuy​ with probability at least 2/3, using 0(1/ϵ)0(1/\epsilon)0(1/ϵ) queries to the given oracle.For searching problems, combining the algorithm with a known result.we can obtain an optimal algorithm.The simulating algorithm works effectively when we know the value of ϵ\epsilonϵ .We also consider the situation where no knowledge about ϵ\epsilonϵ is given.