Simulating Floquet scrambling circuits on trapped-ion quantum computers
- URL: http://arxiv.org/abs/2405.07613v3
- Date: Mon, 14 Apr 2025 01:58:02 GMT
- Title: Simulating Floquet scrambling circuits on trapped-ion quantum computers
- Authors: Kazuhiro Seki, Yuta Kikuchi, Tomoya Hayata, Seiji Yunoki,
- Abstract summary: Information scrambling is one of the promising applications of quantum computing.<n>We demonstrate the Hayden-Preskill recovery protocol and the interferometric protocol for calculating out-of-time-ordered correlators.<n>Our experiments are made possible by extensively utilizing one of the highest-fidelity quantum processors currently available.
- Score: 0.6843496572893532
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Complex quantum many-body dynamics spread initially localized quantum information across the entire system. Information scrambling refers to such a process, whose simulation is one of the promising applications of quantum computing. We demonstrate the Hayden-Preskill recovery protocol and the interferometric protocol for calculating out-of-time-ordered correlators to study the scrambling property of a one-dimensional kicked-Ising model on 20-qubit trapped-ion quantum processors. The simulated quantum circuits have a geometrically local structure that exhibits the ballistic growth of entanglement, resulting in the circuit depth being linear in the number of qubits for the entire state to be scrambled. We experimentally confirm the growth of signals in the Hayden-Preskill recovery protocol and the decay of out-of-time-ordered correlators at late times. As an application of the created scrambling circuits, we also experimentally demonstrate the calculation of the microcanonical expectation values of local operators adopting the idea of thermal pure quantum states. Our experiments are made possible by extensively utilizing one of the highest-fidelity quantum processors currently available and, thus, should be considered as a benchmark for the current status of the most advanced quantum computers.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Quantum Simulation of Dissipative Energy Transfer via Noisy Quantum
Computer [0.40964539027092917]
We propose a practical approach to simulate the dynamics of an open quantum system on a noisy computer.
Our method leverages gate noises on the IBM-Q real device, enabling us to perform calculations using only two qubits.
In the last, to deal with the increasing depth of quantum circuits when doing Trotter expansion, we introduced the transfer tensor method(TTM) to extend our short-term dynamics simulation.
arXiv Detail & Related papers (2023-12-03T13:56:41Z) - Deep Quantum Circuit Simulations of Low-Energy Nuclear States [51.823503818486394]
We present advances in high-performance numerical simulations of deep quantum circuits.
circuits up to 21 qubits and more than 115,000,000 gates can be efficiently simulated.
arXiv Detail & Related papers (2023-10-26T19:10:58Z) - Quantum state tomography with disentanglement algorithm [0.0]
We use variational quantum circuits to disentangle the quantum state to a product of computational zero states.
Inverse evolution of the zero states reconstructs the quantum state up to an overall phase.
Our method is universal and imposes no specific ansatz or constrain on the quantum state.
arXiv Detail & Related papers (2023-10-10T03:11:12Z) - Sequential quantum simulation of spin chains with a single circuit QED
device [5.841833052422423]
Quantum simulation of many-body systems in materials science and chemistry are promising application areas for quantum computers.
We show how a single-circuit quantum electrodynamics device can be used to simulate the ground state of a highly-entangled quantum many-body spin chain.
We demonstrate that the large state space of the cavity can be used to replace multiple qubits in a qubit-only architecture, and could therefore simplify the design of quantum processors for materials simulation.
arXiv Detail & Related papers (2023-08-30T18:00:03Z) - A Reorder Trick for Decision Diagram Based Quantum Circuit Simulation [0.4358626952482686]
We study two classes of quantum circuits on which the state-of-the-art decision diagram based simulators failed to perform well in terms of simulation time.
We propose a simple and powerful reorder trick to boost the simulation of such quantum circuits.
arXiv Detail & Related papers (2022-11-14T04:55:25Z) - An Amplitude-Based Implementation of the Unit Step Function on a Quantum
Computer [0.0]
We introduce an amplitude-based implementation for approximating non-linearity in the form of the unit step function on a quantum computer.
We describe two distinct circuit types which receive their input either directly from a classical computer, or as a quantum state when embedded in a more advanced quantum algorithm.
arXiv Detail & Related papers (2022-06-07T07:14:12Z) - Probing finite-temperature observables in quantum simulators of spin
systems with short-time dynamics [62.997667081978825]
We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality.
We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
arXiv Detail & Related papers (2022-06-03T18:00:02Z) - Quasi-Chaotic Oscillators Based on Modular Quantum Circuits [3.383942690870476]
We propose the implementation of a quasi-chaotic oscillator based on quantum modular addition and multiplication.
We prove that quantum computing allows the parallel processing of data, paving the way for a fast and robust multi-channel encryption/decryption scheme.
arXiv Detail & Related papers (2022-03-26T09:14:29Z) - Recompilation-enhanced simulation of electron-phonon dynamics on IBM
Quantum computers [62.997667081978825]
We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems.
We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling.
Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
arXiv Detail & Related papers (2022-02-16T19:00:00Z) - An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian
Simulation [55.41644538483948]
Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates.
We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions.
The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
arXiv Detail & Related papers (2021-08-06T19:38:03Z) - Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits
at Exascale [57.84751206630535]
We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework.
The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators.
By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
arXiv Detail & Related papers (2021-04-21T13:26:42Z) - 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) - Faster Schr\"odinger-style simulation of quantum circuits [2.0940228639403156]
Recent demonstrations of superconducting quantum computers by Google and IBM fueled new research in quantum algorithms.
We advance Schr"odinger-style simulation of quantum circuits that is useful standalone and as a building block in layered simulation algorithms.
arXiv Detail & Related papers (2020-08-01T08:47:24Z) - Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum
Computer Using Inherent Qubit Decoherence [53.20999552522241]
We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems.
We present three methods for implementing the thermal relaxation.
We find excellent agreement between our results, experimental data, and the theoretical prediction.
arXiv Detail & Related papers (2020-01-03T11:48:11Z)
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.