Aleksandrs Belovs

发表

Workshop on Quantum and Classical Complexity Workshop on Quantum and Classical Complexity Organizers Program Commitee External Reviewers Tutorial Algebraic Algorithms: Ranks, Determinants and Derivatives Quantum Complexity of Matrix Multiplication Parameterized Quantum Query Complexity of Graph Coll

H. Nishimura, Marek Cygan, H. Kobayashi, 2022 .

Quantum Algorithm for k-distinctness with Prior Knowledge on the Input

Aleksandrs Belovs, Troy Lee, Troy Lee, 2011, 1108.3022.

Welch Bounds and Quantum State Tomography by Aleksandrs Belovs

J. Rosado, Aleksandrs Belovs, 2008 .

On the Power of Non-adaptive Learning Graphs

Ansis Rosmanis, Aleksandrs Belovs, Aleksandrs Belovs, 2012, 2013 IEEE Conference on Computational Complexity.

XX : 2 Provably secure key establishment against quantum adversaries

G. Brassard, P. Høyer, Sophie Laplante, 2018 .

C C ] 7 A ug 2 01 9 Testing convexity of functions over finite domains

Eric Blais, Aleksandrs Belovs, Abhinav Bommireddi, 2019 .

The completely distributive lattice of machine invariant sets of infinite words

Aleksandrs Belovs, J. Buls, 2007 .

Some Algebraic Properties of Machine Poset of Infinite Words

Aleksandrs Belovs, Aleksandrs Belovs, 2008, RAIRO Theor. Informatics Appl..

Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing pdf

Andris Ambainis, Ronald de Wolf, Oded Regev, 2015, SODA.

Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound

Aleksandrs Belovs, Aleksandrs Belovs, 2013, 2014 IEEE 29th Conference on Computational Complexity (CCC).

Non-intersecting Complexity

Aleksandrs Belovs, Aleksandrs Belovs, 2006, SOFSEM.

Welch Bounds and Quantum State Tomography

Aleksandrs Belovs, Aleksandrs Belovs, 2008 .

A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases

Aleksandrs Belovs, Juris Smotrovs, Juris Smotrovs, 2008, MMICS.

On a Conjecture by Christian Choffrut

Abuzer Yakaryilmaz, Aleksandrs Belovs, J. Andrés Montoya, 2017, Int. J. Found. Comput. Sci..

Applications of Adversary Method in Quantum Query Algorithms

Aleksandrs Belovs, Aleksandrs Belovs, 2014, 1402.3858.

A Direct Reduction from the Polynomial to the Adversary Method

Aleksandrs Belovs, 2023, 2301.10317.

An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree

A. Ambainis, Aleksandrs Belovs, 2023, CCC.

Learning-Graph-Based Quantum Algorithm for k-Distinctness

Aleksandrs Belovs, Aleksandrs Belovs, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Quantum lower bound for inverting a permutation with advice pdf

Aran Nayebi, Luca Trevisan, Scott Aaronson, 2014, Quantum Inf. Comput..

Time-Efficient Quantum Walks for 3-Distinctness

Stacey Jeffery, Frédéric Magniez, Andrew M. Childs, 2013, ICALP.

Can one quantum bit separate any pair of words with zero-error? pdf

Abuzer Yakaryilmaz, Aleksandrs Belovs, J. Andrés Montoya, 2016, ArXiv.

One-Way Ticket to Las Vegas and the Quantum Adversary

Aleksandrs Belovs, Duyal Yolcu, 2023, 2301.02003.

Tight Quantum Lower Bound for Approximate Counting with Quantum States

Ansis Rosmanis, Aleksandrs Belovs, Aleksandrs Belovs, 2020, 2002.06879.

Quantum Algorithms for Classical Probability Distributions

Aleksandrs Belovs, Aleksandrs Belovs, 2019, ESA.

Quantum Dual Adversary for Hidden Subgroups and Beyond

Aleksandrs Belovs, Aleksandrs Belovs, 2019, UCNC.

Looking for Pairs that Hard to Separate: A Quantum Approach

Abuzer Yakaryilmaz, Aleksandrs Belovs, J. Andrés Montoya, 2016, CIAA.

Provably Secure Key Establishment Against Quantum Adversaries

Gilles Brassard, Louis Salvail, Sophie Laplante, 2017, TQC.

Separations in query complexity based on pointer functions

Andris Ambainis, Troy Lee, Miklos Santha, 2015, STOC.

Adversary lower bound for the k-sum problem pdf

Aleksandrs Belovs, Robert Spalek, R. Spalek, 2012, ITCS '13.

Separations in Communication Complexity Using Cheat Sheets and Information Complexity

Troy Lee, Miklos Santha, Mika Göös, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

Quantum Walks and Electric Networks

Aleksandrs Belovs, Aleksandrs Belovs, 2013, 1302.3143.

Span programs for functions with constant-sized 1-certificates: extended abstract

Aleksandrs Belovs, Aleksandrs Belovs, 2011, STOC '12.

Adversary lower bounds for the collision and the set equality problems

Ansis Rosmanis, Aleksandrs Belovs, Aleksandrs Belovs, 2013, Quantum Inf. Comput..

On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz

M. Santha, G. Ivanyos, Aleksandrs Belovs, 2017, CCC.

Multi-letter Reversible and Quantum Finite Automata

Ansis Rosmanis, Aleksandrs Belovs, Juris Smotrovs, 2007, Developments in Language Theory.

Span-program-based quantum algorithm for the rank problem pdf

Aleksandrs Belovs, Aleksandrs Belovs, 2011, ArXiv.