nLab
type theory quantum computing
Considering how type theory can be used in quantum computing
This page is a work in progress.
Idea
Apply type theory to quantum computing to obtain interesting results/algorithms/lower bounds/etc.
Todo
- What do we mean by “type theory”?
- What results could be hope to replicate? Obtain?
- How will this be used? As a simple tool when checking proofs, or say as a way of deriviing results? Does it matter?
Areas to consider applying this to
- Hamiltonian complexity?
- Computational-complexity phase transitions?
Last revised on February 20, 2014 at 15:47:05.
See the history of this page for a list of all contributions to it.