Related papers: Experimental quantum computing without entanglemen…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Not all quantum protocols require entanglement to outperform their classical alternatives. The nonclassical correlations that lead to this quantum advantage are conjectured to be captured by quantum discord. Here we demonstrate that discord…
Although quantum computers are capable of solving problems like factoring exponentially faster than the best-known classical algorithms, determining the resources responsible for their computational power remains unclear. An important class…
Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector $\mathbf{b}$ is encoded in the amplitudes of a quantum state $\left |b \right >$. However, efficiently…
Deviations from classical physics when distant quantum systems become correlated are interesting both fundamentally and operationally. There exist situations where the correlations enable collaborative tasks that are impossible within the…
The first generation of small noisy quantum processors have recently become available to non-specialists who are not required to understand specifics of the physical platforms and, in particular, the types and sources of noise. As such, it…
Deterministic quantum computation with one quantum bit (DQC1), or the one clean qubit model, [E. Knill and R. Laflamme, Phys. Rev. Lett. {\bf81}, 5672 (1998)] is a model of quantum computing where the input is the tensor product of a single…
Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a promising path to a practical quantum processor. We have…
It is known that if the quantum gates in a proposed quantum computer are so noisy that they are incapable of generating entanglement, then the device can be efficiently simulated classically. If the measurements and single particle…
A path for efficient classical simulation of the DQC1 circuit that estimates the trace of an implementable unitary under the zero discord condition [Phys. Rev. Lett. 105, 190502 (2010)] is presented. This result reinforces the status of…
Classical simulations of noisy quantum circuits are instrumental to our understanding of the behavior of real-world quantum systems and the identification of regimes where one expects quantum advantage. In this work, we present a highly…
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running…
This thesis focuses on the experimental creation and detection of a variety of quantum correlations using nuclear magnetic resonance hardware. Quantum entanglement, being most common and counter-intuitive, is one of the main type considered…
In recent years, interest in quantum computing has increased due to technological advances in quantum hardware and algorithms. Despite the promises of quantum advantage, the applicability of quantum devices has been limited to few qubits on…
A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of…
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…
Entanglement detection is a fundamental task in quantum information science, serving as a cornerstone for quantum benchmarking and foundational studies. With an increasing qubit number that can be effectively controlled, there is a pressing…
Entanglement is not only the most intriguing feature of quantum mechanics, but also a key resource in quantum information science. The entanglement content of random pure quantum states is almost maximal; such states find applications in…
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.
Quantum computing is expected to provide exponential speedup in machine learning. However, optimizing the data loading process, commonly referred to as quantum data embedding, to maximize classification performance remains a critical…