Related papers: Origin of the quantum speed-up
The descriptions of the quantum realm and the macroscopic classical world differ significantly not only in their mathematical formulations but also in their foundational concepts and philosophical consequences. When and how physical systems…
Quantum theory provides a significant example of two intermingling hallmarks of science: the ability to consistently combine physical systems and study them compositely, and the power to extract predictions in the form of correlations. A…
We discuss quantum algorithms that calculate numerical integrals and descriptive statistics of stochastic processes. With either of two distinct approaches, one obtains an exponential speed increase in comparison to the fastest known…
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In…
Incompatibility of certain measurements -- impossibility of obtaining deterministic outcomes simultaneously -- is a well known property of quantum mechanics. This feature can be utilized in many contexts, ranging from Bell inequalities to…
Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be…
In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such devices to demonstrate "quantum supremacy": that is, a clear…
Bell's theorem is typically understood as the proof that quantum theory is incompatible with local-hidden-variable models. More generally, we can see the violation of a Bell inequality as witnessing the impossibility of explaining quantum…
Causal inference revealing causal dependencies between variables from empirical data has found applications in multiple sub-fields of scientific research. A quantum perspective of correlations holds the promise of overcoming the limitation…
The cryptographic protocol of coin tossing consists of two parties, Alice and Bob, that do not trust each other, but want to generate a random bit. If the parties use a classical communication channel and have unlimited computational…
Quantum mechanics can emerge from classical statistics. A typical quantum system describes an isolated subsystem of a classical statistical ensemble with infinitely many classical states. The state of this subsystem can be characterized by…
Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a…
Summoning is a task between two parties, Alice and Bob, with distributed networks of agents in space-time. Bob gives Alice a random quantum state, known to him but not her, at some point. She is required to return the state at some later…
While ultimately they are described by quantum mechanics, macroscopic mechanical systems are nevertheless observed to follow the trajectories predicted by classical mechanics. Hence, in the regime defining macroscopic physics, the…
A game is played by a team of two --- say Alice and Bob --- in which the value of a random variable $x$ is revealed to Alice only, who cannot freely communicate with Bob. Instead, she is given a quantum $n$-level system, respectively a…
The main mystery of quantum mechanics is contained in Wheeler's delayed choice experiment, which shows that the past is determined by our choice of what quantum property to observe. This gives the observer a participatory role in deciding…
Quantum algorithms speeding up classical counterparts are proposed for the problems: 1. Recognition of eigenvalues with fixed precision. Given a quantum circuit generating unitary mapping $U$ and a complex number the problem is to determine…
The oracle model of computation is believed to allow a rigorous proof of quantum over classical computational superiority. Since quantum and classical oracles are essentially different, a correspondence principle is commonly implicitly used…
Asymmetric steering is an effect whereby an inseparable bipartite system can be found to be described by either quantum mechanics or local hidden variable theories depending on which one of Alice or Bob makes the required measurements. We…
A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more about the other's input than what is implied by the value of…