Related papers: Quantum computation algorithm for many-body studie…
The generating function of a Hamiltonian $H$ is defined as $F(t)=\langle e^{-itH}\rangle$, where $t$ is the time and where the expectation value is taken on a given initial quantum state. This function gives access to the different moments…
Solving non-Hermitian quantum many-body systems on a quantum computer by minimizing the variational energy is challenging as the energy can be complex. Here, based on energy variance, we propose a variational method for solving the…
We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-local qubit Hamiltonians with a small set of physically…
We propose a computational protocol for quantum simulations of Fermionic Hamiltonians on a quantum computer, enabling calculations which were previously not feasible with conventional encoding and ansatses of variational quantum…
Simulating the time-dynamics of quantum many-body systems was the original use of quantum computers proposed by Feynman, motivated by the critical role of quantum interactions between electrons in the properties of materials and molecules.…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
Learning the structure of the entanglement Hamiltonian (EH) is central to characterizing quantum many-body states in analog quantum simulation. We describe a protocol where spatial deformations of the many-body Hamiltonian, physically…
Manipulating Hamiltonians governing physical systems has found a broad range of applications, from quantum chemistry to semiconductor design. In this work, we provide a new way of manipulating Hamiltonians, by transforming their eigenvalues…
Using a separable many-body variational wavefunction, we formulate a self-consistent effective Hamiltonian theory for fermionic many-body system. The theory is applied to the two-dimensional Hubbard model as an example to demonstrate its…
We aim to explore a more efficient way to simulate few-body dynamics on quantum computers. Instead of mapping the second quantization of the system Hamiltonian to qubit Pauli gates representation via the Jordan-Wigner transform, we propose…
We propose a class of randomized quantum algorithms for the task of sampling from matrix functions, without the use of quantum block encodings or any other coherent oracle access to the matrix elements. As such, our use of qubits is purely…
We show how to map a given n-qubit target Hamiltonian with bounded-strength k-body interactions onto a simulator Hamiltonian with two-body interactions, such that the ground-state energy of the target and the simulator Hamiltonians are the…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Simulating fermionic systems on a quantum computer requires a high-performing mapping of fermionic states to qubits. A characteristic of an efficient mapping is its ability to translate local fermionic interactions into local qubit…
Fermionic linear optics corresponds to the dynamics of free fermions, and is known to be efficiently simulable classically. We define fermionic anyon models by deforming the fermionic algebra of creation and annihilation operators, and…
To overcome the limitations of existing algorithms for solving self-bound quantum many-body problems -- such as those encountered in nuclear and particle physics -- that access only a restricted subset of energy levels and provide limited…
We propose a quantum algorithm for solving the following problem: given the Hamiltonian of a physical system and one of its eigenvalues, how to obtain the corresponding eigenstate? The algorithm is based on the resonance phenomena. For a…
The motivation for studying non-Hermitian systems and the role of $\mathcal{PT}$-symmetry is discussed. We investigate the use of a quantum algorithm to find the eigenvalues and eigenvectors of non-Hermitian Hamiltonians, with applications…
A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that…
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in…