Related papers: A Quantum Algorithm for Testing Junta Variables an…
Quantum entanglement plays a crucial role in quantum computing. Entangling information has important implications for understanding the behavior of quantum programs and avoiding entanglement-induced errors. Entanglement analysis is a static…
We study the problem of reinforcement learning for a task encoded by a reward machine. The task is defined over a set of properties in the environment, called atomic propositions, and represented by Boolean variables. One unrealistic…
The quantum entanglements are studied in terms of the invariants under local unitary transformations. A generalized formula of concurrence for $N$-dimensional quantum systems is presented. This generalized concurrence has potential…
We study experimentally accessible lower bounds on entanglement measures based on entropic uncertainty relations. Experimentally quantifying entanglement is highly desired for applications of quantum simulation experiments to fundamental…
We study the pairwise entanglement present in a quantum computer that simulates a dynamically localized system. We show that the concurrence is exponentially sensitive to changes in the Hamiltonian of the simulated system. Moreover,…
Multipartite entanglement detection is crucial for the develop of quantum information science and quantum computation, communication, simulation and metrology tasks. In contrast to experiments, where several handreds of qubits have been…
Probably the simplest and most frequently used way to illustrate the power of quantum computing is to solve the so-called {\it Deutsch's problem}. Consider a Boolean function $f: \{0,1\} \to \{0,1\}$ and suppose that we have a (classical)…
The main conceptual contribution of this paper is identifying a previously unnoticed connection between two central problems in computational learning theory and property testing: agnostically learning conjunctions and tolerantly testing…
We present an $\tilde{O}(n^{2/3}/\epsilon^2)$-query algorithm that tests whether an unknown Boolean function $f\colon\{0,1\}^n\rightarrow \{0,1\}$ is unate (i.e., every variable is either non-decreasing or non-increasing) or $\epsilon$-far…
The problem of quantum state filtering consists of determining whether an unknown quantum state, which is chosen from a known set of states, is either a particular, specified state, or not. We consider this problem for the case that the…
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact,…
The hidden shift problem is a natural place to look for new separations between classical and quantum models of computation. One advantage of this problem is its flexibility, since it can be defined for a whole range of functions and a…
We prove a $k^{-\Omega(\log(\varepsilon_2 - \varepsilon_1))}$ lower bound for adaptively testing whether a Boolean function is $\varepsilon_1$-close to or $\varepsilon_2$-far from $k$-juntas. Our results provide the first superpolynomial…
Quantum entanglement is one of the core features of quantum theory. While it is typically revealed by measurements along carefully chosen directions, here we review different methods based on so-called random or randomized measurements.…
We consider the problems of testing and learning quantum $k$-junta channels, which are $n$-qubit to $n$-qubit quantum channels acting non-trivially on at most $k$ out of $n$ qubits and leaving the rest of qubits unchanged. We show the…
We study the relative-error property testing model for Boolean functions that was recently introduced in the work of Chen et al. (SODA 2025). In relative-error testing, the testing algorithm gets uniform random satisfying assignments as…
The problem of optimally estimating an unknown unitary quantum operation with the aid of entanglement is addressed. The idea is to prepare an entangled pair, apply the unknown unitary to one of the two parts and then measure the joint…
We present a novel approach to quantum algorithms, by taking advantage of modular values, i.e., complex and unbounded quantities resulting from specific post-selected measurement scenarios. Our focus is on the problem of ascertaining…
Certifying whether an arbitrary quantum system is entangled or not, is, in general, an NP-hard problem. Though various necessary and sufficient conditions have already been explored in this regard for lower dimensional systems, it is hard…
Quantum entanglement is a crucial resource in quantum information processing, advancing quantum technologies. The greater the uncertainty in subsystems' pure states, the stronger the quantum entanglement between them. From the dual form of…