Related papers: Variations on Classical and Quantum Extractors
We consider reversible work extraction from identical quantum batteries. From an ensemble of individually passive states, work can be produced only via global unitary (and thus entangling) operations. However, we show here that there always…
Our aim is to experimentally study the possibility of distinguishing between quantum sources of randomness--recently proved to be theoretically incomputable--and some well-known computable sources of pseudo-randomness. Incomputability is a…
The present era of quantum processors with hundreds to thousands of noisy qubits has sparked interest in understanding the computational power of these devices and how to leverage it to solve practically relevant problems. For applications…
We introduce a random circuit family and show they are robust against current classical simulation techniques, specifically tensor network contraction and Pauli propagation. We also show that local variables do not concentrate, ensuring…
We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation. Specifically, for classes of search problems, we show that the following statements hold, relative to a…
At Crypto 2011, some of us had proposed a family of cryptographic protocols for key establishment capable of protecting quantum and classical legitimate parties unconditionally against a quantum eavesdropper in the query complexity model.…
Circuit cutting is a technique for simulating large quantum circuits by partitioning them into smaller subcircuits, which can be executed on smaller quantum devices. The results from these subcircuits are then combined in classical…
Quantum Machine Learning algorithms based on Variational Quantum Circuits (VQCs) are important candidates for useful application of quantum computing. It is known that a VQC is a linear model in a feature space determined by its…
Randomness extraction against side information is the art of distilling from a given source a key which is almost uniform conditioned on the side information. This paper provides randomness extraction against quantum side information whose…
In this article we prove that for a large class of operators, including Schroedinger operators, with hyperbolic classical flows, the smallness of dimension of the trapped set implies that there is a gap between the resonances and the real…
For relativistic energies the small angle classical cross section for scattering on a Coulomb potential agrees with the first Born approximation for quantum cross section for scalar particle only in the leading term. The disagreement in…
The design of decoding algorithms is a significant technological component in the development of fault-tolerant quantum computers. Often design of quantum decoders is inspired by classical decoding algorithms, but there are no general…
We present a detailed comparison of the motion of a classical and of a quantum particle in the presence of trapping sites, within the framework of continuous-time classical and quantum random walk. The main emphasis is on the qualitative…
Understanding the role of classical and quantum correlations in work extraction is a problem of fundamental importance in thermodynamics. We approach this problem by considering that, in closed quantum systems, the maximum cyclic work…
Broadly applicable quantum advantage, particularly in classical data processing and machine learning, has been a fundamental open problem. In this work, we prove that a small quantum computer of polylogarithmic size can perform large-scale…
Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite lifetime. Hybrid algorithms leveraging classical resources have demonstrated promising initial results…
In this paper we analyze the classical limit of the Nelson model with cut off, when both non-relativistic and relativistic particles number goes to infinity. We prove convergence of quantum observables to the solutions of classical…
We derive exceedingly simple practical procedures revealing the quantum nature of states and measurements by the violation of classical upper bounds on the statistics of arbitrary measurements. Data analysis is minimum and definite…
This paper considers the problem of distinguishing between classical and quantum domains in macroscopic phenomena using tests based on probability and it presents a condition on the ratios of the outcomes being the same (Ps) to being…
We consider the possibility of encoding m classical bits into much fewer n quantum bits so that an arbitrary bit from the original m bits can be recovered with a good probability, and we show that non-trivial quantum encodings exist that…