BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:A. K. Fedorov DTSTART:20240902T134000Z DTEND:20240902T144000Z DTSTAMP:20260423T022743Z UID:QOART/7 DESCRIPTION:Title: Qu antum complexity and quantum information technologies\nby A. K. Fedoro v as part of Quantum Optics and Related Topics\n\n\nAbstract\nComplexity i s the cornerstone concept of physics\, and it plays a special role in the context of quantum many-body physics. Recent progress in developing comput ational devices based on quantum effects and demonstrations of solving var ious tasks using them has actualized the question of the origin of the qua ntum advantage. Although various attempts to quantify and characterize the nature of quantum computational advantage have been made\, this question in the general context remains open: There is no universal approach that h elps to define a scope of problems that quantum computers are able to spee d up\, theoretically and in practice. In this talk\, we review an approach to this question based on the concept of complexity and reachability of q uantum states. On the one hand\, the class of quantum states that is of in terest for quantum computing should be complex\, i.e. non-simulatable with classical computers with less than exponential resources. On the other ha nd\, such quantum states should be reachable on a practical quantum comput er. This means that a unitary corresponding to the transformation of quant um states from initial to desired can be decomposed in a sequence of singl e- and two-qubit gates with of no more than polynomial in the number of qu bits. Our consideration paves the way towards understanding the scope of p roblems that can be solved by a quantum computer by formulating a sequence of statements and conjectures on various sets of quantum states.\n LOCATION:https://researchseminars.org/talk/QOART/7/ END:VEVENT END:VCALENDAR