Quantum and Classical Dynamics with Random Permutation Circuits

• URL: http://arxiv.org/abs/2407.11960v1
• Date: Tue, 16 Jul 2024 17:58:03 GMT
• Title: Quantum and Classical Dynamics with Random Permutation Circuits
• Authors: Bruno Bertini, Katja Klobas, Pavel Kos, Daniel Malz,
• Abstract summary: We study whether thermalisation in quantum many-body systems is fundamentally different from that in classical many-body systems. We introduce a class of random permutation circuits (RPCs), where the gates locally permute basis states modelling generic microscopic classical dynamics. We show that, like RUCs, RPCs permit the analytical computation of several key quantities such as out-of-time order correlators (OTOCs) or entanglement entropies.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Understanding thermalisation 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 thermalisation 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 which are only constrained to have local interactions, i.e. local random circuits. We introduce a class of random permutation circuits (RPCs), where the gates locally permute basis states modelling generic microscopic classical dynamics, and compare them to random unitary circuits (RUCs), a standard toy model for generic quantum dynamics. We show that, like RUCs, RPCs permit the analytical computation of several key quantities such as out-of-time order correlators (OTOCs), or entanglement entropies. RPCs can be interpreted both as quantum or classical dynamics, which we use to find similarities and differences between the two. Performing the average over all random circuits, we discover a series of exact relations, connecting quantities in RUC and (quantum) RPCs. In the classical setting, we obtain similar exact results relating (quantum) purity to (classical) growth of mutual information and (quantum) OTOCs to (classical) decorrelators. Our results indicate that despite of the fundamental differences between quantum and classical systems, their dynamics exhibits qualitatively similar behaviours.

Related papers

• Markovian dynamics for a quantum/classical system and quantum trajectories [0.0]
  We develop a general approach to the dynamics of quantum/classical systems. An important feature is that, if the interaction allows for a flow of information from the quantum component to the classical one, necessarily the dynamics is dissipative.
  arXiv  Detail & Related papers  (2024-03-24T08:26:54Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Quantum Lyapunov exponent in dissipative systems [68.8204255655161]
  The out-of-time order correlator (OTOC) has been widely studied in closed quantum systems. We study the interplay between these two processes. The OTOC decay rate is closely related to the classical Lyapunov.
  arXiv  Detail & Related papers  (2022-11-11T17:06:45Z)
• Effective field theory of random quantum circuits [0.0]
  This work develops an effective field theory for a large class of random quantum circuits. The method is used to explicitly derive universal random matrix behavior of a large family of random circuits.
  arXiv  Detail & Related papers  (2022-04-06T21:03:46Z)
• Oracle separations of hybrid quantum-classical circuits [68.96380145211093]
  Two models of quantum computation: CQ_d and QC_d. CQ_d captures the scenario of a d-depth quantum computer many times; QC_d is more analogous to measurement-based quantum computation. We show that, despite the similarities between CQ_d and QC_d, the two models are intrinsically, i.e. CQ_d $nsubseteq$ QC_d and QC_d $nsubseteq$ CQ_d relative to an oracle.
  arXiv  Detail & Related papers  (2022-01-06T03:10:53Z)
• Quantum-classical entropy analysis for nonlinearly-coupled continuous-variable bipartite systems [0.0]
  We investigate the behavior of classical analogs arising upon the removal of interference traits. By comparing the quantum and classical entropy values, it is shown that, instead of entanglement production, such entropies rather provide us with information.
  arXiv  Detail & Related papers  (2021-11-19T11:39:15Z)
• Quantum and classical temporal correlations in $(1 + 1)D$ Quantum Cellular Automata [0.0]
  We study entanglement and coherence near criticality in quantum systems that display non-equilibrium steady-state phase transitions. Our analysis is based on quantum generalizations of classical non-equilibrium systems.
  arXiv  Detail & Related papers  (2021-04-09T09:58:42Z)
• The principle of majorization: application to random quantum circuits [68.8204255655161]
  Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. We verified that all the families of circuits satisfy on average the principle of majorization. Clear differences appear in the fluctuations of the Lorenz curves associated to states.
  arXiv  Detail & Related papers  (2021-02-19T16:07:09Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• From classical to quantum walks with stochastic resetting on networks [0.0]
  We study classical and quantum random walks under the influence of resetting on arbitrary networks. Based on the mathematical formalism of quantum walks, we provide a framework of classical and quantum walks.
  arXiv  Detail & Related papers  (2020-08-02T16:10:31Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.