Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
r of Unentanglement (Extended Abstract) Scott Aaronson MIT Salman Beigi MIT Andrew Drucker MIT Bill Fefferman University of Chicago Peter Shor MIT The class QMA (k), introduced by...
Scott Aaronson, Salman Beigi, Andrew Drucker, Bill...