Agnis Skuskovniks

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Measure Many Quantum Finite Automaton is not the strongest known model of quantum automaton but, it is still an open question what is the class of languages recognized by it when only bounded error probability is allowed. In this paper a natural class of ”word set” regular languages are studied. A proof that in general case the class can not be recognized(More)
Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a referee. The players cannot communicate but may share common random bits or a common quantum state. A referee sends an(More)
  • 1