Related papers: The preparation problem in nonlinear extensions of…
In theories of communication, it is usually presumed that the involved parties perform actions in a fixed causal order. However, practical and fundamental reasons can induce uncertainties in the causal order. Here we show that a maximal…
We present a critique of the many-world interpretation of quantum mechanics, based on different ``pictures'' that describe the time evolution of an isolated quantum system. Without an externally imposed frame to restrict these possible…
We study coordination under restricted information, where classical local models fail to implement certain correlated distributions because agents cannot condition on past history. We show that quantum systems overcome this limitation even…
Incoherence in the controlled Hamiltonian is an important limitation on the precision of coherent control in quantum information processing. Incoherence can typically be modelled as a distribution of unitary processes arising from slowly…
Involving only the measurements of commuting observables - the problem-setting and the corresponding solution - quantum algorithms should be subject to classical logic. This would allow flanking their customary quantum description with a…
This article presents the first complete application of a quantum time-marching algorithm for simulating multidimensional linear transport phenomena with arbitrary boundaries, whereby the success probabilities are problem intrinsic. The…
In orthodox quantum theory the observables of spacelike separated quantum systems commute. I shall call this the commutation constraint. It severely limits quantum theory's explanatory power. For instance, the constraint cannot be met in…
Quantum technologies have shown immeasurable potential to effectively solve several information processing tasks such as prime number factorization, unstructured database search or complex macromolecule simulation. As a result of such…
Quantum computers promise to efficiently solve not only problems believed to be intractable for classical computers, but also problems for which verifying the solution is also considered intractable. This raises the question of how one can…
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an…
Quantum theory depends on an external classical time, and there ought to exist an equivalent reformulation of the theory which does not depend on such a time. The demand for the existence of such a reformulation suggests that quantum theory…
Quantum computation represents a computational paradigm whose distinctive attributes confer the ability to devise algorithms with asymptotic performance levels significantly superior to those achievable via classical computation. Recent…
Deviations from classical physics when distant quantum systems become correlated are interesting both fundamentally and operationally. There exist situations where the correlations enable collaborative tasks that are impossible within the…
We show that quantum theory allows for transformations of black boxes that cannot be realized by inserting the input black boxes within a circuit in a pre-defined causal order. The simplest example of such a transformation is the classical…
Although information, strictly speaking, is not a physical entity, it generally requires physical entities as its carriers, e.g., writing it down on paper, encoding it with quantum particles, or transmitting it using electro-magnetic…
Based on an intuitive generalization of the Leibniz principle of `the identity of indiscernibles', we introduce a novel ontological notion of classicality, called bounded ontological distinctness. Formulated as a principle, bounded…
This article is dedicated to the proof of the existence of classical solutions for a class of non-linear integral variational problems. Those problems are involved in nonlocal image and signal processing.
The theory of quantum algorithms promises unprecedented benefits of harnessing the laws of quantum mechanics for solving certain computational problems. A persistent obstacle to using such algorithms for solving a wide range of real-world…
The possible existence of closed timelike curves (CTCs) draws attention to fundamental questions about what is physically possible and what is not. An example is the "no cloning theorem" in quantum mechanics, which states that no physical…
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…