Related papers: Quantum Algorithms for Fermionic Simulations
Typically, quantum mechanics is thought of as a linear theory with unitary evolution governed by the Schr\"odinger equation. While this is technically true and useful for a physicist, with regards to computation it is an unfortunately…
Numerical modeling of radio-frequency waves in plasma with sufficiently high spatial and temporal resolution remains challenging even with modern computers. However, such simulations can be sped up using quantum computers in the future.…
Quantum simulation is known to be capable of simulating certain dynamical systems in continuous time -- Schrodinger's equations being the most direct and well-known -- more efficiently than classical simulation. Any linear dynamical system…
Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described…
Classical simulations of quantum computations are vital for the future development of this emerging technology. To this end, decision diagrams have been proposed as a complementary technique which frequently allows to tackle the inherent…
We develop a workflow to use current quantum computing hardware for solving quantum many-body problems, using the example of the fermionic Hubbard model. Concretely, we study a four-site Hubbard ring that exhibits a transition from a…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
We present a new Monte Carlo algorithm for simulating quantum spin systems which is able to suppress the negative sign problem. This algorithm has only a linear complexity in the lattice size used for the simulation. A general description…
We study a quantum computer with fixed and permanent interaction of diagonal type between qubits. It is controlled only by one-qubit quick transformations. It is shown how to implement Quantum Fourier Transform and to solve Shroedinger…
We have developed a concrete quantum simulation scheme and experimentally simulated a pairing model on an NMR quantum computer. The design of our experiment includes choosing an appropriate initial state in order to make our scheme scalable…
The path integral formulation of quantum mechanical problems including fermions is often affected by a severe numerical sign problem. We show how such a sign problem can be alleviated by a judiciously chosen constant imaginary offset to the…
Interactions between particles are usually a resource for quantum computing, making quantum many-body systems intractable by any known classical algorithm. In contrast, noise is typically considered as being inimical to quantum many-body…
The simulation of large-scale classical systems in exponentially small space on quantum computers has gained attention. The prior work demonstrated that a quantum algorithm offers an exponential speedup over any classical algorithm in…
Modeling non-Hermitian Hamiltonians is increasingly important in classical and quantum domains, especially when studying open systems, $PT$ symmetry, and resonances. However, the quantum simulation of these models has been limited by the…
Quantum computers have the potential to simulate chemical systems beyond the capability of classical computers. Recent developments in hybrid quantum-classical approaches enable the determinations of the ground or low energy states of…
Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the "negative sign problem'' when applied to fermions - causing an exponential increase of the computing time with the number of particles. A polynomial time…
Quantum computers potentially have an exponential advantage over classical computers for the quantum simulation of many-fermion quantum systems. Nonetheless, fermions are more expensive to simulate than bosons due to the fermionic encoding…
Sign problem in quantum Monte Carlo (QMC) simulation appears to be an extremely hard yet interesting problem. In this article, we present a pedagogical overview on the origin of the sign problem in various quantum Monte Carlo simulation…
We revisit the Jordan-Wigner transformation, showing that --rather than a non-local isomorphism between different fermionic and spin Hamiltonian operators-- it can be viewed in terms of local identities relating different realizations of…
Monte Carlo calculations in the framework of lattice field theory provide non-perturbative access to the equilibrium physics of quantum fields. When applied to certain fermionic systems, or to the calculation of out-of-equilibrium physics,…