相关论文: Simulating sparse SYK model with a randomized algo…

The simulation of complex quantum systems on a quantum computer is studied, taking the kicked Harper model as an example. This well-studied system has a rich variety of dynamical behavior depending on parameters, displays interesting…

Quantum signal processing (QSP), which enables systematic polynomial transformations on quantum data through sequences of qubit rotations, has emerged as a fundamental building block for quantum algorithms and data re-uploading quantum…

Analog quantum simulators offer a powerful microscopic probe of quantum many-body systems, yet have largely been benchmarked against model Hamiltonians rather than real materials. Here, we use a 256-qubit Rydberg simulator to implement the…

Quantum simulation, the simulation of quantum processes on quantum computers, suggests a path forward for the efficient simulation of problems in condensed-matter physics, quantum chemistry, and materials science. While the majority of…

Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian, a task known as sparse Hamiltonian simulation, which is fundamentally important in quantum computation. Although…

Many key features of the higher-dimensional Sachdev-Ye-Kitaev (SYK) model at {\it finite} $N$ remain unknown. Here we study the SYK chain consisting of $N$ ($N$$\ge$$2$) fermions per site with random interactions and hoppings between…

Random spin systems at low temperatures are glassy and feature computational hardness in finding low-energy states. We study the random all-to-all interacting fermionic Sachdev--Ye--Kitaev (SYK) model and prove that, in contrast, (I) the…

Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. The existing algorithms generally approximate the time evolution operators, which may need a deep…

We show that several quantum circuit families can be simulated efficiently classically if it is promised that their output distribution is approximately sparse i.e. the distribution is close to one where only a polynomially small, a priori…

Efficient simulation of large-scale quantum algorithms is pivotal yet challenging due to the exponential growth of the state space inherent in both Sch\"odinger-based and Feynman-based methods. While Feynman-based simulators can be highly…

Hybrid classical-quantum algorithms aim at variationally solving optimisation problems, using a feedback loop between a classical computer and a quantum co-processor, while benefitting from quantum resources. Here we present experiments…

We argue that the SYK model provides a conditional realization of Cryptographic Censorship in JT gravity. By using the Weingarten calculus and random matrix universality, we prove that the SYK disorder ensemble is an approximate unitary…

The study of quantum circuit simulation using classical computers is a key research topic that helps define the boundary of verifiable quantum advantage, solve quantum many-body problems, and inform development of quantum hardware and…

We study a model of fermions with random couplings similar to conventional SYK with $N$ number of flavours of fermions, at large $N$. Unlike the conventional SYK model, which has all-to-all couplings, the model we study, which we call local…

We study how chaos, introduced by a weak perturbation, affects the reliability of the output of analog quantum simulation. As a toy model, we consider the Lipkin-Meshkov-Glick (LMG) model. Inspired by the semiclassical behavior of the order…

In order to evaluate, validate, and refine the design of new quantum algorithms or quantum computers, researchers and developers need methods to assess their correctness and fidelity. This requires the capabilities of quantum circuit…

Understanding the emergence of complex correlations in strongly interacting systems remains a fundamental challenge in quantum many-body physics. One fruitful approach is to develop solvable toy models that encapsulate universal properties…

A pair of identical Sachdev-Ye-Kitaev (SYK) models with bilinear coupling forms a quantum dual of a traversable wormhole, with a ground state close to the so called thermofield double state. We use adiabaticity arguments and numerical…

The chiral SYK model is an 1+1 dimensional generalisation of the Sachdev-Ye-Kitaev model with chiral Majorana fermions and homogeneous random interactions. In the large N limit, the model admits an exact solution of the two-point function…

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…