Related papers: Quantum Advantage without Entanglement
It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than anything classically achievable, in terms of the reliability…
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 algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we…
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for…
Distributed quantum computing can give substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of Grover search. This motivates studying the quantum advantage of the distributed version of…
Although entanglement is widely considered to be necessary for quantum algorithms to improve on classical ones, Lloyd has observed recently that Grover's quantum search algorithm can be implemented without entanglement, by replacing…
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough.…
We present a computational framework based on geometric structures. No quantum mechanics is involved, and yet the algorithms perform tasks analogous to quantum computation. Tensor products and entangled states are not needed -- they are…
We investigate the problem of "nonlocal" computation, in which separated parties must compute a function with nonlocally encoded inputs and output, such that each party individually learns nothing, yet together they compute the correct…
Quantum computing takes fully advantage of the superposition principle to increase greatly (even exponentially) the speed of calculations, relative to the classical approach. The Deutsch-Jozsa algorithm is the simplest quantum algorithm…
We investigate the creation of entanglement by the application of phases whose value depends on the state of a collection of qubits. First we give the necessary and sufficient conditions for a given set of phases to result in the creation…
Query complexity is a common tool for comparing quantum and classical computation, and it has produced many examples of how quantum algorithms differ from classical ones. Here we investigate in detail the role that oracles play for the…
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…
The query model (or black-box model) has attracted much attention from the communities of both classical and quantum computing. Usually, quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity…
Entanglement is widely believed to lie at the heart of the advantages offered by a quantum computer. This belief is supported by the discovery that a noiseless (pure) state quantum computer must generate a large amount of entanglement in…
Entanglement has been shown to be necessary for pure state quantum computation to have an advantage over classical computation. However, it remains open whether entanglement is necessary for quantum computers that use mixed states to also…
The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advantage involve the repeated use of a black box, or oracle,…
We discuss the realization of quantum advantage in a system without quantum entanglement but with non-zero quantum discord. We propose an optical realization of symmetric two-qubit $X$-states with controllable anti-diagonal elements. This…
Entanglement lies at the heart of quantum mechanics and has no classical analogue. It is central to the speed up achieved by quantum algorithms over their classical counterparts. The Grover's search algorithm is one such algorithm which…
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…