In this talk, we shortly introduce the emerging field quantum software (quantum programming and quantum machine learning), and then we discuss how we can be involved and then shape the field. We explain why education is our primary focus and how we can use pedagogical tools to attract new generation and people to the field. We share our own experiences, our ongoing projects, and also our upcoming projects. At the end, we discuss possible collaborations.
The central limit theorem (CLT) and the law of the iterated logarithm (LIL) are, along the strong law of large numbers (SLLN), the most common limit theorems. Some well-known results concerning limit theorems, obtained mainly due to the martingale method, are gathered in . Although the asymptotic behaviour of stationary and ergodic Markov chains is already well investigated, limit theorems for a wider class of Markov processes are still the subject of research. Together with D. Czapla and K.
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.
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.
Waldemar Kłobus, Uniwersytet Adama Mickiewicza w Poznaniu
13/04/2016 - 13:15
We develop a general operational framework that formalizes the concept of conditional uncertainty in a measure-independent fashion. The formalism is built around a mathematical relation that we call conditional majorization. We define and characterize conditional majorization, and use it to develop tools for the construction of measures of the conditional uncertainty of individual measurements, and also of the joint conditional uncertainty of sets of measurements.