Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Effective computation of quantum discord in a multiqubit spin chain

Andrey Yu. Chernyavskiy

Published Dec 30, 2016• 0 citations
Publisher

Abstract

Quantum discord is a non-classical correlation beyond quantum entanglement, which is a possible resource for quantum information technologies. The computation of quantum discord is a difficult problem due to the necessity of global optimization. We present the original semi-algebraic method for the effective computation of discord in the multi-qubit spin chain interacting with the impurity spin. We use the random mutations algorithm in a non-standard way: not for the minimization, but for the verification of inequalities. More specifically, we use it to check the constancy condition of the minimum of conditional entropy. After that, the discord can be calculated effectively by the algebraic procedures, and we construct the discord surface for different values of the structural parameter of the model. The considered approach for the verification of inequalities by global optimization algorithms can be used in a wide variety of applications, especially, in the theory of quantum correlations, which contains a lot of definitions based on minimums and maximums.

DOI
10.1117/12.2267102

Related papers

Bipartite quantum discord in a multiqubit spin chain

Andrey Yu. Chernyavskiy, Serge I. Doronin, Edward B. Fel’dman

For the first time, we compute the quantum discord in bipartite systems containing up to nine qubits. An analytical expression is obtained for the discord in a bipartite system with three qubits. The dependence of the discord on the temperature and the structural parameter of the model is studied.

Physica Scripta•Apr 1, 2014•10 citations

Calculation of quantum discord and entanglement measures using the random mutations optimization algorithm

Andrey Yu. Chernyavskiy

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 functions, and also tested on the calculation of quantum discord and minimal entanglement entropy, which is an entanglement measure for pure multipartite states.

arXiv:1304.3703•Apr 12, 2013•3 citations

Properties of quantum correlations in the Yang-Baxter spin-1/2 chain mode

Lidan Gou, Xiaoqian Wang

Quantum correlations among different parts of a composite quantum system are the fundamental resource of several applications in quantum information. In general, quantum discord can measure quantum correlations. In that way, the quantum correlations in the Yang-Baxter spin-1/2 chain mode are investigated. In the second part of the paper, the Yang-Baxter spin-1/2 chain modes are constructed from the Yang-Baxter equation. First, we analyze the two matrix representations of Temperly-Lieb algebra. Second, the two solutions of the Yang-Baxter equation are generated using the Yang-Baxterization. Finally, we can change the usual two-particle spin-1/2 chain to the Yang-Baxter spin-1/2 chain modes by means of the unitary Yang-Baxter matrix-R. In the third part, the density matrices of the two chain modes are generated in the thermal equilibrium state in a canonical ensemble. According to the definition of the geometric measure of quantum discord, the analytical expressions of the geometric measure of quantum discord, in the temperature and the external magnetic field, are obtained for the Yang-Baxter spin-1/2 chain modes. When the temperature and the magnetic field intensity increase, the geometric measure of quantum discord decreases. Under the specific conditions, the result of the second chain mode is similar to that of the first one. Then we obtain the numerical results of quantum discord, the geometric measure of quantum discord, and concurrence. It is found that the concurrence can quickly decrease to the value of zero when the temperature is greater than the value of one. At the same time, quantum discord and the geometric measure of quantum discord are not of the value of zero. Thus the quantum discord and the geometric measure of quantum discord can go beyond the concept of entanglement and obtain the “quantumness” of the correlations between the two parts of a system for the Yang-Baxter spin-1/2 chain modes. They are very good quantum resources for quantum information and quantum computing.

Acta Physica Sinica•Jan 1, 2015•1 citation

Global quantum discord in infinite quantum spin chains

Zhao‐Yu Sun, Yan-E Liao, Bin Guo +10 more

In this paper, we study global quantum discord (GQD) in infinite-size spin chains. For this purpose, in the framework of matrix product states (MPSs), we propose an effective procedure to calculate GQD (denoted as Gn) for consecutive n-site subchains in infinite chains. For a spin-1/2 three-body interaction model, whose ground state can be exactly expressed as MPSs, We use the procedure to study Gn with n up to $24$. Then for a spin-1/2 XXZ chain, we firstly use infinite time-evolving block decimation (iTEBD) algorithm to obtain the approximate wavefunction in the from of MPSs, and then figure out Gn with n up to $18$. In both models, Gn shows an interesting linear growth as the increase of n, that is, Gn = k*n+b. Moreover, in non-critical regions the slope $k$ of Gn converges very fast, while in critical regions it converges relatively slow, and the behaviors are explained in a clear physical picture with the short-range and long-range correlations. Based on these results, we propose to use Gn/n to describe the global correlations in infinite chains. Gn/n has twofold physical meanings. Firstly, it can be regarded as "global discord per site", very similar to "energy per site" or "magnetization per site" in quantum magnetic systems. Secondly, Gn/n (when n is large enough) describes the quantum correlation between a single site and an (n-1)-site block. Then we successfully apply our theory to an exactly soluble infinite-size spin XY chain which is beyond the matrix product formula, and the Hamiltonian can reduce to the transverse-field Ising model and the XX model. The relation between GQD and quantum phase transitions in these models is discussed.

arXiv:1412.5285•Dec 17, 2014•1 citation

QUANTUM DISCORD, DECOHERENCE AND QUANTUM PHASE TRANSITION

Indrani Bose, Amit Kumar Pal

Quantum discord is a more general measure of quantum correlations than entanglement and has been proposed as a resource in certain quantum information processing tasks. The computation of discord is mostly confined to two-qubit systems for which an analytical calculational scheme is available. The utilization of quantum correlations in quantum information-based applications is limited by the problem of decoherence, i.e., the loss of coherence due to the inevitable interaction of a quantum system with its environment. The dynamics of quantum correlations due to decoherence may be studied in the Kraus operator formalism for different types of quantum channels representing system-environment interactions. In this review, we describe the salient features of the dynamics of classical and quantum correlations in a two-qubit system under Markovian (memoryless) time evolution. The two-qubit state considered is described by the reduced density matrix obtained from the ground state of a spin model. The models considered include the transverse-field XY model in one dimension, a special case of which is the transverse-field Ising model, and the XXZ spin chain. The quantum channels studied include the amplitude damping, bit-flip, bit-phase-flip and phase-flip channels. The Kraus operator formalism is briefly introduced and the origins of different types of dynamics discussed. One can identify appropriate quantities associated with the dynamics of quantum correlations which provide signatures of quantum phase transitions in the spin models. Experimental observations of the different types of dynamics are also mentioned.

arXiv:1205.1300•International Journal of Modern Physics B•Oct 24, 2012•9 citations

Computing quantum discord is NP-complete

Yichen Huang

We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum discord in a quantum system of moderate size is not possible in practice. As by-products, some entanglement measures (namely entanglement cost, entanglement of formation, relative entropy of entanglement, squashed entanglement, classical squashed entanglement, conditional entanglement of mutual information, and broadcast regularization of mutual information) and constrained Holevo capacity are NP-hard/NP-complete to compute. These complexity-theoretic results are directly applicable in common randomness distillation, quantum state merging, entanglement distillation, superdense coding, and quantum teleportation; they may offer significant insights into quantum information processing. Moreover, we prove the NP-completeness of two typical problems: linear optimization over classical states and detecting classical states in a convex set, providing evidence that working with classical states is generically computationally intractable.

arXiv:1305.5941•New Journal of Physics•Mar 21, 2014•286 citations
Quantum discord is a non-classical correlation beyond quantum entanglement, which is a possible resource for quantum information technologies. The computation of quantum discord is a difficult problem due to the necessity of global optimization. We present the original semi-algebraic method for the effective computation of discord in the multi-qubit spin chain interacting with the impurity spin. We use the random mutations algorithm in a non-standard way: not for the minimization, but for the verification of inequalities. More specifically, we use it to check the constancy condition of the minimum of conditional entropy. After that, the discord can be calculated effectively by the algebraic procedures, and we construct the discord surface for different values of the structural parameter of the model. The considered approach for the verification of inequalities by global optimization algorithms can be used in a wide variety of applications, especially, in the theory of quantum correlations, which contains a lot of definitions based on minimums and maximums.
Quantum correlations among different parts of a composite quantum system are the fundamental resource of several applications in quantum information. In general, quantum discord can measure quantum correlations. In that way, the quantum correlations in the Yang-Baxter spin-1/2 chain mode are investigated. In the second part of the paper, the Yang-Baxter spin-1/2 chain modes are constructed from the Yang-Baxter equation. First, we analyze the two matrix representations of Temperly-Lieb algebra. Second, the two solutions of the Yang-Baxter equation are generated using the Yang-Baxterization. Finally, we can change the usual two-particle spin-1/2 chain to the Yang-Baxter spin-1/2 chain modes by means of the unitary Yang-Baxter matrix-R. In the third part, the density matrices of the two chain modes are generated in the thermal equilibrium state in a canonical ensemble. According to the definition of the geometric measure of quantum discord, the analytical expressions of the geometric measure of quantum discord, in the temperature and the external magnetic field, are obtained for the Yang-Baxter spin-1/2 chain modes. When the temperature and the magnetic field intensity increase, the geometric measure of quantum discord decreases. Under the specific conditions, the result of the second chain mode is similar to that of the first one. Then we obtain the numerical results of quantum discord, the geometric measure of quantum discord, and concurrence. It is found that the concurrence can quickly decrease to the value of zero when the temperature is greater than the value of one. At the same time, quantum discord and the geometric measure of quantum discord are not of the value of zero. Thus the quantum discord and the geometric measure of quantum discord can go beyond the concept of entanglement and obtain the “quantumness” of the correlations between the two parts of a system for the Yang-Baxter spin-1/2 chain modes. They are very good quantum resources for quantum information and quantum computing.
In this paper, we study global quantum discord (GQD) in infinite-size spin chains. For this purpose, in the framework of matrix product states (MPSs), we propose an effective procedure to calculate GQD (denoted as Gn) for consecutive n-site subchains in infinite chains. For a spin-1/2 three-body interaction model, whose ground state can be exactly expressed as MPSs, We use the procedure to study Gn with n up to 242424. Then for a spin-1/2 XXZ chain, we firstly use infinite time-evolving block decimation (iTEBD) algorithm to obtain the approximate wavefunction in the from of MPSs, and then figure out Gn with n up to 181818. In both models, Gn shows an interesting linear growth as the increase of n, that is, Gn = k*n+b. Moreover, in non-critical regions the slope kkk of Gn converges very fast, while in critical regions it converges relatively slow, and the behaviors are explained in a clear physical picture with the short-range and long-range correlations. Based on these results, we propose to use Gn/n to describe the global correlations in infinite chains. Gn/n has twofold physical meanings. Firstly, it can be regarded as "global discord per site", very similar to "energy per site" or "magnetization per site" in quantum magnetic systems. Secondly, Gn/n (when n is large enough) describes the quantum correlation between a single site and an (n-1)-site block. Then we successfully apply our theory to an exactly soluble infinite-size spin XY chain which is beyond the matrix product formula, and the Hamiltonian can reduce to the transverse-field Ising model and the XX model. The relation between GQD and quantum phase transitions in these models is discussed.
Quantum discord is a more general measure of quantum correlations than entanglement and has been proposed as a resource in certain quantum information processing tasks. The computation of discord is mostly confined to two-qubit systems for which an analytical calculational scheme is available. The utilization of quantum correlations in quantum information-based applications is limited by the problem of decoherence, i.e., the loss of coherence due to the inevitable interaction of a quantum system with its environment. The dynamics of quantum correlations due to decoherence may be studied in the Kraus operator formalism for different types of quantum channels representing system-environment interactions. In this review, we describe the salient features of the dynamics of classical and quantum correlations in a two-qubit system under Markovian (memoryless) time evolution. The two-qubit state considered is described by the reduced density matrix obtained from the ground state of a spin model. The models considered include the transverse-field XY model in one dimension, a special case of which is the transverse-field Ising model, and the XXZ spin chain. The quantum channels studied include the amplitude damping, bit-flip, bit-phase-flip and phase-flip channels. The Kraus operator formalism is briefly introduced and the origins of different types of dynamics discussed. One can identify appropriate quantities associated with the dynamics of quantum correlations which provide signatures of quantum phase transitions in the spin models. Experimental observations of the different types of dynamics are also mentioned.
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum discord in a quantum system of moderate size is not possible in practice. As by-products, some entanglement measures (namely entanglement cost, entanglement of formation, relative entropy of entanglement, squashed entanglement, classical squashed entanglement, conditional entanglement of mutual information, and broadcast regularization of mutual information) and constrained Holevo capacity are NP-hard/NP-complete to compute. These complexity-theoretic results are directly applicable in common randomness distillation, quantum state merging, entanglement distillation, superdense coding, and quantum teleportation; they may offer significant insights into quantum information processing. Moreover, we prove the NP-completeness of two typical problems: linear optimization over classical states and detecting classical states in a convex set, providing evidence that working with classical states is generically computationally intractable.