Average/Worst-Case Gap of Quantum Query Complexities

スポンサーリンク

概要

• 論文の詳細を見る
• 2009-05-11

著者

• Raymond Rudy

  Tokyo Research Laboratory Ibm Japan

• AMBAINIS ANDRIS

  Institute of Mathematics and Computer Science, University of Latvia

• IWAMA KAZUO

  School of Informatics, Kyoto University

• NAKANISHI MASAKI

  Graduate School of Information Science, NAIST

• NISHIMURA HARUMICHI

  School of Science, Osaka Prefecture University

• TANI SEIICHIRO

  NTT Communication Science Laboratories, NTT Corporation

• YAMASHITA SHIGERU

  College of Information Science and Engineering, Ritsumeikan University

関連論文

• Average/Worst-Case Gap of Quantum Query Complexities
• Quantum Random Access Coding
• Recent Developments in Mesh Routing Algorithms(Special Issue on Algorithm Engineering : Surveys)
• Bit Length Optimization of Fractional Part on Floating to Fixed Point Conversion for High-Level Synthesis(Logic and High Synthesis)(VLSI Design and CAD Algorithms)
• Robust Quantum Algorithms Computing OR with ε-Biased Oracles(Quantum Computing,Foundations of Computer Science)
• The Axis-bound CNN Problem(Algorithms and Data Structures)
• DS-1-2 Packing Squares with Profits into a Rectangle
• Approximated Vertex Cover for Graphs with Perfect Matchings(Invited Papers from New Horizons in Computing)
• Bit-Length Optimization Method for High-Level Synthesis Based on Non-linear Programming Technique(System Level Design,VLSI Design and CAD Algorithms)
• DS-1-11 Reconstructing Strings from Substrings with Quantum Query
• Multi-Party Quantum Communication Complexity with Routed Messages
• Reconstructing Strings from Substrings with Quantum Queries

もっと見る 閉じる

スポンサーリンク