scientific article

DOI10.4086/TOC.2015.V011A016zbMATH Open1351.68105arXiv1503.02868OpenAlexW2962825398MaRDI QIDQ3467516FDOQ3467516

Authors: Aleksandrs Belovs, Eric Blais 

Publication date: 2 February 2016

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

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

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

monotonicityBoolean functionsproperty testingquantum query complexity

Mathematics Subject Classification ID

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

Cites Work

• Quantum algorithms for learning symmetric juntas via the adversary bound

Cited In (6)

• Adaptive Lower Bound for Testing Monotonicity on the Line
• Title not available (Why is that?)
• Quantum Algorithms for Testing Properties of Distributions
• Title not available (Why is that?)
• Parameterized property testing of functions
• 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)