Robust Quantum Algorithms with ε-Biased Oracles

DOI10.1007/11809678_14MaRDI QIDQ3591325zbMATH OpenOpenAlexFDO

Authors Tomoya Suzuki, S. Yamasita, Masaki Nakanishi, Katsumasa Watanabe

Publication date 10 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11809678_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Recommendations

• Query complexity of quantum biased oracles
• STACS 2005
• Robust polynomials and quantum algorithms
• An optimal quantum algorithm for the oracle identification problem
• Robustness and device independence of verifiable blind quantum computing
• scientific article; zbMATH DE number 5320378
• Abstract structure of unitary oracles for quantum algorithms
• Gaussian quantum computation with oracle-decision problems
• Quantum algorithms for the resiliency of vectorial Boolean functions

Cited in

(2)

• Query complexity of quantum biased oracles
• scientific article; zbMATH DE number 5320378 (Why is no real title available?)

This page was built for publication: Robust Quantum Algorithms with ε-Biased Oracles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591325)