<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Yaroslav Herasymenko | LIP6 - QI Team</title><link>https://qi.lip6.fr/people/yaroslav-herasymenko/</link><atom:link href="https://qi.lip6.fr/people/yaroslav-herasymenko/index.xml" rel="self" type="application/rss+xml"/><description>Yaroslav Herasymenko</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><copyright>© 2022 LIP6 Quantum Information Team</copyright><lastBuildDate>Fri, 04 Oct 2024 00:00:00 +0000</lastBuildDate><image><url>https://qi.lip6.fr/media/icon_hu_bdeccd9e706ea09d.png</url><title>Yaroslav Herasymenko</title><link>https://qi.lip6.fr/people/yaroslav-herasymenko/</link></image><item><title>Yaroslav Herasymenko - Efficient learning of quantum states prepared with few fermionic non-Gaussian gates</title><link>https://qi.lip6.fr/seminars/2024-10-04-yaroslav-herasymenko/</link><pubDate>Fri, 04 Oct 2024 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/seminars/2024-10-04-yaroslav-herasymenko/</guid><description>&lt;h2 id="efficient-learning-of-quantum-states-prepared-with-few-fermionic-non-gaussian-gates"&gt;Efficient learning of quantum states prepared with few fermionic non-Gaussian gates&lt;/h2&gt;
&lt;p&gt;This seminar, given by Yaroslav Herasymenko, will happend on 04 October 2024, at 12:0.
It will take place in Room 26-00/534.&lt;/p&gt;
&lt;p&gt;Find a map of the campus &lt;a href="https://sciences.sorbonne-universite.fr/vie-de-campus-sciences/accueil-vie-pratique/plan-du-campus" target="_blank" rel="noopener"&gt;here&lt;/a&gt;.&lt;/p&gt;
&lt;h2 id="abstract"&gt;Abstract&lt;/h2&gt;
&lt;p&gt;The aim of quantum state tomography is to learn the full quantum state from data obtained by measurements. Without prior assumptions on the state, this task is prohibitively hard; and only a few classes of states are currently known to be efficiently learnable. In this talk, I would like to present an efficient algorithm for learning states on n fermion modes prepared by any number of Gaussian and at most t non-Gaussian gates. By Jordan-Wigner mapping, it extends to n-qubit states produced by nearest-neighbor matchgate circuits with at most t SWAP-gates. Our algorithm is based exclusively on single-copy measurements and produces a classical representation of a state, guaranteed to be close in trace distance to the target state. The sample and time complexity of the algorithm is poly(n,2^t); thus if t=O(log(n)), it is efficient. I will detail why this performance is optimal, under the common cryptographic assumption of LWE hardness. Finally, I will present our property testing algorithm, and explain why our tomography algorithm is efficient for some target states arising in many-body physics.&lt;/p&gt;</description></item></channel></rss>