Related papers: General, efficient, and robust Hamiltonian enginee…
We provide a quantum method for simulating Hamiltonian evolution with complexity polynomial in the logarithm of the inverse error. This is an exponential improvement over existing methods for Hamiltonian simulation. In addition, its scaling…
We present and experimentally implement a real-time protocol for calibrating the frequency of a resonantly driven qubit, achieving exponential scaling in calibration precision with the number of measurements, up to the limit imposed by…
We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number…
Precision measurements of frequency are critical to accurate timekeeping, and are fundamentally limited by quantum measurement uncertainties. While for time-independent quantum Hamiltonians, the uncertainty of any parameter scales at best…
We show how to perform universal Hamiltonian and adiabatic computing using a time-independent Hamiltonian on a 2D grid describing a system of hopping particles which string together and interact to perform the computation. In this…
The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles…
As a milestone for general-purpose computing machines, we demonstrate that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. Moreover, on noisy devices without error correction, we…
The implementation of time-evolution operators $U(t)$, called Hamiltonian simulation, is one of the most promising usage of quantum computers. For time-independent Hamiltonians, qubitization has recently established efficient realization of…
We developed a Keplerian-based Hamiltonian splitting for solving the gravitational $N$-body problem. This splitting allows us to approximate the solution of a general $N$-body problem by a composition of multiple, independently evolved…
The precise implementation and manipulation of quantum gates is key to extracting advantages from future quantum technologies. Achieving this requires very accurate control over the quantum system. If one has complete knowledge about a…
Quantum pseudorandomness, also known as unitary designs, comprise a powerful resource for quantum computation and quantum engineering. While it is known in theory that pseudorandom unitary operators can be constructed efficiently, realizing…
We develop a class of emulators for solving quantum three-body scattering problems. They are based on combining the variational method for scattering observables and the recently proposed eigenvector continuation concept. The emulators are…
We develop an efficient and robust approach to Hamiltonian identification for multipartite quantum systems based on the method of compressed sensing. This work demonstrates that with only O(s log(d)) experimental configurations, consisting…
We propose a framework to design concurrently a frustration-free quantum many-body Hamiltonian and its numerically exact ground states on a sufficiently large finite-size cluster in one and two dimensions using an elementary matrix product…
We present a continuous-time, neural-network-based approach to optimal control in quantum systems, with a focus on pulse engineering for quantum gates. Leveraging the framework of neural ordinary differential equations, we construct control…
Microscopically conserving reduced models of many-body systems have a long, highly successful history. Established theories of this type are the random-phase approximation for Coulomb fluids and the particle-particle ladder model for…
The Hamiltonian of a linearly driven two-level system, or qubit, in the standard rotating frame contains non-commuting terms that oscillate at twice the drive frequency, $\omega$, rendering the task of analytically finding the qubit's time…
The evolution speed in projective Hilbert space is considered for Hermitian Hamiltonians and for non-Hermitian (NH) ones. Based on the Hilbert-Schmidt norm and the spectral norm of a Hamiltonian, resource-related upper bounds on the…
A typical goal of a quantum simulation is to find the energy levels and eigenstates of a given Hamiltonian. This can be realized by adiabatically varying the system control parameters to steer an initial eigenstate into the eigenstate of…
While quantum simulators promise to explore quantum many-body physics beyond classical computation, their capabilities are limited by the available native interactions in the hardware. On many platforms, accessible Hamiltonians are largely…