Aleksandrs Belovs

From MaRDI portal
Revision as of 13:45, 28 January 2024 by Import240128110107 (talk | contribs) (Created automatically from import240128110107)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:488053

Available identifiers

zbMath Open belovs.aleksandrsMaRDI QIDQ488053

List of research outcomes





PublicationDate of PublicationType
An exponential separation between quantum query complexity and the polynomial degree2024-11-19Paper
Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems2023-04-26Paper
https://portal.mardi4nfdi.de/entity/Q58743952023-02-07Paper
Quantum Algorithms for Classical Probability Distributions2022-05-11Paper
Adaptive Lower Bound for Testing Monotonicity on the Line2021-08-04Paper
A Polynomial Lower Bound for Testing Monotonicity2021-06-22Paper
Testing convexity of functions over finite domains2021-02-02Paper
https://portal.mardi4nfdi.de/entity/Q51111612020-05-26Paper
Quantum algorithm for distribution-free junta testing2019-10-22Paper
Quantum dual adversary for hidden subgroups and beyond2019-10-10Paper
Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing2018-07-16Paper
Separations in Query Complexity Based on Pointer Functions2018-05-17Paper
https://portal.mardi4nfdi.de/entity/Q46379772018-05-03Paper
On a Conjecture by Christian Choffrut2018-02-22Paper
Separations in Query Complexity Based on Pointer Functions2017-09-29Paper
A polynomial lower bound for testing monotonicity2017-09-29Paper
Adversary lower bound for the k-sum problem2017-05-16Paper
Looking for Pairs that Hard to Separate: A Quantum Approach2016-11-09Paper
https://portal.mardi4nfdi.de/entity/Q34675162016-02-02Paper
Quantum algorithms for learning symmetric juntas via the adversary bound2015-06-23Paper
On the power of non-adaptive learning graphs2015-01-23Paper
Span programs for functions with constant-sized 1-certificates2014-05-13Paper
Time-Efficient Quantum Walks for 3-Distinctness2013-08-06Paper
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection2012-09-25Paper
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases2009-01-22Paper
Some Algebraic Properties of Machine Poset of Infinite Words2008-09-25Paper
The completely distributive lattice of machine invariant sets of infnite words2008-02-22Paper
Multi-letter Reversible and Quantum Finite Automata2007-11-28Paper
SOFSEM 2006: Theory and Practice of Computer Science2006-11-14Paper

Research outcomes over time

This page was built for person: Aleksandrs Belovs