activity
20022023
most citedMulti-Head Finite Automata: Characterizations, Concepts and Open Problems

23 citations · 59 across the 13 of their papers we have counts for

collaborators
Showing quant-phShow all

1 paper · 1 filter

quant-ph2002★ 3 cited

A common algebraic description for probabilistic and quantum computations

Martin Beaudry, Jose M. Fernandez, Markus Holzer

We study the computational complexity of the problem SFT (Sum-free Formula partial Trace): given a tensor formula F over a subsemiring of the complex field (C,+,.) plus a positive…