Quantum circuits with classically simulable operator scrambling

• URL: http://arxiv.org/abs/2002.12824v3
• Date: Mon, 20 Jul 2020 10:56:23 GMT
• Title: Quantum circuits with classically simulable operator scrambling
• Abstract summary: We introduce a new family of quantum circuits for which scrambling of a subspace of non-local operators is classically simulable. We call these circuits super-Clifford circuits', since the Heisenberg time evolution of these operators corresponds to a Clifford evolution in operator space.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a new family of quantum circuits for which the scrambling of a subspace of non-local operators is classically simulable. We call these circuits `super-Clifford circuits', since the Heisenberg time evolution of these operators corresponds to a Clifford evolution in operator space. By simulating the Clifford evolution in operator space we are able to simulate the time evolution of certain single Pauli strings into operators with an operator entanglement that grows linearly with the number of qubits. These circuits provide a new technique for studying scrambling in systems with a large number of qubits, and are an explicit counter example to the intuition that classical simulability implies the absence of scrambling.

Related papers

• Quantum Simulation of Strongly Correlated Fermion-Phonon Models in Circuit QED [33.77861374919934]
  Gate-based digital quantum simulations offer an exciting new paradigm for studying the many-body physics of strongly correlated systems.<n>We build quantum circuits for the Hubbard-Holstein and Yukawa-Sachdev-Ye-Kitaev models.<n>We develop measurement and variational protocols tailored to near-term superconducting quantum hardware.
  arXiv  Detail & Related papers  (2026-07-13T13:04:00Z)
• Quantum many-body operator cascade as a route to chaos [0.0]
  We show that the slowest-decaying operators have a nontrivial fractal dimension quantifying their non-locality.<n>We find that unitarity imposes a constraint, i.e., an (approximate) equality, between the temporal decay rate of local correlations and this spatial operator fractal dimension.
  arXiv  Detail & Related papers  (2026-04-17T21:47:40Z)
• Towards Quantum Machine Learning of Lattice Boltzmann Collision Operators for Fluid Dynamic Simulations [0.0]
  We use a modified amplitude encoding to bypass the renormalization that would have required classical processing at every step.<n>We describe the hard-wiring of the lattice Boltzmann symmetries into the quantum circuit and show that, for the specific case of the cavity flow, approximating the nonlinear system is limited to low velocities.
  arXiv  Detail & Related papers  (2025-12-30T05:15:56Z)
• Non-linear cooling and control of a mechanical quantum harmonic oscillator [30.5491665195957]
  We show how to generate localized multi (2, 3, 4, and 5)-component Schr"odinger's cat manifold.<n>To our knowledge, our work is the first experimental use of such high order non-linear processes for control of non-classical states.
  arXiv  Detail & Related papers  (2025-09-06T14:47:54Z)
• Random Permutation Circuits are Quantum Chaotic [0.0]
  We study the time evolution of local operator entanglement (LOE) in random permutation circuits.<n>Our findings highlight that quantum chaos can be produced by essentially classical dynamics.
  arXiv  Detail & Related papers  (2025-08-14T17:57:10Z)
• Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure [49.1574468325115]
  We propose and analyze use cases that come from quantum circuits that can be written as product between a Clifford and a Non-Clifford unitary. We make use of ZX-Calculus and its assets to detect a limiting border of these circuits that would allow for a separation between a Clifford section and a Non-Clifford section.
  arXiv  Detail & Related papers  (2025-04-22T16:10:34Z)
• Fast Scrambling in Classically Simulable Quantum Circuits [0.0]
  We study operator scrambling in quantum circuits built from super-Clifford' gates. In addition to operator entanglement, certain out-of-time ordered correlation functions (OTOCs) can be classically simulated within the same formalism.
  arXiv  Detail & Related papers  (2024-10-25T15:05:35Z)
• Disentangling unitary dynamics with classically simulable quantum circuits [0.0]
  We study both quantum circuit and Hamiltonian dynamics. We find that expectations of Pauli operators can be simulated efficiently even for deep Clifford circuits. For the Hamiltonian dynamics we find that the classical simulation generically quickly becomes inefficient.
  arXiv  Detail & Related papers  (2024-10-11T17:18:26Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• On Classical Simulation of Quantum Circuits Composed of Clifford Gates [0.0]
  The Gottesman-Knill theorem asserts that quantum circuits composed solely of Clifford gates can be efficiently simulated classically. In this work, we break down the step-by-step procedure of the Gottesman-Knill theorem in a beginner-friendly manner.
  arXiv  Detail & Related papers  (2024-05-22T12:36:15Z)
• Hysteresis and Self-Oscillations in an Artificial Memristive Quantum Neuron [79.16635054977068]
  We study an artificial neuron circuit containing a quantum memristor in the presence of relaxation and dephasing. We demonstrate that this physical principle enables hysteretic behavior of the current-voltage characteristics of the quantum device.
  arXiv  Detail & Related papers  (2024-05-01T16:47:23Z)
• Unified framework for efficiently computable quantum circuits [0.0]
  Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure that allows these circuits can be efficiently simulatable.
  arXiv  Detail & Related papers  (2024-01-16T08:04:28Z)
• Quantum information spreading in generalised dual-unitary circuits [44.99833362998488]
  We show that local operators spread at the speed of light as in dual-unitary circuits. We use these properties to find a closed-form expression for the entanglement membrane in these circuits.
  arXiv  Detail & Related papers  (2023-12-05T18:09:27Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• Crystalline Quantum Circuits [0.0]
  Random quantum circuits continue to inspire a wide range of applications in quantum information science and many-body quantum physics. Motivated by an interest in deterministic circuits with similar applications, we construct classes of textitnonrandom unitary Clifford circuits. A full classification on the square lattice reveals, of particular interest, a "nonfractal good scrambling class" with dense operator spreading.
  arXiv  Detail & Related papers  (2022-10-19T18:00:57Z)
• Entanglement dynamics of spins using a few complex trajectories [77.34726150561087]
  We consider two spins initially prepared in a product of coherent states and study their entanglement dynamics. We adopt an approach that allowed the derivation of a semiclassical formula for the linear entropy of the reduced density operator.
  arXiv  Detail & Related papers  (2021-08-13T01:44:24Z)
• Probing Operator Spreading via Floquet Engineering in a Superconducting Circuit [18.17297057914507]
  Floquet engineering provides an effective way to tune the coupling strength between nearby qubits. A clear light-cone-like operator propagation is observed in the system with multiple excitations. For the butterfly operator that is nonlocal (local) under the Jordan-Wigner transformation, the OTOCs show distinct behaviors.
  arXiv  Detail & Related papers  (2021-08-03T03:46:23Z)
• 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)
• Quantum Simulation of Light-Front Parton Correlators [0.0]
  The physics of high-energy colliders relies on the knowledge of non-perturbative parton correlators. We propose a quantum algorithm to perform a quantum simulation of these type of correlators.
  arXiv  Detail & Related papers  (2020-11-02T19:38:33Z)
• 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.