Related papers: Computing quantum discord is NP-complete
Quantum discord and quantum entanglement are resources in some quantum information processing (QIP) models. However, in recent years, the evidence that separable states or classically correlated states can also accomplish QIP is…
Quantum coherence is a prime resource in quantum computing and quantum communication. Quantum coherence of an arbitrary qubit state can be created at a remote location using maximally entangled state, local operation and classical…
Classical-quantum computational complexity separations are an important motivation for the long-term development of digital quantum computers, but classical-quantum complexity equivalences are just as important in our present era of noisy…
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm…
We build a machine learning model to detect correlations in a three-qubit system using a neural network trained in an unsupervised manner on randomly generated states. The network is forced to recognize separable states, and correlated…
We propose a scheme to evaluate the amount of quantum discord and entanglement of formation for mixed states, and reveal their ordering relation via an intrinsic relationship between the two quantities distributed in different partners of…
The aim of this dissertation is to clarify the debate over the explanation of quantum speedup and to submit a tentative resolution to it. In particular, I argue that the physical explanation for quantum speedup is precisely the fact that…
We investigate the dynamics of quantum discord and entanglement for a class of mixed qubit-qutrit states assuming that only the qutrit is under the action of a dephasing channel. We demonstrate that even though the entanglement in the…
The last two decades have witnessed a rapid development of quantum information processing, a new paradigm which studies the power and limit of "quantum advantages" in various information processing tasks. Problems such as when quantum…
Recent experimental achievements motivate an ever-growing interest from companies starting to feel the limitations of classical computing. Yet, in light of ongoing privacy scandals, the future availability of quantum computing through…
This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…
We analyse the use of entangled states to perform quantum computations non locally among distant nodes in a quantum network. The complexity associated with the generation of multiparticle entangled states is quantified in terms of the…
The precise quantification of the ultimate efficiency in manipulating quantum resources lies at the core of quantum information theory. However, purely information-theoretic measures fail to capture the actual computational complexity…
Entanglement is a Hilbert-space based measure of nonseparability of states that leads to unique quantum possibilities such as teleportation. It has been at the center of intense activity in the area of quantum information theory and…
In a distributed quantum computer scalability is accomplished by networking together many elementary nodes. Typically the network is optical and inter-node entanglement involves photon detection. In complex networks the entanglement…
Entanglement is the key resource for quantum technologies and is at the root of exciting many-body phenomena. However, quantifying the entanglement between two parts of a real-world quantum system is challenging when it interacts with its…
High-dimensional quantum systems are vital for quantum technologies and are essential in demonstrating practical quantum advantage in quantum computing, simulation and sensing. Since dimensionality grows exponentially with the number of…
We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted.…
Though the theory of quantum error correction is intimately related to the classical coding theory, in particular, one can construct quantum error correction codes (QECCs) from classical codes with the dual containing property, this does…
The problem of deciding whether a set of quantum measurements is jointly measurable is known to be equivalent to determining whether a quantum assemblage is unsteerable. This problem can be formulated as a semidefinite program (SDP).…