Workshop on Quantum and Classical Complexity
Riga, Latvia, July 7 2013

Satellite event to ICALP 2013

Accepted papers    Workshop program   Registration (PLEASE REGISTER NOW!)    Workshop organization

Sponsored by:

     
European Research Council
Ministry of Education, Culture, Sports, Science and Technology in Japan
Turku University Foundation

Outline

The workshop should be devoted to discussions on its title area. Submissions including non-finished ideas to raise discussion are possible and indeed welcomed. Also, well-written tutorials on specific topics can be accepted as contributions.

Call for papers

Authors are cordially welcomed to send their contributions belonging to the workshop title area and following the outline to Mika Hirvensalo (email: mikhirve@utu.fi) in any usual electronic form. All contributions will be peer-reviewed.
The authors are supposed to prepare the final versions of accepted papers with LaTeX.

Schedule

Invited speakers

Accepted papers

Marek Cygan (University of Warsaw)
François Le Gall (University of Tokyo)
  • Andris Ambainis, Kaspars Balodis, Jānis Iraids, Raitis Ozols, and Juris Smotrovs: Parameterized Quantum Query Complexity of Graph Collision.
  • Dmitry Kravchenko: A New Quantization Scheme for Classical Games.
  • Raqueline A. M. Santos and Alexander Rivosh: A Closer Look at Discrete-Time Quantum Walk NAND Formulae Evaluation Algorithm
  • Abuzer Yakaryılmaz: Public qubits versus private coins

Workshop proceedings can be downloaded here (pdf)

Program

9:00-9:30 Registration and opening
9:30-10:30 Marek Cygan: Algebraic algorithms: ranks, determinants and derivatives (Invited talk)
10:30-11:00 Coffee break
11:00-11:30 Andris Ambainis, Kaspars Balodis, Jānis Iraids, Raitis Ozols, and Juris Smotrovs: Parameterized Quantum Query Complexity of Graph Collision.
11:30-12:00 Abuzer Yakaryılmaz: Public qubits versus private coins
12:00-13:30 Lunch break
13:30-14:30 François Le Gall: Quantum Complexity of Matrix Multiplication (Invited talk)
14:30-15:00 Dmitry Kravchenko: A New Quantization Scheme for Classical Games.
15:00-15:30 Raqueline A. M. Santos and Alexander Rivosh: A Closer Look at Discrete-Time Quantum Walk NAND Formulae Evaluation Algorithm
15:30-16:00 Coffee break
16:00-17:00 M. Hirvensalo: Geometric tools for automata complexity (Tutorial)

Registration

No registration fee is collected, but we kindly request anyone willing to participate to fill in and submit the registration form. We can guarantee the workshop benefits (coffee service, proceedings, etc) only to a limited number of participants, so please fill in the registration form as soon as possible.

Workshop information

Organizers:

Mika Hirvensalo (University of Turku, Finland) and Abuzer Yakaryılmaz (University of Latvia)

Program committee:

Farid Ablayev (Kazan State University, Tatarstan, Russia)
Andris Ambainis (University of Latvia)
Pınar Heggernes (University of Bergen, Norway)
Mika Hirvensalo (University of Turku, Finland)
Juraj Hromkovic (ETH Zürich, Switzerland)
Jarkko Kari (University of Turku, Finland)
Akinori Kawachi (Tokyo Institute of Technology, Japan)
Abuzer Yakaryılmaz (University of Latvia)

Workshop venue

The workshop will take place in auditorium 12 of the main building of University of Latvia (Raiņa bulvāris 19). See ICALP 2013 pages for travel information.

Further Information

For general information about Riga, please visit ICALP 2013 website. Specific information about the workshop will follow soon.
Last Modified 4.7.2013 by Mika Hirvensalo