Quantum simulation of the Sachdev-Ye-Kitaev model by asymmetric qubitization

  title={Quantum simulation of the Sachdev-Ye-Kitaev model by asymmetric qubitization},
  author={Ryan Babbush and Dominic W. Berry and Hartmut Neven},
  journal={Physical Review A},
We show that one can quantum simulate the dynamics of a Sachdev-Ye-Kitaev model with $N$ Majorana modes for time $t$ to precision $\epsilon$ with gate complexity $O(N^{7/2} t + N^{5/2} t \,{\rm polylog}(N/ \epsilon))$. In addition to scaling sublinearly in the number of Hamiltonian terms, this gate complexity represents an exponential improvement in $1/\epsilon$ and large polynomial improvement in $N$ and $t$ over prior state-of-the-art algorithms which scale as $O(N^{10} t^2 / \epsilon)$. Our… 

Figures from this paper

A Sparse Model of Quantum Holography
We study a sparse version of the Sachdev-Ye-Kitaev (SYK) model defined on random hypergraphs constructed either by a random pruning procedure or by randomly sampling regular hypergraphs. The
Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
Recent work has dramatically reduced the gate complexity required to quantum simulate chemistry by using linear combinations of unitaries based methods to exploit structure in the plane wave basis
Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
It is shown that one can sometimes improve upon results with optimized implementations of Trotter-Suzuki-based product formulas by compiling to surface code fault-tolerant gates and assuming error rates of one part per thousand.
Concentration for Trotter error
Quantum simulation is expected to be one of the key applications of future quantum computers. Product formulas, or Trotterization, are the oldest and, still today, an appealing method for quantum
Quantum simulation via randomized product formulas: Low gate complexity with accuracy guarantees
Quantum simulation has wide applications in quantum chemistry and physics. Recently, scientists have begun exploring the use of randomized methods for accelerating quantum simulation. Among them, a
Toward simulating superstring/M-theory on a quantum computer
Abstract We present a novel framework for simulating matrix models on a quantum computer. Supersymmetric matrix models have natural applications to superstring/M-theory and gravitational physics, in
Parallel Quantum Algorithm for Hamiltonian Simulation
We study how parallelism can speed up quantum simulation. A parallel quantum algorithm is proposed for simulating the dynamics of a large class of Hamiltonians with good sparse structures, called
Sparse SYK and traversable wormholes
Abstract We investigate two sparse Sachdev-Ye-Kitaev (SYK) systems coupled by a bilinear term as a holographic quantum mechanical description of an eternal traversable wormhole in the low
Experimental error mitigation using linear rescaling for variational quantum eigensolving with up to 20 qubits
Quantum computers have the potential to help solve a range of physics and chemistry problems, but noise in quantum hardware currently limits our ability to obtain accurate results from the execution
Optimizing Strongly Interacting Fermionic Hamiltonians
Among other results, this work gives an efficient classical certification algorithm for upper-bounding the largest eigenvalue in the q = 4 SYK model, and an efficient quantum Certification algorithm for lower- bounding this largest eigensvalue; both algorithms achieve constant-factor approximations with high probability.


Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
We construct quantum circuits which exactly encode the spectra of correlated electron models up to errors from rotation synthesis. By invoking these circuits as oracles within the recently introduced
Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision
The algorithm is based on a general technique for implementing any operator with a suitable Fourier or Chebyshev series representation, and allows the quantum phase estimation algorithm, whose dependence on $\epsilon$ is prohibitive, to be bypassed.
Optimal Hamiltonian Simulation by Quantum Signal Processing.
It is argued that physical intuition can lead to optimal simulation methods by showing that a focus on simple single-qubit rotations elegantly furnishes an optimal algorithm for Hamiltonian simulation, a universal problem that encapsulates all the power of quantum computation.
Halving the cost of quantum addition
We improve the number of T gates needed to perform an n-bit adder from 8n+O(1) to 4n+O(1). We do so via a "temporary logical-AND" construction which uses four T gates to store the logical-AND of two
Low-Depth Quantum Simulation of Materials
Quantum simulation of the electronic structure problem is one of the most researched applications of quantum computing. The majority of quantum algorithms for this problem encode the wavefunction
Characterizing quantum supremacy in near-term devices
A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of
Decoupling with Random Quantum Circuits
Decoupling has become a central concept in quantum information theory, with applications including proving coding theorems, randomness extraction and the study of conditions for reaching thermal
Gapless spin-fluid ground state in a random quantum Heisenberg magnet.
  • Sachdev, Ye
  • Physics, Medicine
    Physical review letters
  • 1993
The spin-S quantum Heisenberg magnet with Gaussian-random, infinite-range exchange interactions is examined with generalizing to SU(M) symmetry and studying the large M limit to find the spin-fluid phase to be generically gapless.
Toward the first quantum simulation with quantum speedup
It is argued that simulating the time evolution of spin systems is a classically hard problem of practical interest that is among the easiest to address with early quantum devices, and develops optimized implementations and performs detailed resource analyses for several leading quantum algorithms for this problem.
Exact convergence times for generation of random bipartite entanglement
We calculate exact convergence times to reach random bipartite entanglement for various random protocols. The eigenproblem of a Markovian chain governing the process is mapped to a spin chain,