Related papers: Experimental Simulation of a Pairing Hamiltonian o…
It is exponentially hard to simulate quantum systems by classical algorithms, while quantum computer could in principle solve this problem polynomially. We demonstrate such an quantum-simulation algorithm on our NMR system to simulate an…
The simulation of open quantum dynamics on quantum circuits has attracted wide interests recently with a variety of quantum algorithms developed and demonstrated. Among these, one particular design of a unitary-dilation-based quantum…
We report the realization of a nuclear magnetic resonance (NMR) quantum computer which combines the quantum Fourier transform (QFT) with exponentiated permutations, demonstrating a quantum algorithm for order-finding. This algorithm has the…
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…
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…
Feynman's prescription for a quantum simulator was to find a hamitonian for a system that could serve as a computer. P\'olya and Hilbert conjecture was to demonstrate Riemann's hypothesis through the spectral decomposition of hermitian…
We conduct experimental simulations of many body quantum systems using a \emph{hybrid} classical-quantum algorithm. In our setup, the wave function of the transverse field quantum Ising model is represented by a restricted Boltzmann…
Quantum simulation of fermionic systems is a promising application of quantum computers, but in order to program them, we need to map fermionic states and operators to qubit states and quantum gates. While quantum processors may be built as…
We initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms…
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…
Simulations of quantum chemistry and quantum materials are believed to be among the most important potential applications of quantum information processors, but realizing practical quantum advantage for such problems is challenging. Here,…
We propose the utilization of the IBM Quantum Experience quantum computing system to simulate different scenarios involving common hybrid quantum system components, the Nitrogen Vacancy Centre (NV centre) and the Flux Qubit. We perform a…
We propose and analyze an approach to realize quantum computation and simulation using fermionic particles under quantum gas microscopes. Our work is inspired by a recent experimental demonstration of large-scale quantum registers, where…
The field of quantum computing has grown fast in recent years, both in theoretical advancements and the practical construction of quantum computers. These computers were initially proposed, among other reasons, to efficiently simulate and…
We show in detail how the Jordan-Wigner transformation can be used to simulate any fermionic many-body Hamiltonian on a quantum computer. We develop an algorithm based on appropriate qubit gates that takes a general fermionic Hamiltonian,…
We employ a nuclear magnetic resonance (NMR) quantum information processor to simulate the ground state of an XXZ spin chain and measure its NMR analog of entanglement, or pseudo-entanglement. The observed pseudo-entanglement for a…
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…
Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrodinger equation for interacting many-body systems are presented in some detail. These…
Future quantum computers are anticipated to be able to perform simulations of quantum many-body systems and quantum field theories that lie beyond the capabilities of classical computation. This will lead to new insights and predictions for…
We show that the time evolution of the wave function of a quantum mechanical many particle system can be implemented very efficiently on a quantum computer. The computational cost of such a simulation is comparable to the cost of a…