Related papers: Sachdev-Ye-Kitaev model on a noisy quantum compute…
Sampling from the output distribution of chaotic quantum evolutions, and of pseudo-random universal quantum circuits in particular, has been proposed as a prominent milestone for near-term quantum supremacy. The same paper notes that…
We construct a polynomial-time classical algorithm that samples from the output distribution of noisy geometrically local Clifford circuits with any product-state input and single-qubit measurements in any basis. Our results apply to…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…
Several condensed-matter platforms have been proposed recently to realize the Sachdev-Ye-Kitaev (SYK) model in their low-energy limit. In these proposed realizations, the characteristic SYK behavior is expected to occur under certain…
The development of complex circuits for practical applications in the current quantum computing ecosystem is based on basic primitives such as Bell states, which provide superposition, entanglement, and coherence. The range of…
Reducing the impact of errors and decoherence in near-term quantum computers, such as noisy intermediate-scale quantum (NISQ) devices, is critical for their practical implementation. These factors significantly limit the applicability of…
We propose a hybrid quantum-classical algorithm for solving QUBO problems using an Imaginary Time Evolution-Mimicking Circuit (ITEMC). The circuit parameters are optimized to closely mimic imaginary time evolution, using only single- and…
The growth of information scrambling, captured by out-of-time-order correlation functions (OTOCs), is a central indicator of the nature of many-body quantum dynamics. Here, we compute analytically the complete time dependence of the OTOC…
We develop a mathematically rigorous path integral representation of the time evolution operator for a model of (1+1) quantum gravity that incorporates factor ordering ambiguity. In obtaining a suitable integral kernel for the…
The variational quantum imaginary time evolution algorithm is efficient in finding the ground state of a quantum Hamiltonian. This algorithm involves solving a system of linear equations in a classical computer and the solution is then used…
We study the equilibrium dynamics of an infinite-range quantum Heisenberg model with random couplings, in which local magnetic moments arise from $\mathcal{N}_f$ flavors of spinful fermions. We employ an expansion in $\mathcal{N}_f$, which…
We propose and study a realistic model for the decoherence of topological qubits, based on Majorana fermions in one-dimensional topological superconductors. The source of decoherence is the fluctuating charge on a capacitively coupled gate,…
We analyze the use of the Solovay Kitaev (SK) algorithm to generate an ensemble of one qubit rotations over which to perform randomized compilation. We perform simulations to compare the trace distance between the quantum state resulting…
We consider unitary dynamical evolutions on n qubits caused by time dependent pair-interaction Hamiltonians and show that the running time of a parallelized two-qubit gate network simulating the evolution is given by the time integral over…
Impurity Hamiltonians are systems of $N$ fermionic modes where $O(1)$ of them interact among themselves via quartic (or higher order) fermion terms, while coupling quadratically with $O(N)$ bath modes. Without the quartic interactions,…
We introduce a classical algorithm for sampling the output of shallow, noisy random circuits on two-dimensional qubit arrays. The algorithm builds on the recently-proposed "space-evolving block decimation" (SEBD) and extends it to the case…
Quantum simulation is a potentially powerful application of quantum computing, holding the promise to be able to emulate interesting quantum systems beyond the reach of classical computing methods. Despite such promising applications, and…
Simulating real-time dynamics of gauge theories represents a paradigmatic use case to test the hardware capabilities of a quantum computer, since it can involve non-trivial input states preparation, discretized time evolution, long-distance…
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…
We show that the proper inclusion of soft reparameterization modes in the Sachdev-Ye-Kitaev model of $N$ randomly interacting Majorana fermions reduces its long-time behavior to that of Liouville quantum mechanics. As a result, all zero…