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.
To conclude our discussion of precision, we note that even as the number of classically<br />
simulable quantum systems grows through the discovery of new algorithms, it is gener-<br />
ally believed that classical computation is not able to approximate any general quantum-<br />
mechanical system. If it could, then there would be no speedup of quantum computation<br />
over classical; a classical method would then exist for factoring, searching, and all other<br />
quantum algorithms, by classical simulation of a quantum simulator. For the quantum<br />
systems for which no classical approximation is known, quantum simulation is an attractive<br />
possibility, despite the inherent precision limitations.<br />
1.4.3 Scalability<br />
Scalability is the study of how to take a small number of faulty systems and connect them<br />
to form one arbitrarily large, reliable system. This is an important subject in quantum<br />
computation; the solution of computationally hard problems requires such a network of<br />
qubits. To begin with, we note that a digital quantum simulator is a quantum computer<br />
that may not have a universal set of gates; that is, it may not require sufficient controls to<br />
simulate any Hamiltonian, but rather just the Hamiltonian of the problem of interest. A<br />
quantum simulator may not need the same degree of control, but the problem of scalability<br />
is the same. Analog systems will also be composed of many distinct subsystems, but the<br />
form of the scaled-up architecture may be different. For example, an optical lattice presents<br />
a framework for simulating the Bose-Hubbard model on a large scale, but one does not need<br />
the ability to control the internal states of individual atoms, or to implement deterministic<br />
two-atom gates, that would be necessary for digital quantum simulation.<br />
There is still the question of how large a quantum system will need to be to imple-<br />
ment quantum dynamics that are intractable on a classical computer. A recent benchmark<br />
[RMR + 07] sets the record, to our knowledge, of exactly simulating 36 interacting spin-1/2<br />
systems on a supercomputer. The importance of this number is that even if a given idea for<br />
scalability does not lead to arbitrarily large systems, it may still be of great use as a quan-<br />
tum simulator, and be able to exactly simulate quantum dynamics that classical computers<br />
cannot. To scale to this or a larger number of subsystems, however, requires a system that<br />
satisfies certain conditions. These are important for creating a system in which sufficient<br />
control is available to execute a given simulation, and to measure the result.<br />
DiVincenzo criteria<br />
To begin the discussion of scalability, we present the five basic DiVincenzo criteria [DiV00],<br />
which are the generally agreed-upon requirements for a scalable quantum computer. Al-<br />
though these were originally proposed for quantum computation, they still hold for less-<br />
general quantum simulations, albeit in a modified form, and we review them here.<br />
1. A scalable physical system with well-defined qubits.<br />
34