Quantum Computing: Automaton, Games and Complexity

• Grant number: 13/20661-1
• Support Opportunities: Scholarships in Brazil - Master
• Start date: January 01, 2014
• End date: August 31, 2015
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Theory of Computation
• Principal Investigator: Arnaldo Vieira Moura
• Grantee: Fernando Granha Jeronimo
• Host Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil
• Associated scholarship(s): 14/06467-0 - Quantum computational complexity and entanglement, BE.EP.MS

Abstract

Quantum Computing is approximately 30 years old and already shows important results, capable of changing the course of computation as a science. However, once it is a recent field of study, there are many open questions. Several classical computing elements have quantum analogues whose properties are not yet totally understood. In this context, the present work intends to study three main areas: quantum automaton, quantum Merlin-Arthur and the relationship between quantum and classical complexity. The goal is to make a detailed research in each of these fields as well as to study in more depth one its open problems.

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

JERONIMO, Fernando Granha. Computação quântica: autômatos, jogos e complexidade. 2015. Master's Dissertation - Universidade Estadual de Campinas (UNICAMP). Instituto de Computação Campinas, SP.