Coherence vectors and correlation matrices are important functions frequently used in physics. The numerical calculation of these functions directly from their definitions, which involves Kronecker products and matrix multiplications, may seem to be a reasonable option. Notwithstanding, as we demonstrate in this paper, some algebraic manipulations before programming can reduce considerably their computational complexity. Besides, we provide Fortran code to generate generalized Gell-Mann matrices and to compute the optimized and unoptimized versions of associated Bloch’s vectors and correlation matrix in the case of bipartite quantum systems. As a code test and application example, we consider the calculation of Hilbert-Schmidt quantum discords.
Coherence vectors and correlation matrices are important functions frequently used in physics. The numerical calculation of these functions directly from their definitions, which involves Kronecker products and matrix multiplications, may seem to be a reasonable option. Notwithstanding, as we demonstrate in this paper, some algebraic manipulations before programming can reduce considerably their computational complexity. Besides, we provide Fortran code to generate generalized Gell-Mann matrices and to compute the optimized and unoptimized versions of associated Bloch’s vectors and correlation matrix in the case of bipartite quantum systems. As a code test and application example, we consider the calculation of Hilbert-Schmidt quantum discords.
Quantum discord, a kind of quantum correlation, is defined as the difference between quantum mutual information and classical correlation in a bipartite system. It has been discussed so far for small systems with only a few independent parameters. We extend here to a much broader class of states when the second party is of arbitrary dimension d, so long as the first, measured, party is a qubit. We present two formulae to calculate quantum discord, the first relating to the original entropic definition and the second to a recently proposed geometric distance measure which leads to an analytical formulation. The tracing over the qubit in the entropic calculation is reduced to a very simple prescription. And, when the d-dimensional system is a so-called X state, the density matrix having non-zero elements only along the diagonal and anti-diagonal so as to appear visually like the letter X, the entropic calculation can be carried out analytically. Such states of the full bipartite qubit-qudit system may be named "extended X states", whose density matrix is built of four block matrices, each visually appearing as an X. The optimization involved in the entropic calculation is generally over two parameters, reducing to one for many cases, and avoided altogether for an overwhelmingly large set of density matrices as our numerical investigations demonstrate. Our results also apply to states of a N-qubit system, where "extended X states" consist of (2^(N+2) - 1) states, larger in number than the (2^(N+1) - 1) of X states of N qubits. While these are still smaller than the total number (2^(2N) - 1) of states of N qubits, the number of parameters involved is nevertheless large. In the case of N = 2, they encompass the entire 15-dimensional parameter space, that is, the extended X states for N = 2 represent the full qubit-qubit system.
A recursive approach to determine the Hilbert–Schmidt measure of pairwise quantum discord in a special class of symmetric states of k qubits is presented. We especially focus on the reduced states of k qubits obtained from a balanced superposition of symmetric n-qubit states (multiqubit Schrödinger cat states) by tracing out n-k particles (k = 2, 3, …, n-1). Two pairing schemes are considered. In the first one, the geometric discord measuring the correlation between one qubit and the parity grouping (k-1) qubits is explicitly derived. This uses recursive relations between the Fano–Bloch correlation matrices associated with subsystems comprising k, k-1, … and two particles. A detailed analysis is given for two-, three- and four-qubit systems. In the second scheme, the subsystem comprising the (k-1) qubits is mapped into a system of two logical qubits. We show that these two bipartition schemes are equivalents in evaluating the pairwise correlation in multiqubits systems. The explicit expressions of classical states presenting zero discord are derived.
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.
It is known that a reliable geometric quantifier of discord-like correlations can be built by employing the so-called trace distance. This is used to measure how far the state under investigation is from the closest "classical-quantum" one. To date, the explicit calculation of this indicator for two qubits was accomplished only for states such that the reduced density matrix of the measured party is maximally mixed, a class that includes Bell-diagonal states. Here, we first reduce the required optimization for a general two-qubit state to the minimization of an explicit two-variable function. Using this framework, we show next that the minimum can be analytically worked out in a number of relevant cases including quantum-classical and X states. This provides an explicit and compact expression for the trace distance discord of an arbitrary state belonging to either of these important classes of density matrices.
We investigate the disappearance of discord in 2- and multi-qubit systems subject to decohering influences. We formulate the computation of quantum discord and quantum geometric discord in terms of the generalized Bloch vector, which gives useful insights on the time evolution of quantum coherence for the open system, particularly the comparison of entanglement and discord. We show that the analytical calculation of the global geometric discord is NP-hard in the number of qubits, but a similar statement for global entropic discord is more difficult to prove. We present an efficient numerical method to calculating the quantum discord for a certain important class of multipartite states. In agreement with previous work for 2-qubit cases (Mazzola et al 2010 Phys. Rev. Lett. 104 200401), we find situations in which there is a sudden transition from classical to quantum decoherence characterized by the discord remaining relatively robust (classical decoherence) until a certain point from where it begins to decay quickly whereas the classical correlation decays more slowly (quantum decoherence). However, we find that as the number of qubits increases, the chance of this kind of transition occurring becomes small.
Given its widespread application in machine learning and optimization, the Kronecker product emerges as a pivotal linear algebra operator. However, its computational demands render it an expensive operation, leading to heightened costs in spectral approximation of it through traditional computation algorithms. Existing classical methods for spectral approximation exhibit a linear dependency on the matrix dimension denoted by n, considering matrices of size A1∈Rn×d and A2∈Rn×d. Our work introduces an innovative approach to efficiently address the spectral approximation of the Kronecker product A1⊗A2 using quantum methods. By treating matrices as quantum states, our proposed method significantly reduces the time complexity of spectral approximation to Od,ε(n).