Disentangling unitary dynamics with classically simulable quantum circuits
- URL: http://arxiv.org/abs/2410.09001v1
- Date: Fri, 11 Oct 2024 17:18:26 GMT
- Title: Disentangling unitary dynamics with classically simulable quantum circuits
- Authors: Gerald E. Fux, Benjamin Béri, Rosario Fazio, Emanuele Tirrito,
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We explore to which extent it is possible to construct efficient classical simulation of quantum many body systems using a combination of tensor network methods and the stabilizer formalism. For this we study both quantum circuit and Hamiltonian dynamics. We find that expectations of Pauli operators can be simulated efficiently even for deep Clifford circuits doped with T-gates or more general phase gates, provided the number of non-Clifford gates is smaller or approximately equal to the system size. This is despite the fact that the resulting states exhibit both extensive entanglement and extensive nonstabilizerness. For the Hamiltonian dynamics we find that the classical simulation generically quickly becomes inefficient, but suggest the use of matchgate circuits alongside tensor networks for the efficient simulation of many-body quantum systems near free-fermion integrability.
Related papers
- Dynamical simulations of many-body quantum chaos on a quantum computer [3.731709137507907]
We study a class of maximally chaotic circuits known as dual unitary circuits.
We show that a superconducting quantum processor with 91 qubits is able to accurately simulate these correlators.
We then probe dynamics beyond exact verification, by perturbing the circuits away from the dual unitary point.
arXiv Detail & Related papers (2024-11-01T17:57:13Z) - Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
We use FNOs to model the evolution of random quantum spin systems.
We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
arXiv Detail & Related papers (2024-09-05T07:18:09Z) - 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) - Scalable simulation of non-equilibrium quantum dynamics via classically optimised unitary circuits [0.0]
We show how to optimise unitary brickwall circuits to approximate quantum time evolution operators.
We demonstrate that, for various three-body Hamiltonians, our approach produces quantum circuits that can outperform Trotterization in both their accuracy and the quantum circuit depth needed to implement the dynamics.
We also explain how to choose an optimal time step that minimises the combined errors of the quantum device and the brickwall circuit approximation.
arXiv Detail & Related papers (2023-12-21T19:00:35Z) - Partitioning Quantum Chemistry Simulations with Clifford Circuits [1.0286890995028481]
Current quantum computing hardware is restricted by the availability of only few, noisy qubits.
We investigate the limits of their classical and near-classical treatment while staying within the framework of quantum circuits.
arXiv Detail & Related papers (2023-03-02T13:05:19Z) - 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) - Classical circuits can simulate quantum aspects [0.0]
This study introduces a method for simulating quantum systems using electrical networks.
By synthesizing interaction networks, we accurately simulate quantum systems of varying complexity, from $2-$state to $n-$state systems.
arXiv Detail & Related papers (2022-09-19T18:42:06Z) - A single $T$-gate makes distribution learning hard [56.045224655472865]
This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits.
We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
arXiv Detail & Related papers (2022-07-07T08:04:15Z) - Absolutely Stable Spatiotemporal Order in Noisy Quantum Systems [0.0]
We introduce a model of non-unitary quantum dynamics that exhibits infinitely long-lived discrete order robust against any unitary or dissipative perturbation.
We demonstrate our claims using numerical simulations of a Clifford circuit in two spatial dimensions.
arXiv Detail & Related papers (2021-11-03T19:52:15Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
Random quantum circuits are commonly viewed as hard to simulate classically.
We show that approximate simulation of typical instances is almost as hard as exact simulation.
We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
arXiv Detail & Related papers (2019-12-31T19:00:00Z)
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.