Combinatorial algorithms for perturbation theory and application on quantum computing

<p>Quantum computing is an emerging area between computer science and physics. Numerous problems in quantum computing involve quantum many-body interactions. This dissertation concerns the problem of simulating arbitrary quantum many-body interactions using realistic two-body interactions. To address this issue, a general class of techniques called perturbative reductions (or perturbative gadgets) is adopted from quantum complexity theory and in this dissertation these techniques are improved for experimental considerations. The idea of perturbative reduction is based on the mathematical machinery of perturbation theory in quantum physics. A central theme of this dissertation is then to analyze the combinatorial structure of the perturbation theory as it is used for perturbative reductions.</p>

Name thesis:degree_name

Doctor of Philosophy (PhD)

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Year

2016

Author dc:creator

• Cao, Yudong

Contributors dc:contributor

• Sabre Kais
• Mikhail J. Atallah
• David Gleich
• Ahmed Sameh

• Pure sciences
• Applied sciences
• Cellular automata
• Computational complexity
• Many-body interactions
• Perturbation theory
• Quantum mechanics
• Symmetric polynomials
• Computer Sciences
• Quantum Physics

Repository record dc:identifier

https://docs.lib.purdue.edu/open_access_dissertations/908

OAI identifier oai:identifier

oai:docs.lib.purdue.edu:open_access_dissertations-2127