Recent publication (Spring 2018)
A recently published paper from our group's members on applying quantum-inspired procedures to real-life examples!
"A Quantum inspired optimization method based on VNS applied to dynamic garbage collection which is a notable real world problem" coauthored by QUIT members has been published in Algrorithms!
See full paper at: http://www.mdpi.com/1999-4893/11/4/38
Recent publications (Winter 2018)
Recently published papers from our group's members!
"Andronikos, T., Singh, A., Giannakis, K., & Sioutas, S. (2017, September). Computing probabilistic queries in the presence of uncertainty via probabilistic automata. In International Workshop on Algorithmic Aspects of Cloud Computing (pp. 106-120). Springer, Cham."
"Andronikos, T., Sirokofskich, A., Kastampolidou, K., Varvouzou, M., Giannakis, K., & Singh, A. (2018). Finite automata capturing winning sequences for all possible variants of the PQ penny flip game. Mathematics, 6(2), 20."
Special Issue announcement
We are announcing the editing of a Special Issue by some members of our group. For more details, you can check the page on the left.
Submission deadline: January 31st, 2017
Submission deadline extended
The submission deadline for the NUBACoM 2016 workshop that our group is organizing, has been extended.
New submission deadline: September 20th, 2016
Successful PhD defense
The final proceedings of the IISA conference are online by IEEE Xplore. Our group participated with two submissions, "Quantum automata for infinite periodic words" and "Initialization methods for the TSP with Time Windows using Variable Neighborhood Search".
Also, the group's work entitled "Associating ω-automata to path queries on Webs of Linked Data" and authored by Konstantinos Giannakis, Georgia Theocharopoulou, Christos Papalitsas, Theodore Andronikos, and Panayiotis Vlamos has been accepted and published online in "Engineering Applications of Artificial Intelligence" by Elsevier.
Recent publication by our group members
The work of various group's members entitled "Dominant Strategies of Quantum Games on Quantum Periodic Automata" has been published in the journal "Computation" by MDPI. You can see it here.
Accepted submissions by our members, with exceptional evaluations
Congratulations to the undergraduate students of the QUIT group Kalliopi Kastampolidou and Alexandros Singh for the acceptance of their submissions in the student conference organized by the University of Macedonia, with praising comments and excellent evaluations.
Their works are entitled “Novel Methods of Programming in Quantum Computing Systems” and “Schrödinger's Vote: Social, Economic, and Political Aspects of Quantum Games”.
Recent publication by our group members
The work of K. Giannakis and T. Andronikos entitled "Membrane automata for modeling biomolecular processes" has been accepted and published in the highly respected "Natural Computing" journal by Springer. You can see it here.
The Computers of Our Wildest Dreams
Engineers at IBM and Google claim they're closer than ever to making computers that could process data in days that would take millions of years to flow through today's machines. (source and more)
Programming the Quantum Future
The earliest computers, like the ENIAC, were rare and heroically difficult to program. That difficulty stemmed from the requirement that algorithms be expressed in a "vocabulary" suited to the particular hardware available, ranging from function tables for the ENIAC to more conventional arithmetic and movement operations on later machines. Introduction of symbolic programming languages, exemplified by FORTRAN, solved a major difficulty for the next generation of computing devices by enabling specification of an algorithm in a form more suitable for human understanding, then translating this specification to a form executable by the machine. The "programming language" used for such specification bridged a semantic gap between the human and the computing device. It provided two important features: high-level abstractions, taking care of automated bookkeeping, and modularity, making it easier to reason about sub-parts of programs. (source and more)
A little light interaction leaves quantum physicists beaming
A team of physicists has taken a step toward making the essential building block of quantum computers out of pure light. Their advance has to do with logic gates that perform operations on input data to create new outputs. (source and more)