Related papers: Computing quantum discord is NP-complete
Quantum computing has the potential to provide exponential performance benefits in processing over classical computing. It utilizes quantum mechanics phenomena (such as superposition, entanglement, and interference) to solve a computational…
By quantifying the difference between quantum mutual information through weak measurement performed on a subsystem one is led to the notion of super quantum discord. The super version is also known to be difficult to compute as the quantum…
Quantum computers promise to efficiently solve not only problems believed to be intractable for classical computers, but also problems for which verifying the solution is also considered intractable. This raises the question of how one can…
Entanglement is the powerful and enigmatic resource central to quantum information processing, which promises capabilities in computing, simulation, secure communication, and metrology beyond what is possible for classical devices. Exactly…
Quantum computers are hypothetical devices, based on quantum physics, that would enable us to perform certain computations hundreds of orders of magnitude faster than digital computers. This feature is coined as "quantum supremacy" and one…
The study of quantum information processing seeks to characterize the resources that enable quantum information processing to perform tasks that are unfeasible or inefficient for classical information processing. Quantum cryptography is one…
The non-Markovian decoherence of quantum and classical correlations is analytically obtained when two qubits are asymmetrically subjected to the bit flip channel and phase flip channel. For one class of initial mixed states, quantum…
Quantum discord goes beyond entanglement and exists in a wide range of quantum states that may be separable, playing a crucial role in quantum information tasks. In this paper, we firstly proposed a zero-discord criterion for two-qubit…
Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki…
Quantum computing promises exponential speed-ups for important simulation and optimization problems. It also poses new CAD problems that are similar to, but more challenging, than the related problems in classical (non-quantum) CAD, such as…
Quantum discord expresses a fundamental non-classicality of correlations more general than quantum entanglement. We combine the no-local-broadcasting theorem, semidefinite-programming characterizations of quantum fidelity and quantum…
We approach the 3-SAT satisfiability problem with the quantum-inspired method of imaginary time propagation (ITP) applied to matrix product states (MPS) on a classical computer. This ansatz is fundamentally limited by a quantum entanglement…
Quantum systems, in general, output data that cannot be simulated efficiently by a classical computer, and hence is useful for solving certain mathematical problems and simulating quantum many-body systems. This also implies, unfortunately,…
We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and…
Preserving quantum coherence is fundamental challenge in the field of quantum computation. Here, I investigate the frozen discord phenomenon and non-Markovianity for qubits experiencing local dephasing in a classical environment. The…
Li and Luo [Phys. Rev. A 78 (2008), 024303] discovered a remarkable relation between discord and entanglement. It establishes that all separable states can be obtained via reduction of a classicaly-correlated state "living" in a space of…
Quantum discord and quantum uncertainty are two important features of the quantum world. In this work, the relation between entropic uncertainty relation and the shareability of quantum discord is studied. First, by using tripartite…
Noise is often regarded as anathema to quantum computation, but in some settings it can be an unlikely ally. We consider the problem of learning the class of $n$-bit parity functions by making queries to a quantum example oracle. In the…
Entanglement is a striking feature of quantum mechanics, and it has a key property called unextendibility. In this paper, we present a framework for quantifying and investigating the unextendibility of general bipartite quantum states.…
This paper presents a complete algorithmic study of the decision Boolean Satisfiability Problem under the classical computation and quantum computation theories. The paper depicts deterministic and probabilistic algorithms, propositions of…