Related papers: The Non-mechanistic Character of Quantum Computati…
We study the impact of entangling measurements on the efficiency of quantum measurement- based engines. We first show that for engines comprising many subsystems their efficiency can be enhanced by performing entangling measurements, as…
The resources needed to conventionally characterize a quantum system are overwhelmingly large for high- dimensional systems. This obstacle may be overcome by abandoning traditional cornerstones of quantum measurement, such as general…
The Zeno effect, in which repeated observation freezes the dynamics of a quantum system, stands as an iconic oddity of quantum mechanics. When a measurement is unable to distinguish between states in a subspace, the dynamics within that…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum…
We show that the Quantum Zeno Effect prevails even if the entanglement with the measuring probe is not complete. The dynamics towards the asymptotic regime as a function of $N$, the number of measurements, reveals surprising results: the…
The No-Cloning property in Quantum Computation is known not to depend on the unitarity of the operators involved, but only on their linearity. Based on that fact, here it is shown that the No-Cloning property remains valid when Quantum…
The ability to extract relevant information is critical to learning. An ingenious approach as such is the information bottleneck, an optimisation problem whose solution corresponds to a faithful and memory-efficient representation of…
The quantum Zeno effect is a distinctive phenomenon in quantum mechanics, describing the nontrivial effect of frequent projective measurements on hindering the evolution of a quantum system. However, when subjected to environmental noise,…
When an experimentalist measures a time series of qubits, the outcomes generate a classical stochastic process. We show that measurement induces high complexity in these processes in two specific senses: they are inherently unpredictable…
In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e.\ it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability --- an…
It is widely known that `collapse of the wave function' on a quantum system A may be brought about by an interaction with another quantum system B. We will prove that this is not just a possible, but a necessary consequence of information…
Testable predictions of quantum mechanics are invariant under time reversal. But the change of the quantum state in time is not so, neither in the collapse nor in the no-collapse interpretations of the theory. This fact challenges the…
We show that the quantum Zeno effect can be used to suppress the failure events that would otherwise occur in a linear optics approach to quantum computing. From a practical viewpoint, that would allow the implementation of deterministic…
In analogy with conventional quantum mechanics, non-commutative quantum mechanics is formulated as a quantum system on the Hilbert space of Hilbert-Schmidt operators acting on non-commutative configuration space. It is argued that the…
Quantum states picked from non-trivial symmetry protected topological (SPT) phases have computational power in measurement based quantum computation. This power is uniform across SPT phases, and is unlocked by measurements that break the…
We review here the recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations. The concept is introduced in successive steps through the studies of mapping of…
Let $f$ denote length preserving function on words. A classical algorithm can be considered as $T$ iterated applications of black box representing $f$, beginning with input word $x$ of length $n$. It is proved that if $T=O(2^{n/(7+e)}), e…
In this paper, we discuss the dynamical issues of quantum computation. We demonstrate that fast wave function oscillations can affect the performance of Shor's quantum algorithm by destroying required quantum interference. We also show that…
The temporal evolution of an unstable quantum mechanical system undergoing repeated measurements is investigated. In general, by changing the time interval between successive measurements, the decay can be accelerated (inverse quantum Zeno…