Related papers: Is Entanglement Sufficient to Enable Quantum Speed…
We provide a justification of the quantum speed-up based on the complementary roles played by the reversible preparation of an entangled state before measurement and by the final measurement action.
This paper demonstrates the use of entanglement resources in quantum speedup by presenting an algorithm which is the generalization of an algorithm proposed by Goswami and Panigrahi [arXiv:1706.09489 (2017)]. We generalize the algorithm and…
We argue that entanglement is the essential non-classical ingredient which provides the computational speed-up in quantum algorithms as compared to algorithms based on the processes of classical physics.
The Gottesman-Knill theorem says that a stabilizer circuit -- that is, a quantum circuit consisting solely of CNOT, Hadamard, and phase gates -- can be simulated efficiently on a classical computer. This paper improves that theorem in…
The degree of entanglement is determined for an arbitrary state of a broad class of PT-symmetric bipartite composite systems. Subsequently we quantify the rate with which entangled states are generated and show that this rate can be…
Entangled physical systems are an important resource in quantum information. Some authors claim that in fact all quantum states are entangled. In this paper we show that this claim is incorrect and we discuss in operational way differences…
The existence of entangled quantum states gives extra power to quantum computers over their classical counterparts. Quantum entanglement shows up qualitatively at the level of two qubits. We show that if no entanglement is envolved then…
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 thermodynamic process involves manipulating and controlling quantum states to extract energy or perform computational tasks with high efficiency. There is still no efficientgeneral method to theoretically quantify the effect of the…
We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum…
The one clean qubit model of quantum computation (DQC1) efficiently implements a computational task that is not known to have a classical alternative. During the computation, there is never more than a small but finite amount of…
We introduce a local concept of speed-up applicable to intermediate stages of a quantum algorithm. We use it to analyse the complementary roles played by quantum parallel computation and quantum measurement in yielding the speed-up. A…
The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…
Quantum entanglement between particles is expected to allow one to perform tasks that would otherwise be impossible. In quantum sensing and metrology, entanglement is often claimed to enable a precision that cannot be attained with the same…
Simulation tasks are insightful tools to compare information-theoretic resources. Considering a generalization of usual Bell scenarios where external quantum inputs are provided to the parties, we show that any entangled quantum state…
Quantum annealing has shown significant potential as an approach to near-term quantum computing. Despite promising progress towards obtaining a quantum speedup, quantum annealers are limited by the need to embed problem instances within the…
We provide a scheme for efficient simulation of a broad class of quantum optics experiments. Our efficient simulation extends the continuous variable Gottesman-Knill theorem to a large class of non-Gaussian mixed states, thereby identifying…
According to the Gottesman-Knill theorem, a class of quantum circuits, namely the so-called stabilizer circuits, can be simulated efficiently on a classical computer. We introduce a new algorithm for this task, which is based on the…
Despite rapid recent progress towards the development of quantum computers capable of providing computational advantages over classical computers, it seems likely that such computers will, initially at least, be required to run in a hybrid…
Quantum coherence allows the computation of an arbitrary number of distinct computational paths in parallel. Based on quantum parallelism it has been conjectured that exponential or even larger speedups of computations are possible. Here it…