Related papers: Quantum interference as a resource for quantum spe…
We consider quantum formalism limited by the classical simulating computer with the fixed memory. The memory is redistributed in the course of modeling by the variation of the set of classical states and the accuracy of the representation…
The possibility to save and process information in fundamentally indistinguishable states is the quantum mechanical resource that is not encountered in classical computing. I demonstrate that, if energy constraints are imposed, this…
Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms and quantum simulation of condensed matter systems. The key property of quantum…
We derive generalized quantum speed limit inequalities that represent limitations on the time evolution of quantum states. They are extensions of the original inequality and are applied to the overlap between the time-evolved state and an…
One-dimensional discrete-time quantum walk has played an important role in development of quantum algorithms and protocols for different quantum simulations. The speedup observed in quantum walk algorithms is attributed to quantum…
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…
Quantum computers are expected to revolutionize our ability to process information. The advancement from classical to quantum computing is a product of our advancement from classical to quantum physics -- the more our understanding of the…
Quantum particles in a potential are described by classical statistical probabilities. We formulate a basic time evolution law for the probability distribution of classical position and momentum such that all known quantum phenomena follow,…
Experimental attempts to implement quantum speedup of computations over the past 30 years have yielded a negative result, despite the absence of physical laws prohibiting such speedup. The article formulates the limitation of quantum…
Classical simulators play a major role in the development and benchmark of quantum algorithms and practically any software framework for quantum computation provides the option of running the algorithms on simulators. However, the…
Understanding the power and limitations of quantum access to data in machine learning tasks is primordial to assess the potential of quantum computing in artificial intelligence. Previous works have already shown that speed-ups in learning…
We study some extensions of Grover's quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic speedup obtained by the quantum searching…
The goal of demonstrating a quantum advantage with currently available experimental systems is of utmost importance in quantum information science. While this remains elusive for quantum computation, the field of communication complexity…
The novel quantum effects induced by the free-electron-photons interaction have attracted increasing interest due to their potential applications in ultrafast quantum information processing. Here, we propose a scheme to generate optical cat…
We show that the effects of quantum interference can be implemented in Monte-Carlo generators by modelling the generalized Wigner functions. A specific prescription for an appropriate modification of the weights of events produced by…
We apply our recent work on empirical estimates of quantum speedups to the practical task of community detection in complex networks. We design several quantum variants of a popular classical algorithm -- the Louvain algorithm for community…
The aim of this dissertation is to clarify the debate over the explanation of quantum speedup and to submit a tentative resolution to it. In particular, I argue that the physical explanation for quantum speedup is precisely the fact that…
We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…
Performing exact inference on Bayesian networks is known to be #P-hard. Typically approximate inference techniques are used instead to sample from the distribution on query variables given the values $e$ of evidence variables. Classically,…
We investigate the transition from quantum to classical mechanics using a one-dimensional free particle model. In the classical analysis, we consider the initial positions and velocities of the particle drawn from Gaussian distributions.…