Related papers: A Tight Lower Bound for Non-coherent Index Erasure
Stencil computations on low dimensional grids are kernels of many scientific applications including finite difference methods used to solve partial differential equations. On typical modern computer architectures, such stencil computations…
Ill-posed linear inverse problems appear frequently in various signal processing applications. It can be very useful to have theoretical characterizations that quantify the level of ill-posedness for a given inverse problem and the degree…
Quantum computing faces a key challenge: balancing the need for low circuit depth (crucial for fault tolerance) with the high accuracy required for complex computations like quantum chemistry and error correction, which typically require…
Artificial agents can achieve strong task performance while remaining opaque with respect to internal regulation, uncertainty management, and stability under stochastic perturbation. We present IRAM-Omega-Q, a computational architecture…
Quantum annealing is a heuristic algorithm for searching the ground state of an Ising model. Heuristic algorithms aim to obtain near-optimal solutions with a reasonable computation time. Accordingly, many algorithms have so far been…
We show how an algorithm for the problem of inverting a permutation may be used to design one for the problem of unordered search (with a unique solution). Since there is a straightforward reduction in the reverse direction, the problems…
We analyze decoherence of a quantum register in the absence of non-local operations i.e. of $n$ non-interacting qubits coupled to an environment. The problem is solved in terms of a sum rule which implies linear scaling in the number of…
With the aid of a quantum memory, the uncertainty about the measurement outcomes of two incompatible observables of a quantum system can be reduced. We investigate this measurement uncertainty bound by considering an additional quantum…
A known aspect of the Clausius inequality is that an equilibrium system subjected to a squeezing $\d S$ of its entropy must release at least an amount $|\dbarrm Q|=T|\d S|$ of heat. This serves as a basis for the Landauer principle, which…
Two widely-used computational paradigms for sublinear algorithms are using linear measurements to perform computations on a high dimensional input and using structured queries to access a massive input. Typically, algorithms in the former…
The problem of distinguishing between a random function and a random permutation on a domain of size $N$ is important in theoretical cryptography, where the security of many primitives depend on the problem's hardness. We study the quantum…
Estimation of unknown qubit elementary gates and alignment of reference frames are formally the same problem. Using quantum states made out of $N$ qubits, we show that the theoretical precision limit for both problems, which behaves as…
In this paper we study lower bounds for the fundamental problem of text indexing with mismatches and differences. In this problem we are given a long string of length $n$, the "text", and the task is to preprocess it into a data structure…
Landauer's principle states that information erasure requires heat dissipation. Landauer's original result focused on equilibrium memories. We here investigate the reset of information stored in a nonequilibrium state of a symmetric…
Quantum coherence control is presented for wavelength convertible quantum memory in a double-lambda-type solid ensemble whose spin states are inhomogeneously broadened. Unlike typical atomic media whose spin decay is homogeneous, a spin…
Quantum computers can perform certain operations exponentially faster than classical computers, but designing quantum circuits is challenging. To that end, researchers used evolutionary algorithms to produce probabilistic quantum circuits…
In the field of compressed sensing, a key problem remains open: to explicitly construct matrices with the restricted isometry property (RIP) whose performance rivals those generated using random matrix theory. In short, RIP involves…
Coherent superpositions are one of the hallmarks of quantum mechanics and are vital for any quantum mechanical device to outperform the classically achievable. Generically, superpositions are verified in interference experiments, but…
Generating entanglement deterministically at a capacity-approaching rate is critical for next-generation quantum networks. We propose weak-coherent-state-assisted protocols that can generate entanglement near-deterministically between…
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is sufficiently small, e.g., polylogarithmic in the size of…