# Introduction
Author: Alexandra Semposki
Many of the most intriguing problems known by the physics community are presently unreachable by classical computation. Diagonalization of high-dimensional matrices cannot be performed beyond a dimension of $10^{11}$ currently (see [Tsunoda, N., Otsuka, T., Takayanagi, K. et al. The impact of nuclear shape on the emergence of the neutron dripline. Nature 587, 66–71 (2020)](https://www.nature.com/articles/s41586-020-2848-x)), and the fermion sign problem pervades Quantum Monte Carlo (QMC) calculations. Instead of classical computers, we now look to quantum computers to provide aid on these frustrating limits of modern classical technology. The hope is that, in the near future---with the fast developments in the quantum computing (QC) world---we may be able to mitigate such issues with quantum computers, reducing time to run computationally challenging physics problems from exponential time to polynomial time. With this improvement, we might get results---during our lifespan---on problems that would have, on a classical computer, taken longer than the age of the universe to complete!
Quantum computers run in a similar way to classical computers: they use a form of bit called a qubit, and have quantum gates that perform transformations on these qubits, much like classical gates do on classical bits. However, there are a couple of stark differences between the two systems. One, a qubit can take many more possible values than a classical bit owing to their ability to be in a superposition of states, and two, quantum gates are reversible---hence they are unitary operators, a condition not necessary for gates in a classical circuit. Of course, with qubits and quantum gates comes the question: what about entanglement? Entanglement can occur and be induced between qubits on purpose using the gates, but qubits can also interact with the environment, causing a fair amount of error to arise. Is this the end for qubits? Not to worry! Error correction and mitigation are also fast advancing, with algorithms to correct for bit and phase flips developing and improving year by year.
There are many techniques used in QC that are worth investigating, and many have been and will be tremendously useful in the fields of few-body and many-body systems in physics. One that has been used quite often is the Variational Quantum Eigensolver (VQE), which can determine the ground state of an atomic system. It is very popular in Quantum Chemistry and there have been many applications of it in recent years---for example, [this PRL paper from 2018](https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.120.210501), where it is applied to the deuteron. VQE will be discussed in detail in the next chapter, but right now we will say that it is an application of the Variational Principle you most likely learned in your first ever Quantum Mechanics class in undergrad, with more bells and whistles and qubits of course! The next two chapters deal with circuit noise and dimensionality reduction techniques, respectively. We tackle the challenge problem of the one dimensional Gross-Pitaevskii in the final part of this journey, and then close with some conclusions and remarks.