The range avoidance problem (denoted by Avoid) asks to find a string outside of the range
of a given circuit C:{0, 1} n→{0, 1} m, where m> n. Although at least half of the strings of …

Quantum computational advantage refers to an existence of computational tasks that are
easy for quantum computing but hard for classical one. Unconditionally showing quantum …

The level-k 1-Fourier weight of a Boolean function refers to the sum of absolute values of its
level-k Fourier coefficients. Fourier growth refers to the growth of these weights as k grows. It …

In recent works, much progress has been made with regards to so-called randomized
measurement strategies, which include the famous methods of classical shadows and …

We study the one-clean-qubit model of quantum communication where one qubit is in a pure
state and all other qubits are maximally mixed. We demonstrate a partial function that has a …

We exhibit a total search problem whose communication complexity in the quantum SMP
(simultaneous message passing) model is exponentially smaller than in the classical two …

Yes, we show that they are. We initiate the study of languages that necessarily need
uncloneable quantum proofs and advice. We define strictly uncloneable versions of the …

We show a relation, based on parallel repetition of the Magic Square game, that can be
solved, with probability exponentially close to $1 $(worst-case input), by $1 D $(uniform) …

What is the power of polynomial-time quantum computation with access to an NP oracle? In
this work, we focus on two fundamental tasks from the study of Boolean satisfiability (SAT) …

Advice classes in computational complexity have frequently been used to model real-world
scenarios encountered in cryptography, quantum computing and machine learning, where …