- Author: Piotr Gawron | Post date: 22.09.2017 | Last modified: 18.06.201818/10/2017 - 12:00Andrzej Wodecki, Uniwersytet Marii Curie-Skłodowskiej w LublinieIn past years we witness the flourishing of artificial intelligence, both in methods and in various applications. This is largely due to the ever-increasing availability of essential tools (software, infrastructure), knowledge, and growing interest in the industry more and more willing to invest in such solutions.
- Author: Piotr Gawron | Post date: 04.09.2017 | Last modified: 18.06.2018
Date:27/09/2017 - 13:15
Speaker:Marek Sawerwain, Uniwersytet Zielonogórski
The quantum entanglement is considered as one of the most important notions of quantum computing. The entanglement is a feature of quantum systems and it is used as a basis for many quantum algorithms and protocols. In this presentation we analyze the level of entanglement for the quantum switch, during its work. The level of entanglement during the correct operating may be compared with the situation when a noise is present in the analyzed system. The noise changes the level of quantum entanglement and we utilize this observation to evaluate if the switch works properly.
- Author: Piotr Gawron | Post date: 04.08.2017
Director of the Institute of Theoretical and Applied Informatics, Polish Academy of Sciences (ITAI PAS) announces an open competition for a research assistant position in project Semantic tensor networks for large data sets analysis.
- Author: Piotr Gawron | Post date: 12.06.2017 | Last modified: 18.06.2018
Date:21/06/2017 - 13:15
Speaker:Dardo Goyeneche, Jagiellonian University
We present a link between the combinatorial notion of orthogonal arrays and k-uniform states, i.e., multipartite pure states such that every reduction to k parties is maximally mixed. As consequence, simple constructions of 1 and 2 uniform states for homogeneous (N qudits) and heterogeneous systems (e.g. N qubits + M qutrits) are derived.
- Author: Piotr Gawron | Post date: 05.06.2017 | Last modified: 18.06.2018
Date:07/06/2017 - 13:15
Speaker:Bogusław Cyganek, Akademia Górniczo-Hutnicza
Classical methods for processing and analysis of multidimensional signals – such as color videos and hyperspectral images – do not exploit full information contained in inner their factors. On the other hand, recently developed tensor based methods allow for data representation and analysis which directly account for data multidimensionality. Examples can be found in many applications such as face recognition, image synthesis, video analysis, surveillance systems, sensor networks, data stream analysis, marketing and medical data analysis, to name a few.
- Author: Piotr Gawron | Post date: 31.03.2017 | Last modified: 07.06.2017
Date:27/04/2017 - 13:15
Speaker:Piotr Faliszewski, Akademia Górniczo-Hutnicza
In this presentation, I will discuss a number of issues related to the problem of selecting a group of candidates (referred to as the committee). Committee elections have applications ranging from shortlisting, through the issue of finding items to present on a store's website, to parliamentary elections (or, on a smaller scale, the problem of choosing the electors at a university). I will show simulation results for a number of multiwinner rules and discuss these rules' computational complexity and axiomatic properties.
- Author: Zbigniew Puchała | Post date: 30.03.2017 | Last modified: 18.06.2018
Date:05/04/2017 - 13:15
Speaker:Anna Francuz, Uniwersytet Jagielloński
During the presentation I will introduce the formalism of tensor networks and introduce their relevance to describe the basic states of many-body systems. Then I will introduce the simplest model with topological order presented by Alexei Kitaev, known as the toric code. On his example, I will construct a Projected Entangled Pair States (PEPS) tensor network that describes the basic state of the model and will present the purpose of my project, ie, investigating anion excitation statistics.
- Author: Jarosław Miszczak | Post date: 15.02.2017 | Last modified: 18.06.2018
Date:22/02/2017 - 13:00
Speaker:Nikolay Nahimov, University of Latvia
Quantum walks are quantum counterparts of classical random walks.
They have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems.
Most of the results, however, consider a search space containing a single marked element only.
We show that if the search space contains more than one marked element the quantum speed-up may disappear.
About the Institute
Institute of Theoretical and Applied Informatics, Polish Academy of Sciences is a research institute whose science activity concentrates in the area of Information Technology. The Institute is also involved in training an advanced level technical and scientific staff and both initiates and participates in projects aimed at development of innovative commercial sector. ITAI takes part in realization of Polish Academy of Sciences' mission of advancement promotion, integration and dissemination of Polish science and contributes to education and national culture.