Related papers: Optimal Hamiltonian Simulation by Quantum Signal P…
The Hamiltonian of a quantum system is represented in terms of operators corresponding to the kinetic and potential energies of the system. The expectation value of a Hamiltonian and Hamiltonian simulation are two of the most fundamental…
The physics of a quantum system with many degrees of freedom is often approximated by downfolding: most of the degrees of freedom are "folded into" a much smaller number of degrees of freedom, resulting in an effective Hamiltonian that…
Simulating quantum imaginary-time evolution (QITE) is a major promise of quantum computation. However, the known algorithms are either probabilistic (repeat until success) with impractically small success probabilities or coherent (quantum…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired…
The development of tailored materials for specific applications is an active field of research in chemistry, material science and drug discovery. The number of possible molecules that can be obtained from a set of atomic species grow…
Identifying Hamiltonian of a quantum system is of vital importance for quantum information processing. In this Letter, we realized and benchmarked a quantum Hamiltonian identification algorithm recently proposed [Phys. Rev. Lett.…
Simulating dynamics of physical systems is a key application of quantum computing, with potential impact in fields such as condensed matter physics and quantum chemistry. However, current quantum algorithms for Hamiltonian simulation yield…
Hamiltonian simulations are key subroutines in adiabatic quantum computation, quantum control, and quantum many-body physics, where quantum dynamics often happen in the low-energy sector. In contrast to time-independent Hamiltonian…
We propose a (theoretical ;-) model for quantum computation where the result can be read out from the time average of the Hamiltonian dynamics of a 2-dimensional crystal on a cylinder. The Hamiltonian is a spatially local interaction among…
We propose a method for Hamiltonian engineering in quantum information processing architectures that requires no local control, but only relies on collective qubit rotations and field gradients. The technique achieves a spatial modulation…
We present an efficient method for estimating the eigenvalues of a Hamiltonian $H$ from the expectation values of the evolution operator for various times. For a given quantum state $\rho$, our method outputs a list of eigenvalue estimates…
Until high-fidelity quantum computers with a large number of qubits become widely available, classical simulation remains a vital tool for algorithm design, tuning, and validation. We present a simulator for the Quantum Approximate…
The author analyzes quantum computation with the hybrid qubit (HQ) that is encoded using the three-electron configuration of a double quantum dot. All gate operations are controlled with electric signals, while the qubit remains at an…
Reducing the complexity of quantum algorithms to treat quantum chemistry problems is essential to demonstrate an eventual quantum advantage of Noisy-Intermediate Scale Quantum (NISQ) devices over their classical counterpart. Significant…
Imaginary-time evolution plays an important role in algorithms for computing ground-state and thermal equilibrium properties of quantum systems, but can be challenging to simulate on classical computers. Many quantum algorithms for…
Stochastic processes underlie a vast range of natural and social phenomena. Some processes such as atomic decay feature intrinsic randomness, whereas other complex processes, e.g. traffic congestion, are effectively probabilistic because we…
We investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of that state? We show that the procedure proposed by Lloyd,…
The presence of symmetries, be they discrete or continuous, in a physical system typically leads to a reduction in the problem to be solved. Here we report that neither translational invariance nor rotational invariance reduce the…
We introduce a quantum information theory-inspired method to improve the characterization of many-body Hamiltonians on near-term quantum devices. We design a new class of similarity transformations that, when applied as a preprocessing…
A programmable quantum processor is a fundamental model of quantum computation. In this model, any quantum channel can be approximated by applying a fixed universal quantum operation onto an input state and a quantum `program' state, whose…