Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFermionic Hamiltonians for quantum simulations: a general reduction scheme
71
0
0.0
(
0
)
Added by
Panagiotis Barkoutsos
Publication date
2017
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
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 applied to the electronic Hamiltonians. Current solutions to this problem rely on perturbation theory in an enlarged Hilbert space. The main challenge associated with this technique is that it relies on coupling constants with very different magnitudes. This prevents its implementation in currently available architectures. In order to resolve this issue, we present an optimization scheme that unfolds the k-local terms into a linear combination of 2-local terms, while ensuring the conservation of all relevant physical properties of the original Hamiltonian, with several orders of magnitude smaller variation of the coupling constants.
rate research
Read More
The main challenges in achieving high-fidelity quantum gates are to reduce the influence of control errors caused by imperfect Hamiltonians and the influence of decoherence caused by environment noise. To overcome control errors, a promising proposal is nonadiabatic holonomic quantum computation, which has attracted much attention in both theories and experiments. While the merit of holonomic operations resisting control errors has been well exploited, an important issue following is how to shorten the evolution time needed for realizing a holonomic gate so as to avoid the influence of environment noise as much as possible. In this paper, we put forward a general approach of constructing Hamiltonians for nonadiabatic holonomic quantum computation, which makes it possible to minimize the evolution time and might open a new horizon for the realistic implementation of nonadiabatic holonomic quantum computation.
A system of linearly coupled quantum harmonic oscillators can be diagonalized when the system is dynamically stable using a Bogoliubov canonical transformation. However, this is just a particular case of more general canonical transformations that can be performed even when the system is dynamically unstable. Specific canonical transformations can transform a quadratic Hamiltonian into a normal form, which greatly helps to elucidate the underlying physics of the system. Here, we provide a self-contained review of the normal form of a quadratic Hamiltonian as well as step-by-step instructions to construct the corresponding canonical transformation for the most general case. Among other examples, we show how the standard two-mode Hamiltonian with a quadratic position coupling presents, in the stability diagram, all the possible normal forms corresponding to different types of dynamical instabilities.
We discuss encodings of fermionic many-body systems by qubits in the presence of symmetries. Such encodings eliminate redundant degrees of freedom in a way that preserves a simple structure of the system Hamiltonian enabling quantum simulations with fewer qubits. First we consider $U(1)$ symmetry describing the particle number conservation. Using a previously known encoding based on the first quantization method a system of $M$ fermi modes with $N$ particles can be simulated on a quantum computer with $Q=Nlog{(M)}$ qubits. We propose a new version of this encoding tailored to variational quantum algorithms. Also we show how to improve sparsity of the simulator Hamiltonian using orthogonal arrays. Next we consider encodings based on the second quantization method. It is shown that encodings with a given filling fraction $ u=N/M$ and a qubit-per-mode ratio $eta=Q/M<1$ can be constructed from efficiently decodable classical LDPC codes with the relative distance $2 u$ and the encoding rate $1-eta$. A family of codes based on high-girth bipartite graphs is discussed. Graph-based encodings eliminate roughly $M/N$ qubits. Finally we consider discrete symmetries, and show how to eliminate qubits using previously known encodings, illustrating the technique for simple molecular-type Hamiltonians.
Many-body techniques based on the double unitary coupled cluster ansatz (DUCC) can be used to downfold electronic Hamiltonians into low-dimensional active spaces. It can be shown that the resulting dimensionality reduced Hamiltonians are amenable for quantum computing. Recent studies performed for several benchmark systems using quantum phase estimation (QPE) algorithms demonstrated that these formulations can recover a significant portion of ground-state dynamical correlation effects that stem from the electron excitations outside of the active space. These results have also been confirmed in studies of ground-state potential energy surfaces using quantum simulators. In this letter, we study the effectiveness of the DUCC formalism in describing excited states. We also emphasize the role of the QPE formalism and its stochastic nature in discovering/identifying excited states or excited-state processes in situations when the knowledge about the true configurational structure of a sought after excited state is limited or postulated (due to the specific physics driving excited-state processes of interest). In this context, we can view the QPE algorithm as an engine for verifying various hypotheses for excited-state processes and providing statistically meaningful results that correspond to the electronic state(s) with the largest overlap with a postulated configurational structure. We illustrate these ideas on examples of strongly correlated molecular systems, characterized by small energy gaps and high density of quasi-degenerate states around the Fermi level.
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 access memory (qRAM) which allows for the efficient preparation of states that encode the rows of the Hamiltonian. We use a linear combination of quantum walks to achieve poly-logarithmic dependence on precision. The time complexity of our algorithm, measured in terms of the circuit depth, is $O(tsqrt{N}|H|,mathrm{polylog}(N, t|H|, 1/epsilon))$, where $t$ is the evolution time, $N$ is the dimension of the system, and $epsilon$ is the error in the final state, which we call precision. Our algorithm can be directly applied as a subroutine for unitary implementation and quantum linear systems solvers, achieving $widetilde{O}(sqrt{N})$ dependence for both applications.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
