Related papers: Optimal simulation of two-qubit Hamiltonians using…
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are…
Recent work has shown that it can be advantageous to implement a composite channel that partitions the Hamiltonian $H$ for a given simulation problem into subsets $A$ and $B$ such that $H=A+B$, where the terms in $A$ are simulated with a…
The exponential speedups promised by Hamiltonian simulation on a quantum computer depends crucially on structure in both the Hamiltonian $\hat{H}$, and the quantum circuit $\hat{U}$ that encodes its description. In the quest to better…
For a quantum system governed by a non-Hermitian Hamiltonian, we studied the problem of obtaining an optimum Hamiltonian that generates nonunitary transformations of a given initial state into a certain final state in the smallest time…
We propose a protocol to realize quantum simulation and computation in spin systems with long-range interactions. Our approach relies on the local addressing of single spins with external fields parametrized by Walsh functions. This enables…
We investigate the power of quantum systems for the simulation of Hamiltonian time evolutions on a cubic lattice under the constraint of translational invariance. Given a set of translationally invariant local Hamiltonians and short range…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
In this work we extend the notion of universal quantum Hamiltonians to the setting of translationally-invariant systems. We present a construction that allows a two-dimensional spin lattice with nearest-neighbour interactions, open…
We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in…
Double-dot exchange-only qubit represents a promising compromise between high speed and simple fabrication in solid-state implementations. A couple of interacting double-dot exchange-only qubits, each composed by three electrons distributed…
We present a low-space overhead simulation algorithm based on the truncated Dyson series for time-dependent quantum dynamics. This algorithm is applied to simulating time-independent Hamiltonians by transitioning to the interaction picture,…
We introduce a hybrid classical-quantum algorithm for simulating a Hamiltonian of the form $H= \sum_{i=1}^K H_i = \sum_{i=1}^K H_{i_1} \otimes H_{i_2} \otimes \cdots \otimes H_{i_M}$. Given that the entries of all $\{ H_{i_1}, H_{i_2} ,…
We study the time evolution of an ideal system composed of two harmonic oscillators coupled through a quadratic Hamiltonian with arbitrary interaction strength. We solve its dynamics analytically by employing tools from symplectic geometry.…
When canonical Hamiltonians of local quantum field theories are transformed using a renormalization group procedure for effective particles, the resulting interaction terms are non-local. The range of their non-locality depends on the…
Commuting Hamiltonians lie at the boundary between classical constraint satisfaction and quantum many-body physics, exhibiting rich quantum structure while remaining more tractable than general noncommuting models. In contrast, physical…
Many-body fermionic quantum calculations performed on analog quantum computers are restricted by the presence of k-local terms, which represent interactions among more than two qubits. These originate from the fermion-to-qubit mapping…
We investigate the thermal entanglement of interacting two qubits. We maximize it by tuning a local Hamiltonian under a given interaction Hamiltonian. We prove that the optimizing local Hamiltonian takes a simple form which dose not depend…
Simulating high-weight Hamiltonians can convert local noise on the original Hamiltonian into undesirable nonlocal noise on the simulated Hamiltonian. Here we show how starting from two-local Hamiltonian in the presence of non-Markovian…
Within the framework of quantum mechanics working with one-dimensional, manifestly non-Hermitian Hamiltonians $H=T+V$ the traditional class of the exactly solvable models with local point interactions $V=V(x)$ is generalized. The…
We present a quantum algorithm for simulating the dynamics of Hamiltonians that are not necessarily sparse. Our algorithm is based on the input model where the entries of the Hamiltonian are stored in a data structure in a quantum random…