scientific article

DOI10.4230/LIPICS.TQC.2013.50zbMATH Open1356.68074arXiv1304.4642MaRDI QIDQ2958409FDOQ2958409

Authors: Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler 

Publication date: 1 February 2017

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

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

Recommendations

• A Wide Class of Boolean Functions Generalizing the Hidden Weight Bit Function
• On a hierarchy of Boolean functions hard to compute in constant depth
• Boolean functional synthesis: hardness and practical algorithms
• scientific article; zbMATH DE number 1346056
• On the multiplicative complexity of some Boolean functions
• On the multiplicative complexity of Boolean functions
• On the modulo degree complexity of Boolean functions
• On the modulo degree complexity of Boolean functions
• On the complexity of Boolean functions with small number of ones
• Sufficient conditions for deceptive and easy binary functions

zbMATH Keywords

Fourier transformquery complexityquantum algorithmsbent functionsBoolean hidden shift problem

Mathematics Subject Classification ID

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

Cited In (5)

• Quantum algorithms for learning symmetric juntas via the adversary bound
• Tangible reduction in learning sample complexity with large classical samples and small quantum system
• Quasi-random multilinear polynomials
• Quantum pattern matching fast on average
• Quantum rejection sampling

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 Q2958409)