Improved algorithms for quantum identification of Boolean oracles

DOI10.1016/J.TCS.2006.12.013zbMATH Open1118.68065OpenAlexW2082507052MaRDI QIDQ884445FDOQ884445

Authors: Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, S. Yamasita 

Publication date: 6 June 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.013

Recommendations

• Improved Algorithms for Quantum Identification of Boolean Oracles
• STACS 2004
• Quantum identification of Boolean oracles
• An optimal quantum algorithm for the oracle identification problem
• Boolean functions identification via quantum computing methods

zbMATH Keywords

query complexityquantum computingalgorithmic learning theory

Mathematics Subject Classification ID

Computational learning theory (68Q32) Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cites Work

• The quantum query complexity of approximating the median and related statistics
• Title not available (Why is that?)
• Quantum search of spatial regions
• Property testing and its connection to learning and approximation
• Computing with Noisy Information
• Quantum Complexity Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata, Languages and Programming
• Title not available (Why is that?)
• STACS 2004
• Title not available (Why is that?)
• Title not available (Why is that?)
• The geometry of quantum learning
• Title not available (Why is that?)
• Quantum algorithms for the triangle problem
• Quantum Algorithms for Element Distinctness
• Improved bounds on quantum learning algorithms
• Sublinear geometric algorithms
• STACS 2005

Cited In (10)

• Identifying Generalized Reed-Muller Codewords by Quantum Queries
• Query complexity of quantum biased oracles
• Recovering strings in oracles: quantum and classic
• RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC
• Quantum identification of Boolean oracles
• Quantum query complexity of almost all functions with fixed on-set size
• STACS 2004
• Learning bounds for quantum circuits in the agnostic setting
• Improved Algorithms for Quantum Identification of Boolean Oracles
• Exact quantum search by parallel unitary discrimination schemes

This page was built for publication: Improved algorithms for quantum identification of Boolean oracles

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