Related papers: Quantum Godwin's Law
Quantum systems are known to offer advantages over their classical counterpart in communication complexity protocols, where the aim is to minimize the amount of information exchange between distant parties to compute global functions of…
Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from…
Remarkable progress of quantum information theory (QIT) allowed to formulate mathematical theorems for conditions that data-transmitting or data-processing occurs with a non-negative entropy gain. However, relation of these results…
An interpretation and re-formulation of modern physics which removes the presumption of the space-time continuum, and bases physical theory on a small number of rational and empirical principles. After briefly describing the philosophical…
Quantum Discord (QD) is a measure of the total quantum non-local correlations of a quantum system. The formalism of quantum discord has been applied to various two-qubit mixed states and it has been reported that there is a non-zero quantum…
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…
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…
Probabilistic graphical models such as Bayesian Networks are one of the most powerful structures known by the Computer Science community for deriving probabilistic inferences. However, modern cognitive psychology has revealed that human…
Realistic physical implementations of quantum computers can entail tradeoffs which depart from the ideal model of quantum computation. Although these tradeoffs have allowed successful demonstration of certain quantum algorithms, a crucial…
The Lieb-Robinson bound sets a theoretical upper limit on the speed at which information can propagate in non-relativistic quantum spin networks. In its original version, it results in an exponentially exploding function of the evolution…
This thesis investigates the connection between quantum theory, thermodynamics and information theory. Theories with structure similar to that of quantum theory are considered, mathematically described by the framework of "Generalized…
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…
The maximum-likelihood principle unifies inference of quantum states and processes from experimental noisy data. Particularly, a generic quantum process may be estimated simultaneously with unknown quantum probe states provided that…
The ability to identify cause-effect relations is an essential component of the scientific method. The identification of causal relations is generally accomplished through statistical trials where alternative hypotheses are tested against…
Topological materials exhibit unique electronic structures that underpin both fundamental quantum phenomena and next-generation technologies, yet their discovery remains constrained by the high computational cost of first-principles…
Quantum query complexity is known to be characterized by the so-called quantum adversary bound. While this result has been proved in the standard discrete-time model of quantum computation, it also holds for continuous-time (or…
The quantum speed limit indicates the maximal evolution speed of the quantum system. In this work, we determine speed limits on the informational measures, namely the von Neumann entropy, maximal information, and coherence of quantum…
An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…
Quantum algorithms theoretically outperform classical algorithms in solving problems of increasing size, but computational errors must be kept to a minimum to realize this potential. Despite the development of increasingly capable quantum…
Deep neural network powered artificial intelligence has rapidly changed our daily life with various applications. However, as one of the essential steps of deep neural networks, training a heavily weighted network requires a tremendous…