Quantum simulation of operator spreading in the chaotic Ising model

Quantum Algorithms for Testing Hamiltonian Symmetry

“…Quantum Simulations of Hamiltonians-Quantum simulations provide a method for implementing Hamiltonian dynamics on quantum computers, usually by approximating them as sequences of quantum logic gates [12,13]. Much work has been conducted in this field, including work on implementations on near-term hardware [17,25], simulation by qubitization [26], simulation of operator spread [27], and more. Here, we review an example implementation.…”

Quantum Criticality Using a Superconducting Quantum Processor

“…We bypass this obstacle by leveraging a dynamically-driven phenomenon to access quantum criticality, the Kibble-Zurek (KZ) mechanism [10,11]. NISQ processors have proven to be well-suited in simulating quantum dynamics [12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][30], as the time-evolution is a unitary operation that can be straightforwardly translated into a shallow quantum circuit in most cases. The KZ mechanism is triggered by time-evolving a system from a point A to a point B of its phase diagram at a given rate ∼ 𝑇 −1 , with the transition happening somewhere on the way.…”

Benchmarking Information Scrambling

“…This approach uses two copies of the system and an entangled input state (Bell state) between the copies, requiring sophisticated engineering of the system and therefore hindering its practical applications. More recently, the field has witnessed an increasing number of studies of information scrambling in various experimental platforms, e.g., superconductors [29], trapped-ions [25], and cloud-based quantum computers [30][31][32]. However, it remains a challenge to design a simple and robust protocol for benchmarking the true signals of scrambling from a noisy background.…”