Understanding thermalization in quantum many-body systems is among the most enduring problems in modern physics. A particularly interesting question concerns the role played by quantum mechanics in this process, i.e., whether thermalization in quantum many-body systems is fundamentally different from that in classical many-body systems and, if so, which of its features are genuinely quantum. Here, we study this question in minimally structured many-body systems that are only constrained to have local interactions, i.e., local random circuits. In particular, we introduce random permutation circuits (RPCs), which are circuits comprising gates that locally permute basis states, as a counterpart to random unitary circuits (RUCs), a standard toy model for generic quantum dynamics. RPCs represent a model for generic microscopic classical reversible dynamics but, interestingly, can be interpreted both as classical or as quantum dynamics. We show that, upon averaging over all circuit realizations, RPCs permit the analytical computation of several key quantities such as out-of-time-order correlators (OTOCs) and entanglement entropies. In the classical setting, we obtain similar exact results relating (quantum) purity to (classical) growth of mutual information and (quantum) OTOCs to (classical) decorrelators. We, thus, discover a series of exact relations, connecting quantities in RUC and (quantum or classical) RPCs. Our results indicate that, despite the fundamental differences between quantum and classical systems, their many-body dynamics exhibits remarkably similar behaviors.Understanding thermalization in quantum many-body systems is among the most enduring problems in modern physics. A particularly interesting question concerns the role played by quantum mechanics in this process, i.e., whether thermalization in quantum many-body systems is fundamentally different from that in classical many-body systems and, if so, which of its features are genuinely quantum. Here, we study this question in minimally structured many-body systems that are only constrained to have local interactions, i.e., local random circuits. In particular, we introduce random permutation circuits (RPCs), which are circuits comprising gates that locally permute basis states, as a counterpart to random unitary circuits (RUCs), a standard toy model for generic quantum dynamics. RPCs represent a model for generic microscopic classical reversible dynamics but, interestingly, can be interpreted both as classical or as quantum dynamics. We show that, upon averaging over all circuit realizations, RPCs permit the analytical computation of several key quantities such as out-of-time-order correlators (OTOCs) and entanglement entropies. In the classical setting, we obtain similar exact results relating (quantum) purity to (classical) growth of mutual information and (quantum) OTOCs to (classical) decorrelators. We, thus, discover a series of exact relations, connecting quantities in RUC and (quantum or classical) RPCs. Our results indicate that, despite the fundamental differences between quantum and classical systems, their many-body dynamics exhibits remarkably similar behaviors.

arXiv:2407.11960Physical Review XJan 28, 202510 citations

Constructing Quantum Circuits for Unitary Operations

Joanna Wiśniewska

Jan 1, 20110 citations

Quantum Combinational Circuits

Hafiz Md. Hasan Babu

Springer eBooksJan 1, 20250 citations

New Permutation-Free Quantum Circuits for Implementing 3- and 4-Qubit Unitary Operations

Artyom M. Grigoryan

The article presents the quantum signal-induced heap transform (QsiHT) method of the QR-decomposition of multi-qubit operations. This transform can be generated by a given signal, by using different paths, or orders, of processing the data. We propose using the concept of the fast path of calculation of the QsiHT and applying such transforms on each stage of the matrix decomposition. This allows us to build quantum circuits for multi-qubit unitary operation without permutations. Unitary operations with real and complex matrices are considered. The cases of 3- and 4-qubit operations are described in detail with quantum circuits. These circuits use a maximum of 28 and 120 Givens rotation gates for 3- and 4-qubit real operations, respectively. All rotations are performing only on adjacent bit planes. For complex unitary operation, each of the Givens gates is used in pairs with two Z-rotation gates. These two types of rotations and the global phase gate are the universal gate set for multi-qubit operations. The presented approach can be used for implementing quantum circuits for n-qubits when n≥2, with a maximum of (4n/2−2n−1) Givens rotations and no permutations.The article presents the quantum signal-induced heap transform (QsiHT) method of the QR-decomposition of multi-qubit operations. This transform can be generated by a given signal, by using different paths, or orders, of processing the data. We propose using the concept of the fast path of calculation of the QsiHT and applying such transforms on each stage of the matrix decomposition. This allows us to build quantum circuits for multi-qubit unitary operation without permutations. Unitary operations with real and complex matrices are considered. The cases of 3- and 4-qubit operations are described in detail with quantum circuits. These circuits use a maximum of 28 and 120 Givens rotation gates for 3- and 4-qubit real operations, respectively. All rotations are performing only on adjacent bit planes. For complex unitary operation, each of the Givens gates is used in pairs with two Z-rotation gates. These two types of rotations and the global phase gate are the universal gate set for multi-qubit operations. The presented approach can be used for implementing quantum circuits for n-qubits when n≥2, with a maximum of (4n/2−2n−1) Givens rotations and no permutations.

InformationJul 21, 20254 citations

OptQC: An optimised parallel quantum compiler

T. Loke, J. B. Wang

The software package \emph{Qcompiler} (CPC, 184 (2013) 853) provides a general quantum compilation framework, which maps any given unitary operation into a quantum circuit consisting of a sequential set of elementary quantum gates. In this paper, we present an extended software \emph{OptQC}, which finds permutation matrices $P$ and $Q$ for a given unitary matrix $U$ such that the number of gates in the quantum circuit of $U = Q^TP^TU'PQ$ is significantly reduced, where $U'$ is equivalent to $U$ up to a permutation and the quantum circuit implementation of each matrix component is considered separately. We extend further this software package to make use of high-performance computers with a multiprocessor architecture using MPI. We demonstrate its effectiveness in reducing the total number of quantum gates required for various unitary operators.The software package \emph{Qcompiler} (CPC, 184 (2013) 853) provides a general quantum compilation framework, which maps any given unitary operation into a quantum circuit consisting of a sequential set of elementary quantum gates. In this paper, we present an extended software \emph{OptQC}, which finds permutation matrices $P$ and $Q$ for a given unitary matrix $U$ such that the number of gates in the quantum circuit of $U = Q^TP^TU'PQ$ is significantly reduced, where $U'$ is equivalent to $U$ up to a permutation and the quantum circuit implementation of each matrix component is considered separately. We extend further this software package to make use of high-performance computers with a multiprocessor architecture using MPI. We demonstrate its effectiveness in reducing the total number of quantum gates required for various unitary operators.

arXiv:1408.1612Aug 7, 20140 citations

Quantum Circuits and Computation

François Chapeau‐Blondeau

Springer eBooksJan 1, 20260 citations

P

and

Q

for a given unitary matrix

U

such that the number of gates in the quantum circuit of

U = Q^TP^TU'PQ

is significantly reduced, where

U'

is equivalent to

U

up to a permutation and the quantum circuit implementation of each matrix component is considered separately. We extend further this software package to make use of high-performance computers with a multiprocessor architecture using MPI. We demonstrate its effectiveness in reducing the total number of quantum gates required for various unitary operators.