Related papers: Quantum Advantage without Entanglement
We show that quantum oracles provide an advantage over classical oracles for answering classical counterfactual questions in causal models, or equivalently, for identifying unknown causal parameters such as distributions over functional…
Quantum computers are believed to bring computational advantages in simulating quantum many body systems. However, recent works have shown that classical machine learning algorithms are able to predict numerous properties of quantum systems…
By harnessing the superposition and entanglement of physical states, quantum computers could outperform their classical counterparts in solving problems of technological impact, such as factoring large numbers and searching databases. A…
From its seemingly non-intuitive and puzzling nature, most evident in numerous EPR-like gedankenexperiments to its almost ubiquitous presence in quantum technologies, entanglement is at the heart of modern quantum physics. First introduced…
Quantum computation appears to offer significant advantages over classical computation and this has generated a tremendous interest in the field. In this thesis we consider the application of quantum computers to scientific computing and…
Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counter-part. In this review we explain the basic…
In recent years, deep learning has had a profound impact on machine learning and artificial intelligence. At the same time, algorithms for quantum computers have been shown to efficiently solve some problems that are intractable on…
Entanglement is one of the pillars of quantum mechanics and quantum information processing, and as a result the quantumness of nonentangled states has typically been overlooked and unrecognized. We give a robust definition for the…
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…
We claim that the nonlocality without entanglement revealed quite recently by Bennett {\it et al.} [quant-ph/9804053] should be rather interpreted as {\it Einstein-Podolsky-Rosen paradox without entanglement}. It would be true nonlocality…
Entanglement underpins a variety of quantum-enhanced communication, sensing, and computing capabilities. Entanglement-assisted communication (EACOMM) leverages entanglement pre-shared by communication parties to boost the rate of classical…
We propose a classical to quantum information encoding system using non--orthogonal states and apply it to the problem of searching an element in a quantum list. We show that the proposed encoding scheme leads to an exponential gain in…
This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…
We investigate macroscopic entanglement of quantum states in quantum computers, where we say a quantum state is entangled macroscopically if the state has superposition of macroscopically distinct states. The index $p$ of the macroscopic…
We show that in the presence of arbitrary catalysts, any pure bipartite entangled state can be converted into any other to unlimited accuracy without the use of any communication, quantum or classical.
Whether noisy quantum devices without error correction can provide quantum advantage over classical computers is a critical issue of current quantum computation. In this work, the random quantum circuits, which are used as the paradigm…
Boolean functions are important building blocks in cryptography for their wide application in both stream and block cipher systems. For cryptanalysis of such systems one tries to find out linear functions that are correlated to the Boolean…
Quantum advantage in computation refers to the existence of computational tasks that can be performed efficiently on a quantum computer but cannot be efficiently simulated on any classical computer. Identifying the precise boundary of…
The electronic structure problem is one of the main problems in modern theoretical chemistry. While there are many already-established methods both for the problem itself and its applications like semi-classical or quantum dynamics, it…
In this work, we propose a new way to (non-interactively, verifiably) demonstrate Quantum Advantage by solving the average-case $\mathsf{NP}$ search problem of finding a solution to a system of (underdetermined) multivariate quadratic…