Custom Menu
Latest From Our Blog
Michał Oszmaniec Quantum Information Research Group
Quantin.pl is a website of the Quantum Information Group led by dr. Michał Oszmaniec. We study quantum information under the restrictions on resources that are allowed to be used. Such limitations arise from the difficulty to implement in practice the most general quantum-information protocols. In our research we use the combination of convex analysis, group theory, high-dimensional analysis and numerical simulations.
Michał Oszmaniec, michał, oszmaniec, quantum information, quantum, qbit, quantum computing
17803
home,page-template,page-template-full_width,page-template-full_width-php,page,page-id-17803,,vertical_menu_enabled,wpb-js-composer js-comp-ver-5.4.5,vc_responsive
 
Theory of Quantum Computation

Research group led by Michał Oszmaniec

ABOUT OUR GROUP

We study quantum information under the restrictions on resources that are allowed to be used. Such limitations arise from the difficulty to implement in practice the most general quantum-information protocols. In particular, we are interested in the following research topics:

 

  • identification of resources promoting restricted models of computation (based on bosonic and fermionic linear optics) to universality,
  • efficient classical simulation of quantum processes,
  • relative power of POVMs and projective measurements in quantum theory,
  • quantum metrology.

 

In our research we use the combination of convex analysis, group theory, high-dimensional analysis and numerical simulations.

PUBLICATIONSTEAMCOLLABORATIONS

A figure presenting schematically extensions of some restricted model of quantum computation (RQC) by adding extra resources (like extra gates for example) represented by the dashed arrow. Some resources, when added, lead to another restricted class of computation (RQC’) that still may not be interesting from the computational perspective. Some resources promote RQC to universal quantum computation UQC, whereas for others one lands in the grey region representing situation when the exact computational power is not known.