Related papers: Computing quantum discord is NP-complete
Integer programming (IP) is an NP-hard combinatorial optimization problem that is widely used to represent a diverse set of real-world problems spanning multiple fields, such as finance, engineering, logistics, and operations research. It…
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…
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…
The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing…
Top quarks have been recently shown to be a promising system to study quantum information at the highest-energy scale available. The current lines of research mostly discuss topics such as entanglement, Bell nonlocality or quantum…
A new measure based on the tripartite information diagram is proposed for identifying quantum discord in tripartite systems. The proposed measure generalizes the mutual information underlying discord from bipartite to tripartite systems,…
Entanglement is known to be an essential resource for many quantum information processes. However, it is now known that some quantum features may be acheived with quantum discord, a generalized measure of quantum correlation. In this paper,…
Quantum correlations characterized by quantum entanglement and quantum discord play important roles in many quantum information processing. We study the relations among the entanglement of formation, concurrence, tangle, linear entropy…
We show that approximating the trace norm contraction coefficient of a quantum channel within a constant factor is NP-hard. Equivalently, this shows that determining the optimal success probability for encoding a bit in a quantum system…
We address the experimental determination of entropic quantum discord for systems made of a pair of polarization qubits. We compare results from full and partial tomography and found that the two determinations are statistically compatible,…
Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized…
NP-hard problems are not believed to be exactly solvable through general polynomial time algorithms. Hybrid quantum-classical algorithms to address such combinatorial problems have been of great interest in the past few years. Such…
The quantum discord of bipartite systems is one of the best-known measures of non-classical correlations and an important quantum resource. In the recent work appeared in [Phys. Rev. Lett 2020, 124:110401], the quantum discord has been…
Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum…
Coherence and entanglement are fundamental properties of quantum systems, promising to power the near future quantum computers, sensors and simulators. Yet, their experimental detection is challenging, usually requiring full reconstruction…
The topical quantum computation paradigm is a transposition of the Turing machine into the quantum framework. Implementations based on this paradigm have limitations as to the number of: qubits, computation steps, efficient quantum…
Here, we show that partial transposition, which is initially introduced to study entanglement, can also inspire many results on quantum discord including: (I) a discord criterion of spectrum invariant under partial transposition, stating…
We investigate quantum states that posses both maximum entanglement and maximum discord between the pertinent parties. Since entanglement (discord) is defined only for bipartite (two qubit) systems, we shall introduce an appropriate sum…
For any bipartite state, how strongly can one subsystem be quantum correlated with another? Using the Koashi-Winter relation, we study the upper bound of purified quantum discord, which is given by the sum of the von Neumann entropy of the…
The simple and universal global optimization method based on simplified multipopulation genetic algorithm is presented. The method is applied to quantum information problems. It is compared to the genetic algorithm on standard test…