Related papers: The Non-mechanistic Character of Quantum Computati…
Quantum sensing is commonly described as a constrained optimization problem: maximize the information gained about an unknown quantity using a limited number of particles. Important sensors including gravitational-wave interferometers and…
We investigate the computational power of creating steady-states of quantum dissipative systems whose evolution is governed by time-independent and local couplings to a memoryless environment. We show that such a model allows for efficient…
In open quantum systems, the quantum Zeno effect consists in frequent applications of a given quantum operation, e.g.~a measurement, used to restrict the time evolution (due e.g.~to decoherence) to states that are invariant under the…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
In quantum mechanics, measurements are dynamical processes and thus they should be capable of inducing currents. The symmetries of the Hamiltonian and measurement operator provide an organizing principle for understanding the conditions for…
Nonseparability - multipartite states that cannot be factorized - is one of the most striking features of quantum mechanics, as it gives rise to entanglement and non-causal correlations. In quantum computing, it also contributes directly to…
The paper gives a systematic review of the basic ideas of (non-relativistic) quantum mechanics including all changes that result from previous work of the authors. This shows that the new theory is self-consistent and (in certain sense)…
It is well known that the quantum Zeno effect can protect specific quantum states from decoherence by using projective measurements. Here we combine the theory of weak measurements with stabilizer quantum error correction and detection…
It is shown that quantum mechanics on noncommutative spaces (NQM) can be obtained by the canonical quantization of some underlying second class constrained system formulated in extended configuration space. It leads, in particular, to an…
It is proposed a possible new approach of quantum measurements (QMS), disconnected of the traditional interpretation of uncertainty relations and independent of any appeal to the strange idea of collapse (reduction) of wave functions. The…
The aim of this paper is to analyze the reconstructability of quantum mechanics from classical conditional probabilities representing measurement outcomes conditioned on measurement choices. We will investigate how the quantum mechanical…
Classical computations inherently require energy dissipation that increases significantly as the reliability of the computation improves. This dissipation arises when transitions between memory states are not balanced by their time-reversed…
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…
We show that universal quantum computation can be achieved in the standard pure-state circuit model while, at any time, the entanglement entropy of all bipartitions is small---even tending to zero with growing system size. The result is…
The possible effect of environment on the efficiency of a quantum algorithm is considered explicitely. It is illustrated through the example of Shor's prime factorization algorithm that this effect may be disastrous. The influence of…
In classical computation, a problem can be solved in multiple steps where calculated results of each step can be copied and used repeatedly. While in quantum computation, it is difficult to realize a similar multi-step computation process…
Prevention of a quantum system's time evolution by repetitive, frequent measurements of the system's state has been called the quantum Zeno effect (or paradox). Here we investigate theoretically and numerically the effect of repeated…
It is shown that a quantum computer can test the convexity and monotonicity of a given function exponentially more efficiently than a classical computer. This establishes another prominent example that showcases the potential of quantum…
The problem of measurement in quantum mechanics is reanalyzed within a general, strictly probabilistic framework (without reduction postulate). Based on a novel comprehensive definition of measurement the natural emergence of objective…
In a quantum computer any superposition of inputs evolves unitarily into the corresponding superposition of outputs. It has been recently demonstrated that such computers can dramatically speed up the task of finding factors of large…