Aleksandrs Belovs

Available identifiers

zbMath Open belovs.aleksandrsMaRDI QIDQ488053

List of research outcomes

Publication	Date of Publication	Type
An exponential separation between quantum query complexity and the polynomial degree	2024-11-19	Paper
Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems	2023-04-26	Paper
https://portal.mardi4nfdi.de/entity/Q5874395	2023-02-07	Paper
Quantum Algorithms for Classical Probability Distributions	2022-05-11	Paper
Adaptive lower bound for testing monotonicity on the line	2021-08-04	Paper
A polynomial lower bound for testing monotonicity	2021-06-22	Paper
Testing convexity of functions over finite domains	2021-02-02	Paper
On the polynomial parity argument complexity of the combinatorial Nullstellensatz	2020-05-26	Paper
Quantum algorithm for distribution-free junta testing	2019-10-22	Paper
Quantum dual adversary for hidden subgroups and beyond	2019-10-10	Paper
Efficient quantum algorithms for (gapped) group testing and junta testing	2018-07-16	Paper
Separations in query complexity based on pointer functions	2018-05-17	Paper
Provably secure key establishment against quantum adversaries	2018-05-03	Paper
On a conjecture by Christian Choffrut	2018-02-22	Paper
A polynomial lower bound for testing monotonicity	2017-09-29	Paper
Separations in query complexity based on pointer functions	2017-09-29	Paper
Adversary lower bound for the \(k\)-sum problem	2017-05-16	Paper
Looking for Pairs that Hard to Separate: A Quantum Approach	2016-11-09	Paper
https://portal.mardi4nfdi.de/entity/Q3467516	2016-02-02	Paper
Quantum algorithms for learning symmetric juntas via the adversary bound	2015-06-23	Paper
On the power of non-adaptive learning graphs	2015-01-23	Paper
Span programs for functions with constant-sized 1-certificates (extended abstract)	2014-05-13	Paper
Time-efficient quantum walks for 3-distinctness	2013-08-06	Paper
Span programs and quantum algorithms for \(st\)-connectivity and claw detection	2012-09-25	Paper
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases	2009-01-22	Paper
Some Algebraic Properties of Machine Poset of Infinite Words	2008-09-25	Paper
The completely distributive lattice of machine invariant sets of infnite words	2008-02-22	Paper
Multi-letter Reversible and Quantum Finite Automata	2007-11-28	Paper
SOFSEM 2006: Theory and Practice of Computer Science	2006-11-14	Paper

Research outcomes over time

This page was built for person: Aleksandrs Belovs