Related papers: The complexity of quantum spin systems on a two-di…
We develop a resource efficient method by which the ground-state of an arbitrary k-local, optimization Hamiltonian can be encoded as the ground-state of a (k-1)-local optimization Hamiltonian. This result is important because adiabatic…
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such…
The Local Hamiltonian problem is the problem of estimating the least eigenvalue of a local Hamiltonian, and is complete for the class QMA. The 1D problem on a chain of qubits has heuristics which work well, while the 13-state qudit case has…
We consider the problem of learning local quantum Hamiltonians given copies of their Gibbs state at a known inverse temperature, following Haah et al. [2108.04842] and Bakshi et al. [arXiv:2310.02243]. Our main technical contribution is a…
We experimentally study the two-dimensional Fermi-Hubbard model using a Rydberg-based quantum processing unit in the analog mode. Our approach avoids encoding directly the original fermions into qubits and instead relies on reformulating…
The nonadiabatic geometric quantum computation is promising as it is robust against certain types of local noises. However, its experimental implementation is challenging due to the need of complex control on multi-level and/or multiple…
We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in [E. Farhi, et al., arXiv:quant-ph/0208135]. The algorithm is applied to a random binary optimization problem (a version…
We study a quantum model with non-isotropic two-dimensional oscillator potential but with additional quadratic interaction $x_1x_2$ with imaginary coupling constant. It is shown, that for a specific connection between coupling constant and…
Analog models of quantum information processing, such as adiabatic quantum computation and analog quantum simulation, require the ability to subject a system to precisely specified Hamiltonians. Unfortunately, the hardware used to implement…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…
An open question in designing superconducting quantum circuits is how best to reduce the full circuit Hamiltonian which describes their dynamics to an effective two-level qubit Hamiltonian which is appropriate for manipulation of quantum…
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…
A quantum lattice algorithm (QLA) is developed for the solution of Maxwell equations in scalar dielectric media using the Riemann-Silberstein representation. For x-dependent and y-dependent inhomogeneities, the corresponding QLA requries 8…
We revisit the question of the relation between entanglement, entropy, and area for harmonic lattice Hamiltonians corresponding to discrete versions of real free Klein-Gordon fields. For the ground state of the d-dimensional cubic harmonic…
We consider a two-spin model, represented classically by a nonlinear autonomous Hamiltonian system with two degrees of freedom and a nontrivial integrability condition, and quantum mechanically by a real symmetric Hamiltonian matrix with…
Adiabatic elimination is a standard tool in quantum optics, which produces an effective Hamiltonian for a relevant subspace of states, incorporating effects of its coupling to states with much higher unperturbed energy. It shares with…
We demonstrate that in a triangular configuration of an optical lattice of two atomic species a variety of novel spin-1/2 Hamiltonians can be generated. They include effective three-spin interactions resulting from the possibility of atoms…
We construct two quantum spin chains Hamiltonians with quantum sl(2|1) invariance. These spin chains define variants of the Hubbard model and describe electron models with pair hoppings. A cubic algebra that admits the Birman-Wenzl-Murakami…
We describe an algorithm that computes the ground state energy and correlation functions for 2-local Hamiltonians in which interactions between qubits are weak compared to single-qubit terms. The running time of the algorithm is polynomial…
We propose a hybrid quantum-classical algorithm for approximating the ground state and ground state energy of a Hamiltonian. Once the Ansatz has been decided, the quantum part of the algorithm involves the calculation of two overlap…