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.
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.
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.
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.
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.
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.
The seminar will be devoted to results of http://www.nature.com/articles/ncomms7908. A major application of quantum communication is the distribution of entangled particles for use in quantum key distribution.
Director of Institute of Theoretical and Applied Informatics (ITAI) invites young researchers to submit an application to Visegrad Scholarship Program and perform research at ITAI PAS.
In atomic clocks, the frequency of a local oscillator is stabilized based on the feedback signal obtained by periodically interrogating an atomic reference system...
