Related papers: Sachdev-Ye-Kitaev model on a noisy quantum compute…
The study of quasiparticle dynamics is central to understanding non-equilibrium phenomena in quantum many-body systems. Direct simulation of such dynamics on quantum hardware has been limited by circuit depth and noise constraints. In this…
We present quantum algorithms for the simulation of quantum systems in one spatial dimension, which result in quantum speedups that range from superpolynomial to polynomial. We first describe a method to simulate the evolution of the…
We propose the Sachdev-Ye-Kitaev Lindbladian as a paradigmatic solvable model of dissipative many-body quantum chaos. It describes $N$ strongly coupled Majorana fermions with random all-to-all interactions, with unitary evolution given by a…
We study the out-of-equilibrium dynamics of a Sachdev-Ye-Kitaev (SYK) model, $N$ fermions with a $q$-body interaction of infinite range, coupled to a Markovian environment. Close to the infinite-temperature steady state, the real-time…
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. Synthesizing the corresponding quantum circuit is typically done by breaking the evolution into small time steps, also known as…
A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in…
The Sachdev-Ye-Kitaev (SYK) model, a theory of N Majorana fermions with q-body interactions, becomes in the large q limit a conformally-broken Liouville field theory. Taking this limit preserves many interesting properties of the model, yet…
The Sachdev-Ye-Kitaev (SYK) model is a model of $q$ interacting fermions whose large N limit is dominated by melonic graphs. In this review we first present a diagrammatic proof of that result by direct, combinatorial analysis of its…
Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy…
Understanding the boundary between classical simulatability and the power of quantum computation is a fascinating topic. Direct simulation of noisy quantum computation requires solving an open quantum many-body system, which is very costly.…
Quantum error correction (QEC) codes are fundamentally linked to quantum phases of matter: the degenerate ground state manifold corresponds to the code space, while topological excitations represent error syndromes. Building on this…
Nonperturbative formulation of the Sachdev-Ye-Kitaev (SYK) model is discussed. The partition function of the model can be represented as a functional integral over the Grassmann variables in Euclidean time which is well defined but it…
The Hamiltonian approach can be used successfully to study the real-time evolution of a non-Abelian lattice gauge theory on the available noisy quantum computers. In this work, results from the real-time evolution of SU(2) pure gauge theory…
We study a large $N$ tensor model with $O(N)^3$ symmetry containing two flavors of Majorana fermions, $\psi_1^{abc}$ and $\psi_2^{abc}$. We also study its random counterpart consisting of two coupled Sachdev-Ye-Kitaev models, each one…
Many-body chaos has emerged as a powerful framework for understanding thermalization in strongly interacting quantum systems. While recent analytic advances have sharpened our intuition for many-body chaos in certain large $N$ theories, it…
Classical simulation of noisy quantum circuits is essential for understanding quantum computing experiments. It enables scalable error characterization, analysis of how noise impacts quantum algorithms, and optimized implementations of…
We simulate the excited states of the Lipkin model using the recently proposed Quantum Equation of Motion (qEOM) method. The qEOM generalizes the EOM on classical computers and gives access to collective excitations based on quasi-boson…
We show how to absorb fermionic quantum simulation's expensive fermion-to-qubit mapping overhead into the overhead already incurred by surface-code-based fault-tolerant quantum computing. The key idea is to process information in…
Near term quantum computers suffer from a degree of decoherence which is prohibitive for high fidelity simulations with deep circuits. An economical use of circuit depth is therefore paramount. For digital quantum simulation of quantum…
Many significant quantum physical systems are characterized by Hamiltonians expressible as a linear combination of time-independent generators of a closed Lie algebra, $\hat{H}(t)=\sum_{l=1}^{L}\eta_{l}(t)\hat{g}_{l}$. The Wei-Norman method…