相关论文: Parent Hamiltonian Reconstruction via Inverse Quan…
Traditional computational methods for studying quantum many-body systems are "forward methods," which take quantum models, i.e., Hamiltonians, as input and produce ground states as output. However, such forward methods often limit one's…
We study the inverse problem of constructing an appropriate Hamiltonian from a physically reasonable set of orthogonal wave functions for a quantum spin system. Usually, we are given a local Hamiltonian and try to characterize the relevant…
Quantum inverse problem is defined as how to determine a local Hamiltonian from a single eigenstate? This question is valid not only in Hermitian system but also in non-Hermitian system. So far, most attempts are limited to Hermitian…
This paper addresses the so-called inverse problem which consists in searching for (possibly multiple) parent target Hamiltonian(s), given a single quantum state as input. Starting from $\Psi_0$, an eigenstate of a given local Hamiltonian…
Quantum annealing is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. Quantum annealing in the transverse field Ising model, implemented on D-Wave…
Quantum simulation provides a powerful route for exploring many-body phenomena beyond the capabilities of classical computation. Existing approaches typically proceed in the forward direction: a model Hamiltonian is specified, implemented…
We generalize the quantum adiabatic theorem to the non-Hermitian system and build a rigorous adiabaticity condition with respect to the adiabatic phase. The non-Hermitian Hamiltonian inverse engineering method is proposed for the purpose to…
Quantum annealing is a way to prepare an eigenstate of the problem Hamiltonian. Starting from an eigenstate of a trivial Hamiltonian, we slowly change the Hamiltonian to the problem Hamiltonian, and the system remains in the eigenstate of…
We introduce a method for the search of parent Hamiltonians of input wave-functions based on the structure of their reduced density matrix. The two key elements of our recipe are an ansatz on the relation between reduced density matrix and…
We propose a quantum inverse iteration algorithm which can be used to estimate the ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the…
Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures…
We propose a method to construct the ground state $\psi(\lambda)$ of local lattice hamiltonians with the generic form $H_0 + \lambda H_1$, where $\lambda$ is a coupling constant and $H_0$ is a hamiltonian with a non degenerate ground state…
In this thesis, I investigate aspects of local Hamiltonians in quantum computing. First, I focus on the Adiabatic Quantum Computing model, based on evolution with a time dependent Hamiltonian. I show that to succeed using AQC, the…
Sampling all ground states of a Hamiltonian with equal probability is a desired feature of a sampling algorithm, but recent studies indicate that common variants of transverse field quantum annealing sample the ground state subspace…
We study the Ising Hamiltonian with a transverse field term to simulate the quantum annealing. Using shortcuts to adiabaticity, we design the time dependence of the Hamiltonian. The dynamical invariant is obtained by the mean-field ansatz,…
A computation in adiabatic quantum computing is implemented by traversing a path of nondegenerate eigenstates of a continuous family of Hamiltonians. We introduce a method that traverses a discretized form of the path: At each step we apply…
Solving inverse problems to identify Hamiltonians with desired properties holds promise for the discovery of fundamental principles. In quantum systems, quantum entanglement plays a pivotal role in not only characterizing the quantum nature…
Quantum annealers are an alternative approach to quantum computing which make use of the adiabatic theorem to efficiently find the ground state of a physically realizable Hamiltonian. Such devices are currently commercially available and…
Adiabatic quantum computation starts from embedding a computational problem into a Hamiltonian whose ground state encodes the solution to the problem. This problem Hamiltonian, $H_{\rm p}$, is normally chosen to be diagonal in the…
Given a generic time-dependent many-body quantum state, we determine the associated parent Hamiltonian. This procedure may require, in general, interactions of any sort. Enforcing the requirement of a fixed set of engineerable Hamiltonians,…