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

arXiv:1801.00292 · Quantum Information Processing

Transfer of scaled multiple-quantum coherence matrices

G. A. Bochkin, Edward B. Fel’dman, Alexander Ivanovich Zenchuk

Published Jul 19, 2018• 10 citations
arXivHTMLPDF
DOI
10.1007/s11128-018-1982-y

Related papers

Evolution of multiple quantum coherences with scaled dipolar Hamiltonian

Claudia M. Sánchez, L. Buljubasich, Horacio M. Pastawski +1 more

Journal of Magnetic Resonance•May 20, 2017•3 citations

Multiple Quantum Coherence

Charles P. Slichter

Springer series in solid-state sciences•Jan 1, 1990•2 citations

Restoring of quantum state transferred along XY-spin chain and entanglement evolution

N. A. Tashkeev, Alexander Ivanovich Zenchuk

We propose a protocol restoring the state transferred along the spin chain governed by the XY-Hamiltonian. Such dynamics does not preserve the excitation number and leads to mixing multiple-quantum coherence matrices of orders having the same parities. Depending on the initial state, this results in generating either all possible or only even-order multiple-quantum coherence matrices. Restoring is established via the special unitary transformation applied to the receiver side of the chain (extended receiver). An example of restoring [Formula: see text]- and [Formula: see text]-order coherence matrices in two-qubit state transfer is considered. Entanglement transfer in such process is also studied and possibility of its amplification is demonstrated.

arXiv:2504.15832•International Journal of Quantum Information•Apr 10, 2025•0 citations

Transfer of scaled MQ-coherence matrices

G. A. Bochkin, Alexander Ivanovich Zenchuk

We show that quantum states of a certain structure can be transferred from the sender to the receiver without mixing the matrix elements. The only effect of such a state transfer is scaling { of the} certain blocks (MQ-coherence matrices) of the transferred matrix. In addition, equal scaling of these blocks is also possible. We consider the transfer of two-qubit states along a homogeneous spin-1/2 chain and find the states admitting perfect transfer of their zero-order coherence matrices.

•Dec 31, 2017•0 citations

Multiple quantum coherences experiment, simulations and applications

Arman Kussainov

•Nov 20, 2008•0 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.

arXiv:2411.00526•Physica Scripta•Jun 26, 2025•9 citations
We propose a protocol restoring the state transferred along the spin chain governed by the XY-Hamiltonian. Such dynamics does not preserve the excitation number and leads to mixing multiple-quantum coherence matrices of orders having the same parities. Depending on the initial state, this results in generating either all possible or only even-order multiple-quantum coherence matrices. Restoring is established via the special unitary transformation applied to the receiver side of the chain (extended receiver). An example of restoring [Formula: see text]- and [Formula: see text]-order coherence matrices in two-qubit state transfer is considered. Entanglement transfer in such process is also studied and possibility of its amplification is demonstrated.
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.