Related papers: Short seed extractors against quantum storage
We study deterministic extractors for oblivious bit-fixing sources (a.k.a. resilient functions) and exposure-resilient functions with small min-entropy: of the function's n input bits, k << n bits are uniformly random and unknown to the…
We demonstrate the storage of $5$ ns light pulses in a single rubidium atom coupled to a fiber-based optical resonator. Our storage protocol addresses a regime beyond the conventional adiabatic limit and approaches the theoretical bandwidth…
Quantum machine learning represents a promising avenue for data processing, also for purposes of sequential temporal data analysis, as recently proposed in quantum reservoir computing (QRC). The possibility to operate on several platforms…
The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will…
Distinguishing logarithmic depth quantum circuits on mixed states is shown to be complete for QIP, the class of problems having quantum interactive proof systems. Circuits in this model can represent arbitrary quantum processes, and thus…
We study the problem of characterizing linear preserver subgroups of algebraic varieties, with a particular emphasis on secant varieties and other varieties of tensors. We introduce a number of techniques built on different geometric…
In the classical RAM, we have the following useful property. If we have an algorithm that uses $M$ memory cells throughout its execution, and in addition is sparse, in the sense that, at any point in time, only $m$ out of $M$ cells will be…
We study the problem of constructing multi-source extractors in the quantum setting, which extract almost uniform random bits against quantum side information collected from several initially independent classical random sources. This is a…
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…
Generative adversarial networks are an emerging technique with wide applications in machine learning, which have achieved dramatic success in a number of challenging tasks including image and video generation. When equipped with quantum…
Complex absorbing potentials are frequently imposed when simulating unbound quantum systems. While this is usually done solely in order to avoid artifacts at the numerical boundary, we show how absorbers may also be used to probe the…
Quantum annealers (QA), such as D-Wave systems, become increasingly efficient and competitive at solving combinatorial optimization problems. However, solving problems that do not directly map the chip topology remains challenging for this…
In this paper, we theoretically and experimentally analyze sequential processors with limited communication between parts. We compare the expressivity of sequential quantum and classical processors under the same constraints. They consist…
We solve the satisfiability problem for a three-sorted fragment of set theory (denoted $3LQST_0^R$), which admits a restricted form of quantification over individual and set variables and the finite enumeration operator $\{\text{-},…
Quantum versions of control problems are often more difficult than their classical counterparts because of the additional constraints imposed by quantum dynamics. For example, the quantum LQG and quantum H infinity optimal control problems…
Cavity assisted quantum memory storage has been proposed [PRA 82, 022310 (2010), PRA 82, 022311 (2010)] for creating efficient (close to unity) quantum memories using weakly absorbing materials. Using this approach we experimentally…
We study the problem of extracting random bits from weak sources that are sampled by algorithms with limited memory. This model of small-space sources was introduced by Kamp, Rao, Vadhan and Zuckerman (STOC'06), and falls into a line of…
Residuation theory concerns the study of partially ordered algebraic structures, most often monoids, equipped with a weak inverse for the monoidal operator. One of its area of application has been constraint programming, whose key…
Projective measurements with high quantum efficiency is often assumed to be required for efficient circuit based quantum computing. We argue that this is not the case and show that this fact has actually be known previously though not…
Adversarial learning represents a powerful technique for generating data statistics. Its successful implementation in quantum computational platforms is not straightforward due to limitations in connectivity, quantum operation fidelity, and…