Related papers: Random access codes via quantum contextual redunda…
Randomized protocols are procedures that incorporate probabilistic choices during their execution and they play a central role in quantum algorithms, spanning Hamiltonian simulation, noise mitigation, and measurement tasks. In practical…
A central challenge in analog quantum simulation is to characterize desirable physical properties of quantum states produced in experiments. However, in conventional approaches, the extraction of arbitrary information requires performing…
We lay a comprehensive foundation for the study of redundant information storage in decoherence processes. Redundancy has been proposed as a prerequisite for objectivity, the defining property of classical objects. We consider two ensembles…
Hybrid variational quantum algorithms are promising for solving practical problems, such as combinatorial optimization, quantum chemistry simulation, quantum machine learning, and quantum error correction on noisy quantum computers.…
We outline a quantum convolutional coding technique for protecting a stream of classical bits and qubits. Our goal is to provide a framework for designing codes that approach the ``grandfather'' capacity of an entanglement-assisted quantum…
We provide modular circuit-level implementations and resource estimates for several methods of block-encoding a dense $N\times N$ matrix of classical data to precision $\epsilon$; the minimal-depth method achieves a $T$-depth of…
The minimum average number of bits need to describe a random variable is its entropy, assuming knowledge of the underlying statistics On the other hand, universal compression supposes that the distribution of the random variable, while…
Linear real-valued computations over distributed datasets are common in many applications, most notably as part of machine learning inference. In particular, linear computations that are quantized, i.e., where the coefficients are…
Contextuality is a defining feature that separates the quantum from the classical descriptions of physical systems. Within the marginal-scenario framework, noncontextual models are characterized by the existence of a single joint…
A promising platform for semi-device-independent quantum information is prepare-and-measure experiments restricted only by a bound on the energy of the communication. Here, we investigate the role of shared entanglement in such scenarios.…
Contextuality - the obstruction to describing quantum mechanics in a classical statistical way - has been proposed as a resource that powers quantum computing. The measurement-based model provides a concrete manifestation of contextuality…
This paper applies Information Theoretic analysis to packet-based random multiple access communication systems. A new channel coding approach is proposed for coding within each data packet with built-in support for bursty traffic…
Contextuality is a fundamental marker of quantum non-classicality, which has emerged as a key resource for quantum computational advantage in multiple settings. Many such results hinge specifically on contextuality witnessed through Pauli…
Although quantum random number generators rely on the inherent indeterminism of quantum mechanics, ensuring that the numbers produced are secure remains a significant challenge. We introduce two semi-device-independent randomness expansion…
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 show how nonclassical correlations in local bipartite states can act as a resource for quantum information processing. Considering the task of quantum random access codes (RAC) through separable Bell-diagonal states, we demonstrate the…
Classical probabilistic models of (noisy) quantum systems are not only relevant for understanding the non-classical features of quantum mechanics, but they are also useful for determining the possible advantage of using quantum resources…
In continuous-variable quantum computation, identifying key elements that enable a quantum computational advantage is a long-standing issue. Starting from the standard results on the necessity of Wigner negativity, we develop a…
A simple protocol which takes advantage of the inherent random times of detections in single photon counting modules is presented for random active basis choices when using entanglement-based protocols for Quantum Key Distribution (QKD). It…
Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation. In this study, we propose an…