Related papers: Quantum dissonance provide power to deterministic …
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…
The deterministic quantum computation with one qubit (DQC1) model is a restricted model of quantum computing able to calculate efficiently the normalized trace of a unitary matrix. In this work we analyse the quantum correlations named…
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…
We describe an efficient DQC1-algorithm to quantify the amount of Geometric Quantum Discord present in the output state of a DQC1 computation. DQC1 is a model of computation that utilizes separable states to solve a problem with no known…
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…
We study the relative strength of classical and quantum correlations, as measured by discord, for two-qubit states. Quantum correlations appear only in the presence of classical correlations, while the reverse is not always true. We…
We discuss models of computing that are beyond classical. The primary motivation is to unearth the cause of nonclassical advantages in computation. Completeness results from computational complexity theory lead to the identification of very…
We study coordination under restricted information, where classical local models fail to implement certain correlated distributions because agents cannot condition on past history. We show that quantum systems overcome this limitation even…
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…
One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed…
Discordant states appear in a large number of quantum phenomena and seem to be a good indicator of divergence from classicality. While there is evidence that they are essential for a quantum algorithm to have an advantage over a classical…
We construct a model of quantum metrology inspired by the computational model known as deterministic quantum computation with one quantum bit (DQC1). Using only one pure qubit together with $l$ fully-mixed qubits we obtain measurement…
Control at the interface between the classical and the quantum world is fundamental in quantum physics. In particular, how classical control is enhanced by coherence effects is an important question both from a theoretical as well as from a…
Entanglement is a central feature of quantum theory. Mathematical properties and physical applications of pure state entanglement make it a template to study quantum correlations. However, an extension of entanglement measures to mixed…
Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly…
Kernel methods are used extensively in classical machine learning, especially in the field of pattern analysis. In this paper, we propose a kernel-based quantum machine learning algorithm that can be implemented on a near-term, intermediate…
The possibility to save and process information in fundamentally indistinguishable states is the quantum mechanical resource that is not encountered in classical computing. I demonstrate that, if energy constraints are imposed, this…
Quantum computers promise dramatic advantages over their classical counterparts, but the answer to the most basic question "What is the source of the power in quantum computing?" has remained elusive. Here we prove a remarkable equivalence…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…