Related papers: Duality in Quantum Quenches and Classical Approxim…
We consider online algorithms as a request-answer game. An adversary that generates input requests, and an online algorithm answers. We consider a generalized version of the game that has a buffer of limited size. The adversary loads data…
Motivated by notions of quantum heuristics and by average-case rather than worst-case algorithmic analysis, we define quantum computational advantage in terms of individual problem instances. Inspired by the classical notions of Kolmogorov…
Many recent investigations conclude, based on asymptotic complexity analyses, that quantum computers could accelerate combinatorial optimization (CO) tasks relative to a purely classical computer. However, asymptotic analysis alone cannot…
Recent years have seen significant activity on the problem of using data for the purpose of learning properties of quantum systems or of processing classical or quantum data via quantum computing. As in classical learning, quantum learning…
It is often said that quantum and classical randomness are of different nature, the former being ontological and the latter epistemological. However, so far the question of "What is quantum in quantum randomness", i.e. what is the impact of…
A careful study of the classical/quantum connection with the aid of coherent states offers new insights into various technical problems. This analysis includes both canonical as well as closely related affine quantization procedures. The…
This paper presents two unconventional links between quantum and classical physics. The first link appears in the study of quantum cryptography. In the presence of a spy, the quantum correlations shared by Alice and Bob are imperfect. One…
Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum…
We show that semiclassical formulas such as the Gutzwiller trace formula can be implemented on a quantum computer more efficiently than on a classical device. We give explicit quantum algorithms which yield quantum observables from…
In the field of quantum information, classical optimizers play an important role. From experimentalists optimizing their physical devices to theorists exploring variational quantum algorithms, many aspects of quantum information require the…
Quantum computers are known to provide an exponential advantage over classical computers for the solution of linear differential equations in high-dimensional spaces. Here, we present a quantum algorithm for the solution of nonlinear…
One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed…
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for…
Composition is something we take for granted in classical algorithms design, and in particular, we take it as a basic axiom that composing ``efficient'' algorithms should result in an ``efficient'' algorithm -- even using this intuition to…
We create classical (non-quantum) dynamic data structures supporting queries for recommender systems and least-squares regression that are comparable to their quantum analogues. De-quantizing such algorithms has received a flurry of…
Although quantum computers are predicted to have many commercial applications, less attention has been given to their potential for resolving foundational issues in quantum mechanics. Here we focus on quantum computers' utility for the…
Effective classicality of a property of a quantum system can be defined using redundancy of its record in the environment. This allows quantum physics to approximate the situation encountered in the classical world: The information about a…
A direct classical analog of quantum decoherence is introduced. Similarities and differences between decoherence dynamics examined quantum mechanically and classically are exposed via a second-order perturbative treatment and via a strong…
Causality is one of the most fundamental notions in physics. Generalized probabilistic theories (GPTs) and the process matrix framework incorporate it in different forms. However, a direct connection between these frameworks remains…
Stunning progresses in the experimental resolution and control of natural or man-made complex systems at the level of their quantum mechanical constituents raises the question, across diverse subdisciplines of physics, chemistry and…