Related papers: Better short-seed quantum-proof extractors
The notion of semi-random sources, also known as Santha-Vazirani (SV) sources, stands for a sequence of n bits, where the dependence of the i'th bit on the previous i-1 bits is limited for every $i\in[n]$. If the dependence of the i'th bit…
Lexicographically minimal string rotation is a fundamental problem in string processing that has recently garnered significant attention in quantum computing. Near-optimal quantum algorithms have been proposed for solving this problem,…
We study the power of quantum memory for learning properties of quantum systems and dynamics, which is of great importance in physics and chemistry. Many state-of-the-art learning algorithms require access to an additional external quantum…
Current quantum programming is dominated by low-level, circuit-centric approaches that limit the potential for compiler optimization. This work presents how a high-level programming construct provides compilers with the semantic information…
Coresets are arguably the most popular compression paradigm for center-based clustering objectives such as $k$-means. Given a point set $P$, a coreset $\Omega$ is a small, weighted summary that preserves the cost of all candidate solutions…
Cyclic classical and quantum thermal machines show higher efficiency when the strokes are carried out quasi-statically. Recent theoretical and experimental work on figures of merit for thermal machines show that they have an advantage when…
We study explicit constructions of min-wise hash families and their extension to $k$-min-wise hash families. Informally, a min-wise hash family guarantees that for any fixed subset $X\subseteq[N]$, every element in $X$ has an equal chance…
In quantum learning tasks, quantum memory can offer exponential reductions in statistical complexity compared to any single-copy strategies, but this typically necessitates at least doubling the system size. We show that such exponential…
We show that the noise threshold for optical quantum computing can be significantly improved by using the EPR-type of photon source. In this implementation, the detector efficiency $\eta_{d}$ is required to be larger than 50%, and the…
Quantum simulation is a promising way toward practical quantum advantage, but noise in current quantum hardware poses a significant obstacle. We prove that not only the physical error but also the algorithmic error in a single Trotter step…
This thesis initiates the study of cryptographic protocols in the bounded-quantum-storage model. On the practical side, simple protocols for Rabin Oblivious Transfer, 1-2 Oblivious Transfer and Bit Commitment are presented. No quantum…
In a work by Raz (J. ACM and FOCS 16), it was proved that any algorithm for parity learning on $n$ bits requires either $\Omega(n^2)$ bits of classical memory or an exponential number (in~$n$) of random samples. A line of recent works…
We consider a version of the nearest-codeword problem on finite fields $\mathbb{F}_q$ using the Manhattan distance, an analog of the Hamming metric for non-binary alphabets. Similarly to other lattice related problems, this problem is…
Random numbers have significant applications in fundamental science, high-level scientific research, cryptography, and several other areas where there is a pressing need for high-quality random numbers. We present an experimental…
Higher-order quantum theory deals with causal quantum processes, described by quantum combs, and test procedures, described by quantum testers, "measuring" these processes. In this work, we show that "jointly non-implementable" or…
In this paper, the problem of constructing an efficient quantum circuit for the implementation of an arbitrary quantum computation is addressed. To this end, a basic block based on the cosine-sine decomposition method is suggested which…
Quantum computers require precise control over parameters and careful engineering of the underlying physical system. In contrast, neural networks have evolved to tolerate imprecision and inhomogeneity. Here, using a reservoir computing…
For a real number $r>0$, let $F(r)$ be the family of all stationary ergodic quantum sources with von Neumann entropy rates less than $r$. We prove that, for any $r>0$, there exists a blind, source-independent block compression scheme which…
Implementing a quantum circuit on specific hardware with a reduced available gate set is often associated with a substantial increase in the length of the equivalent circuit. This process is also known as transpilation and due to…
Entropically secure encryption is a way to encrypt a large plaintext with a small key and still have information-theoretic security, thus in a certain sense circumventing Shannon's result that perfect encryption requires the key to be at…