scientific article; zbMATH DE number 6538684

DOI10.4086/TOC.2015.V011A016MaRDI QIDQ3467516zbMATH OpenOpenAlexFDO

Authors Aleksandrs Belovs, Eric Blais

Publication date 2 February 2016

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1503.02868

zbMATH Keywords

monotonicityBoolean functionsproperty testingquantum query complexity

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Monodromic quantum computing
• Quantum search algorithms on the hypercube
• MONODROMY APPROACH TO QUANTUM COMPUTING
• Quantum algorithms for testing properties of distributions
• Quantum Algorithms for Testing Properties of Distributions
• Quantum algorithm for distribution-free junta testing
• Monotonicity of the quantum linear programming bound
• scientific article; zbMATH DE number 2140634
• Hypercube quantum search: exact computation of the probability of success in polynomial time
• Quantum algorithms for learning and testing juntas

Cites work

• Quantum algorithms for learning symmetric juntas via the adversary bound

Cited in

(7)

• Optimal unateness testers for real-valued functions: adaptivity helps
• Quantum algorithm for distribution-free junta testing
• scientific article; zbMATH DE number 2140634 (Why is no real title available?)
• Quantum Algorithms for Testing Properties of Distributions
• Parameterized property testing of functions
• Adaptive lower bound for testing monotonicity on the line
• A polynomial lower bound for testing monotonicity

This page was built for publication:

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