Ph.D. Thesis - Physics
Ph.D. Thesis - Physics
Ph.D. Thesis - Physics
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Digital<br />
Analog<br />
Classical Quantum<br />
Space: 2nO(log 1/ǫ)<br />
Time: T22n Space: 2n Time: T<br />
Precision: O(log 1/ǫfix)<br />
Space: n<br />
Time: Tn 2 O(1/ǫ)<br />
Space: n<br />
Time: T O(1/ǫ)<br />
Table 1.2: A comparison of the resources required for digital and analog simulation of<br />
quantum systems, using both classical and quantum systems, and taking into account the<br />
precision obtained. We consider a system of n qubits simulated for a total time T. The error<br />
due to projection noise is denoted ǫ, while the fixed error of a classical analog computer is<br />
denoted ǫfix.<br />
each additional decimal place of precision. Therefore, a factor of log(1/ǫ) multiplies the<br />
space requirement of 2 n qubits. It is interesting that the cost of increasing the precision<br />
differs so greatly between classical and quantum simulation: for classical, digital systems,<br />
one requires additional space that is polynomial in the precision, while for quantum simula-<br />
tion one requires additional time that is exponential in the precision! For a classical analog<br />
simulation, by contrast, in which each state amplitude is represented as a continuous vari-<br />
able, there will ultimately be some level of noise that limits the precision with which each<br />
value may be represented. This may be quantified as a fixed error ǫfix. For classical analog<br />
simulation, the precision is ultimately limited by this fixed error, scaling as log(1/ǫfix). We<br />
summarize the resource requirements for simulation in light of the obtainable precision in<br />
Table 1.2.<br />
So far we have considered numerically exact classical simulations, which attempt to<br />
mimic the full quantum dynamics of a quantum system, which is always inefficient with<br />
respect to the system size. However, there do exist classical algorithms that can solve cer-<br />
tain problems exactly or approximately, and for many problems such methods are entirely<br />
sufficient. Three well-known numerical (and approximate) methods are the numerical renor-<br />
malization group (NRG) [Wil75], density matrix renormalization group (DMRG) [Whi04],<br />
and quantum Monte Carlo methods. Although each method is applicable to many prob-<br />
lems, each also has inherent limitations to the types of problems that may be simulated.<br />
The NRG and DMRG algorithms work only in cases for which the original system Hamilto-<br />
nian may be mapped to a local Hamiltonian defined on a one-dimensional chain [VMC08].<br />
Monte Carlo methods, by contrast, fail to efficiently simulate fermionic systems, due to the<br />
so-called “negative-sign problem” [TW05]. Nevertheless, new methods are still being found<br />
for simulating additional classes of quantum systems. Notable examples are a method<br />
for simulation of 1-D quantum spin chains [Vid04] and the recently-discovered projected<br />
entangled-pair state [VC08] and time-evolving block decimation [Vid07] algorithms, which<br />
have been applied to the simulation of 2-D quantum spin lattices [JOV + 08] for the case of<br />
translational invariance, when an infinite lattice is assumed.<br />
33