We express the positive-partial-transpose (PPT) separability criterion for symmetric states of multiqubit systems in terms of matrix inequalities based on the recently introduced tensor representation for spin states. We construct a matrix from the tensor representation of the state and show that it is similar to the partial transpose of the density matrix written in the computational basis. Furthermore, the positivity of this matrix is equivalent to the positivity of a correlation matrix constructed from tensor products of Pauli operators. This allows for a more transparent experimental interpretation of the PPT criteria for an arbitrary spin- $j$ state. The unitary matrices connecting our matrix to the partial transpose of the state generalize the so-called magic basis that plays a central role in Wootters' explicit formula for the concurrence of a two-qubit system and the Bell bases used for the teleportation of a one- or two-qubit state.We express the positive-partial-transpose (PPT) separability criterion for symmetric states of multiqubit systems in terms of matrix inequalities based on the recently introduced tensor representation for spin states. We construct a matrix from the tensor representation of the state and show that it is similar to the partial transpose of the density matrix written in the computational basis. Furthermore, the positivity of this matrix is equivalent to the positivity of a correlation matrix constructed from tensor products of Pauli operators. This allows for a more transparent experimental interpretation of the PPT criteria for an arbitrary spin-$j$ state. The unitary matrices connecting our matrix to the partial transpose of the state generalize the so-called magic basis that plays a central role in Wootters' explicit formula for the concurrence of a two-qubit system and the Bell bases used for the teleportation of a one- or two-qubit state.

arXiv:1606.07635Physical Review AOct 31, 201628 citations

Tensor Operators and Reduced Matrix Elements

Springer eBooksJan 1, 20020 citations

Tensor Representations and Tensor Operators

Ilya G. Kaplan

Elsevier eBooksJan 1, 19750 citations

On the Matrix Representation of Quantum Operations

Yoshihiro Nambu, Kazuo Torii Nakamura

This paper considers two frequently used matrix representations -- what we call the $χ$ - and $\mathcal{S}$ -matrices -- of a quantum operation and their applications. The matrices defined with respect to an arbitrary operator basis, that is, the orthonormal basis for the space of linear operators on the state space are considered for a general operation acting on a single or two \textit{d}-level quantum system (qudit). We show that the two matrices are given by the expansion coefficients of the Liouville superoperator as well as the associated bijective, positive operator on the doubled-space defined with respect to two types of induced operator basis having different tensor product structures, i.e., Kronecker products of the relevant operator basis and dyadic products of the associated bipartite state basis. The explicit conversion formulas between the two matrices are established as a computable matrix multiplication. Extention to more qudits case is trivial. Several applications of these matrices and the conversion formulas in quantum information science and technology are presented.This paper considers two frequently used matrix representations -- what we call the $χ$- and $\mathcal{S}$-matrices -- of a quantum operation and their applications. The matrices defined with respect to an arbitrary operator basis, that is, the orthonormal basis for the space of linear operators on the state space are considered for a general operation acting on a single or two \textit{d}-level quantum system (qudit). We show that the two matrices are given by the expansion coefficients of the Liouville superoperator as well as the associated bijective, positive operator on the doubled-space defined with respect to two types of induced operator basis having different tensor product structures, i.e., Kronecker products of the relevant operator basis and dyadic products of the associated bipartite state basis. The explicit conversion formulas between the two matrices are established as a computable matrix multiplication. Extention to more qudits case is trivial. Several applications of these matrices and the conversion formulas in quantum information science and technology are presented.

arXiv:quant-ph/0504091Apr 12, 20053 citations

Fast generation of Pauli transfer matrices utilizing tensor product structure

Lukas Hantzko, Lennart Binkowski, Sabhyata Gupta

Abstract Analysis of quantum processes, especially in the context of noise, errors, and decoherence is essential for the improvement of quantum devices. An intuitive representation of those processes modeled by quantum channels are Pauli transfer matrices. They display the action of a linear map in the n-qubit Pauli basis in a way, that is more intuitive, since Pauli strings are more tangible objects than the standard basis matrices. We set out to investigate classical algorithms that convert the various representations into Pauli transfer matrices. We propose new algorithms that make explicit use of the tensor product structure of the Pauli basis. They convert a quantum channel in a given representation (Chi or process matrix, Choi matrix, superoperator, or Kraus operators) to the corresponding Pauli transfer matrix. Moreover, the underlying principle can also be used to calculate the Pauli transfer matrix of other linear operations over n-qubit matrices such as left-, right-, and sandwich multiplication as well as forming the (anti-)commutator with a given operator. Finally, we investigate the runtime of these algorithms, derive their asymptotic scaling and demonstrate improved performance using instances with up to seven qubits.Abstract Analysis of quantum processes, especially in the context of noise, errors, and decoherence is essential for the improvement of quantum devices. An intuitive representation of those processes modeled by quantum channels are Pauli transfer matrices. They display the action of a linear map in the n-qubit Pauli basis in a way, that is more intuitive, since Pauli strings are more tangible objects than the standard basis matrices. We set out to investigate classical algorithms that convert the various representations into Pauli transfer matrices. We propose new algorithms that make explicit use of the tensor product structure of the Pauli basis. They convert a quantum channel in a given representation (Chi or process matrix, Choi matrix, superoperator, or Kraus operators) to the corresponding Pauli transfer matrix. Moreover, the underlying principle can also be used to calculate the Pauli transfer matrix of other linear operations over n-qubit matrices such as left-, right-, and sandwich multiplication as well as forming the (anti-)commutator with a given operator. Finally, we investigate the runtime of these algorithms, derive their asymptotic scaling and demonstrate improved performance using instances with up to seven qubits.

arXiv:2411.00526Physica ScriptaJun 26, 20254 citations

j

state. The unitary matrices connecting our matrix to the partial transpose of the state generalize the so-called magic basis that plays a central role in Wootters' explicit formula for the concurrence of a two-qubit system and the Bell bases used for the teleportation of a one- or two-qubit state.

This paper considers two frequently used matrix representations -- what we call the

χ

- and

\mathcal{S}

-matrices -- of a quantum operation and their applications. The matrices defined with respect to an arbitrary operator basis, that is, the orthonormal basis for the space of linear operators on the state space are considered for a general operation acting on a single or two \textit{d}-level quantum system (qudit). We show that the two matrices are given by the expansion coefficients of the Liouville superoperator as well as the associated bijective, positive operator on the doubled-space defined with respect to two types of induced operator basis having different tensor product structures, i.e., Kronecker products of the relevant operator basis and dyadic products of the associated bipartite state basis. The explicit conversion formulas between the two matrices are established as a computable matrix multiplication. Extention to more qudits case is trivial. Several applications of these matrices and the conversion formulas in quantum information science and technology are presented.