Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAlmost all quantum states have non-classical correlations
341
0
0.0
(
0
)
Added by
Fernando M. Cucchietti
Publication date
2009
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Quantum discord quantifies non-classical correlations in a quantum system including those not captured by entanglement. Thus, only states with zero discord exhibit strictly classical correlations. We prove that these states are negligible in the whole Hilbert space: typically a state picked out at random has positive discord; and, given a state with zero discord, a generic arbitrarily small perturbation drives it to a positive-discord state. These results hold for any Hilbert-space dimension, and have direct implications on quantum computation and on the foundations of the theory of open systems. In addition, we provide a simple necessary criterion for zero quantum discord. Finally, we show that, for almost all positive-discord states, an arbitrary Markovian evolution cannot lead to a sudden, permanent vanishing of discord.
rate research
Read More
There have been a number of attempts to derive the set of quantum non-local correlations from reasonable physical principles. Here we introduce $tilde{Q}$, a set of multipartite supra-quantum correlations that has appeared under different names in fields as diverse as graph theory, quantum gravity and quantum information science. We argue that $tilde{Q}$ may correspond to the set of correlations of a reasonable physical theory, in which case the research program to reconstruct quantum theory from device-independent principles is met with strong obstacles. In support of this conjecture, we prove that $tilde{Q}$ is closed under classical operations and satisfies the physical principles of Non-Trivial Communication Complexity, No Advantage for Nonlocal Computation, Macroscopic Locality and Local Orthogonality. We also review numerical evidence that almost quantum correlations satisfy Information Causality.
Quantum teleportation, the process by which Alice can transfer an unknown quantum state to Bob by using pre-shared entanglement and classical communication, is one of the cornerstones of quantum information. The standard benchmark for certifying quantum teleportation consists in surpassing the maximum average fidelity between the teleported and the target states that can be achieved classically. According to this figure of merit, not all entangled states are useful for teleportation. Here we propose a new benchmark that uses the full information available in a teleportation experiment and prove that all entangled states can implement a quantum channel which can not be reproduced classically. We introduce the idea of non-classical teleportation witness to certify if a teleportation experiment is genuinely quantum and discuss how to quantify this phenomenon. Our work provides new techniques for studying teleportation that can be immediately applied to certify the quality of quantum technologies.
A locking protocol between two parties is as follows: Alice gives an encrypted classical message to Bob which she does not want Bob to be able to read until she gives him the key. If Alice is using classical resources, and she wants to approach unconditional security, then the key and the message must have comparable sizes. But if Alice prepares a quantum state, the size of the key can be comparatively negligible. This effect is called quantum locking. Entanglement does not play a role in this quantum advantage. We show that, in this scenario, the quantum discord quantifies the advantage of the quantum protocol over the corresponding classical one for any classical-quantum state.
It has been proved that almost all $n$-bit Boolean functions have exact classical query complexity $n$. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost all $n$-bit Boolean functions can be computed by an exact quantum algorithm with less than $n$ queries. More exactly, we prove that ${AND}_n$ is the only $n$-bit Boolean function, up to isomorphism, that requires $n$ queries.
The quantum superposition principle has been extensively utilized in the quantum mechanical description of the bonding phenomenon. It explains the emergence of delocalized molecular orbitals and provides a recipe for the construction of near-exact electronic wavefunctions. On the other hand, its existence in composite systems may give rise to nonclassical correlations that are regarded now as a resource in quantum technologies. Here, we approach the electronic ground states of three prototypical molecules from the point of view of fermionic information theory. For the first time in the literature, we properly decompose the pairwise orbital correlations into their classical and quantum parts in the presence of superselection rules. We observe that quantum orbital correlations can be stronger than classical orbital correlations though not often. Also, quantum orbital correlations can survive even in the absence of orbital entanglement depending on the symmetries of the constituent orbitals. Finally, we demonstrate that orbital entanglement would be underestimated if the orbital density matrices were treated as qubit states.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
