Related papers: Exact Spin Elimination in Ising Hamiltonians and E…
Simulated annealing (SA) attracts more attention among classical heuristic algorithms because the solution of the combinatorial optimization problem can be naturally mapped to the ground state of the Ising Hamiltonian. However, in practical…
Geometry and dimensionality have played crucial roles in our understanding of the fundamental laws of nature, with examples ranging from curved space-time in general relativity to modern theories of quantum gravity. In quantum many-body…
In this paper, we consider spin systems in three spatial dimensions, and prove that the local Hamiltonian problem for 3D lattices with face-centered cubic unit cells, 4-local translationally-invariant interactions between spin-3/2 particles…
We show how to implement quantum computation on a system with an intrinsic Hamiltonian by controlling a limited subset of spins. Our primary result is an efficient control sequence on a nearest-neighbor XY spin chain through control of a…
We present a protocol to selectively decouple, recouple, and engineer effective couplings in mesoscopic dipolar spin networks. In particular, we develop a versatile protocol that relies upon magic angle spinning to perform Hamiltonian…
We study the QED bound-state problem in a light-front hamiltonian approach. Starting with a bare cutoff QED Hamiltonian, $H_{_{B}}$, with matrix elements between free states of drastically different energies removed, we perform a similarity…
We present a non-perturbative framework for deriving effective Hamiltonians that describe low-energy excitations in quantum many-body systems. The method combines block diagonalization based on the Cederbaum--Schirmer--Meyer transformation…
Many coherence transfer experiments in Nuclear Magnetic Resonance Spectroscopy, involving network of coupled spins, use temporary spin-decoupling to produce desired effective Hamiltonians. In this paper, we show that significant time can be…
Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy…
We present a novel, computationally efficient approach to accelerate quantum optimal control calculations of large multi-qubit systems used in a variety of quantum computing applications. By leveraging the intrinsic symmetry of finite…
A method is proposed to improve the accuracy of approximate techniques for strongly correlated electrons that use reduced Hilbert spaces. As a first step, the method involves a change of basis that incorporates exactly part of the short…
The expensive cost of computing exact exchange in periodic systems limits the application range of density functional theory with hybrid functionals. To reduce the computational cost of exact change, we present a range-separated algorithm…
Within the frame of a novel treatment we make a complete mathematical analysis of exactly solvable one-dimensional quantum systems with non-constant mass, involving their ordering ambiguities. This work extends the results recently reported…
We present a quantum algorithm for simulating the dynamics of a first-quantized Hamiltonian in real space based on the truncated Taylor series algorithm. We avoid the possibility of singularities by applying various cutoffs to the system…
An infinite-$U$ term is introduced into the Holstein-Primakoff-transformed magnon hamiltonian of quantum Heisenberg magnetic models of spin $s$. This term removes the unphysical spin wave states on every site and truncates automatically the…
A major obstacle to non-convex optimization is the problem of getting stuck in local minima. We introduce a novel metaheuristic to handle this issue, creating an alternate Hamiltonian that shares minima with the original Hamiltonian only…
We show how to eliminate the first-order effects of the spin-orbit interaction in the performance of a two-qubit quantum gate. Our procedure involves tailoring the time dependence of the coupling between neighboring spins. We derive an…
Ising spin Hamiltonians are often used to encode a computational problem in their ground states. Quantum Annealing (QA) computing searches for such a state by implementing a slow time-dependent evolution from an easy-to-prepare initial…
In previous implementations of adiabatic quantum algorithms using spin systems, the average Hamiltonian method with Trotter's formula was conventionally adopted to generate an effective instantaneous Hamiltonian that simulates an adiabatic…
Optimizing over separable quantum objects is challenging for two key reasons: determining separability is NP-hard, and the dimensionality of the problem grows exponentially with the number of qubits. We address both challenges by…