Related papers: Quantum simulators, continuous-time automata, and …
In the future, ab initio quantum simulations of heavy ion collisions may become possible with large-scale fault-tolerant quantum computers. We propose a quantum algorithm for studying these collisions by looking at a class of observables…
Ground-state properties are central to our understanding of quantum many-body systems. At first glance, it seems natural and essential to obtain the ground state before analyzing its properties; however, its exponentially large Hilbert…
We present a quantum-classical hybrid algorithm for calculating the ground state and its energy of the quantum many-body Hamiltonian by proposing an adaptive construction of a quantum state for the quantum-selected configuration interaction…
Quantum simulators, machines that can replicate the dynamics of quantum systems, are being built as useful devices and are seen as a stepping stone to universal quantum computers. A key difference between the two is that computers have the…
We present a hybrid quantum-classical algorithm to simulate thermal states of a classical Hamiltonians on a quantum computer. Our scheme employs a sequence of locally controlled rotations, building up the desired state by adding qubits one…
Imaginary time evolution is a powerful tool for studying quantum systems. While it is possible to simulate with a classical computer, the time and memory requirements generally scale exponentially with the system size. Conversely, quantum…
With our recently proposed effective Hamiltonian via Monte Carlo, we are able to compute low energy physics of quantum systems. The advantage is that we can obtain not only the spectrum of ground and excited states, but also wave functions.…
Is it possible to prove that the properties of Hamiltonians, such as the ground state energy, results of dynamical evolution, or thermal state expectation values, can be efficiently calculated when the Hamiltonians have physically motivated…
A number of many-body problems can be formulated using Hamiltonians that are quadratic in the creation and annihilation operators. Here, we show how such quadratic Hamiltonians can be efficiently estimated indirectly, employing very few…
Characterizing the entanglement structure of ground states of local Hamiltonians is a fundamental problem in quantum information. In this work we study the computational complexity of this problem, given the Hamiltonian as input. Our main…
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…
Accurately determining ground-state properties of quantum many-body systems remains one of the major challenges of quantum simulation. In this work, we present a protocol for estimating the ground-state energy using only global time…
If a large Quantum Computer (QC) existed today, what type of physical problems could we efficiently simulate on it that we could not simulate on a classical Turing machine? In this paper we argue that a QC could solve some relevant physical…
We propose quantum-selected configuration interaction (QSCI), a class of hybrid quantum-classical algorithms for calculating the ground- and excited-state energies of many-electron Hamiltonians on noisy quantum devices. Suppose that an…
We propose a scheme for a ground-code measurement-based quantum computer, which enjoys two major advantages. First, every logical qubit is encoded in the gapped degenerate ground subspace of a spin-1 chain with nearest-neighbor two-body…
In the past decade quantum algorithms have been found which outperform the best classical solutions known for certain classical problems as well as the best classical methods known for simulation of certain quantum systems. This suggests…
We analyze some crucial questions regarding the practical feasibility of quantum simulation for lattice gauge models. Our analysis focuses on two models suitable for the quantum simulation of the Schwinger Hamiltonian, or QED in 1+1…
Quantum computers, with parallel computing and entanglement effects, excel in cryptography analysis and big data processing. However, they are not fully developed yet, and their performance needs further evaluation. Traditional computer…
Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and…
Lattice QCD calculations have been conducted using large-scale classical computers based on the Lagrangian formalism of field theory for the past 40 years. On the other hand, the advent of quantum computers has brought increasing attention…