Related papers: Quantum One-Time Memories from Stateless Hardware,…
We propose a protocol to encode classical bits in the measurement statistics of many-body Pauli observables, leveraging quantum correlations for a random access code. Measurement contexts built with these observables yield outcomes with…
Quantum Random Access Memory (qRAM) is an essential computing element for running oracle-based quantum algorithms. qRAM exploits quantum superposition to access all data stored in the memory cells simultaneously and guarantees the superior…
We show that concrete hardness assumptions about learning or cloning the output state of a random quantum circuit can be used as the foundation for secure quantum cryptography. In particular, under these assumptions we construct secure…
It has recently been shown that there are efficient algorithms for quantum computers to solve certain problems, such as prime factorization, which are intractable to date on classical computers. The chances for practical implementation,…
We present adaptive measurement techniques tailored for variational quantum algorithms on near-term small and noisy devices. In particular, we generalise earlier "learning to measure" strategies in two ways. First, by considering a class of…
The general stable quantum memory unit is a hybrid consisting of a classical digit with a quantum digit (qudit) assigned to each classical state. The shape of the memory is the vector of sizes of these qudits, which may differ. We determine…
Major obstacles remain to the implementation of macroscopic quantum computing: hardware problems of noise, decoherence, and scaling; software problems of error correction; and, most important, algorithm construction. Finding truly quantum…
The faithful storage of a quantum bit of light is essential for long-distance quantum communication, quantum networking and distributed quantum computing. The required optical quantum memory must, first, be able to receive and recreate the…
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…
Random access memory is an indispensable device for classical information technology. Analog to this, for quantum information technology, it is desirable to have a random access quantum memory with many memory cells and programmable access…
In classical two-party computation, a trusted initializer who prepares certain initial correlations, known as one-time tables, can help make the inputs of both parties information-theoretically secure. We propose some bipartite quantum…
We study the problem of approximately recovering signals on a manifold from one-bit linear measurements drawn from either a Gaussian ensemble, partial circulant ensemble, or bounded orthonormal ensemble and quantized using Sigma-Delta or…
This paper deals with the quantum optimal discrimination among mixed quantum states enjoying geometrical uniform symmetry with respect to a reference density operator $\rho_0$. It is well-known that the minimal error probability is given by…
Let $f$ denote length preserving function on words. A classical algorithm can be considered as $T$ iterated applications of black box representing $f$, beginning with input word $x$ of length $n$. It is proved that if $T=O(2^{n/(7+e)}), e…
The error correcting capabilities of the Calderbank-Shor-Steane [[7,1,3]] quantum code, together with a fault-tolerant syndrome extraction by means of several ancilla states, have been numerically studied. A simple probability expression to…
Quantum noise constitutes a fundamental obstacle to realizing practical quantum technologies. To address the pivotal challenge of identifying quantum systems least affected by noise, we introduce the purest quantum state identification,…
We introduce the unambiguous quantum classifier based on Hamming distance measurements combined with classical post-processing. The proposed approach improves classification performance through a more effective use of ansatz expressivity,…
A hybrid quantum-classical algorithm is a computational scheme in which quantum circuits are used to extract information that is then processed by a classical routine to guide subsequent quantum operations. These algorithms are especially…
Quantum reservoir computing (QRC) is a hardware-implementation-friendly quantum neural network scheme with minimal physical system requirements and a proven advantage over classical counterparts. We use an extension of the positive-P phase…
A one way partial quantum bit commitment protocol is developed, using states with built-in classical correlation, completely independent of entanglement. It involves concealing information in a set of mutually non-orthogonal states and…