Related papers: Quantum random access codes and incompatibility of…
We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be at most polynomial. We show that for average-case complexity under the…
We propose a new measure of relative incompatibility for a quantum system with respect to two non-commuting observables, and call it quantumness of relative incompatibility. In case of a classical state, order of observation is…
Quantum incompatibility, referred as the phenomenon that some quantum measurements cannot be performed simultaneously, is necessary for various quantum information processing tasks, such as nonlocality and steering. When these applications…
We present an experimental procedure to determine the usefulness of a measurement scheme for quantum error correction (QEC). A QEC scheme typically requires the ability to prepare entangled states, to carry out multi-qubit measurements, and…
The quantum measurement incompatibility is a distinctive feature of quantum mechanics. We investigate the incompatibility of a set of general measurements and classify the incompatibility by the hierarchy of compatibilities of its subsets.…
Incompatible, i.e. non-jointly measurable quantum measurements are a necessary resource for many information processing tasks. It is known that increasing the number of distinct measurements usually enhances the incompatibility of a…
Before the availability of large scale fault-tolerant quantum devices, one has to find ways to make the most of current noisy intermediate-scale quantum devices. One possibility is to seek smaller repetitive hybrid quantum-classical tasks…
We study random number expansion protocols based on the $n \to 1$ quantum random access codes (QRACs). We consider them in the semi-device independent scenario where the inner workings of the devices are unknown to us but we can certify the…
A quantum computer has now solved a specialized problem believed to be intractable for supercomputers, suggesting that quantum processors may soon outperform supercomputers on scientifically important problems. But flaws in each quantum…
The Quantum Computer Condition (QCC) provides a rigorous and completely general framework for carrying out analyses of questions pertaining to fault-tolerance in quantum computers. In this paper we apply the QCC to the problem of…
To perform meaningful computations, Quantum Computers (QCs) must scale to macroscopic levels - i.e., to a large number of qubits - an objective pursued by most quantum companies. How to efficiently test their quantumness at these scales? We…
The study of measurements in quantum mechanics exposes many of the ways in which the quantum world is different. For example, one of the hallmarks of quantum mechanics is that observables may be incompatible, implying among other things…
A key issue of current quantum advantage experiments is that their verification requires a full classical simulation of the ideal computation. This limits the regime in which the experiments can be verified to precisely the regime in which…
A quantum random access code (QRAC) is a map $x\mapsto\rho_x$ that encodes $n$-bit strings $x$ into $m$-qubit quantum states $\rho_x$, in a way that allows us to recover any one bit of $x$ with success probability $\geq p$. The measurement…
Random access codes are a type of communication task that is widely used in quantum information science. The optimal average success probability that can be achieved through classical strategies is known for any random access code. However,…
We consider highly inaccurate measurements made on classical stochastic and quantum systems. In the quantum case such a \e{weak} measurement preserves coherence between the system's alternatives. We demonstrate that in both cases the…
Semi-device-independent quantum protocols realize information tasks - e.g. secure key distribution, random access coding, and randomness generation - in a scenario where no assumption on the internal working of the devices used in the…
We study prepare-and-measure experiments where the sender (Alice) receives trusted quantum inputs but has an untrusted state-preparation device and the receiver (Bob) has a fully-untrusted measurement device. A distributed-sampling task…
It has been shown that the apparent advantage of some quantum machine learning algorithms may be efficiently replicated using classical algorithms with suitable data access -- a process known as dequantization. Existing works on…
The advantages of quantum random number generators (QRNGs) over pseudo-random number generators (PRNGs) are normally attributed to the nature of quantum measurements. This is often seen as implying the superiority of the sequences of bits…