Program

10:00-10:30	Registration + COFFEE
10:30-11:30	(Invited talk) Rusins Freivalds: Permutation Groups and the Strength of Quantum Finite Automata with Mixed States
11:30-12:00	Marats Golovkins, Maksim Kravtsev, and Vasilijs Kravcevs: On a Class of Languages Recognizable by Probabilistic Reversible Decide-and-Halt Automata
12:00-12:30	Ilze Dzelme-Berzina: First Order Logic and Acceptance Probability of Quantum Finite State Automata
	LUNCH
14:00-14:30	Lelde Lace: Nondeterministic quantum query with minimal complexity
14:30-15:30	(Invited talk) Andris Ambainis: CANCELLED. Replacing talk: M. Hirvensalo: Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages
	COFFEE
16:00-17:00	(Invited talk) Farid Ablayev: Classical Simulation Complexity of Bounded-error and Unbounded-error Quantum Branching Programs
17:00-17:30	Alina Dubrovska, Taisia Mischenko-Slatenkova, and Alexander Rivosh: Quantum Query Algorithms for Certain Problems and Generalization of Algorithm Designing Techniques