<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Michał Studziński | LIP6 - Équipe QI</title><link>https://qi.lip6.fr/fr/people/micha%C5%82-studzinski/</link><atom:link href="https://qi.lip6.fr/fr/people/micha%C5%82-studzinski/index.xml" rel="self" type="application/rss+xml"/><description>Michał Studziński</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>fr</language><copyright>© 2022 LIP6 Quantum Information Team</copyright><lastBuildDate>Mon, 26 May 2025 00:00:00 +0000</lastBuildDate><image><url>https://qi.lip6.fr/media/icon_hu_bdeccd9e706ea09d.png</url><title>Michał Studziński</title><link>https://qi.lip6.fr/fr/people/micha%C5%82-studzinski/</link></image><item><title>Michał Studziński - Entanglementrecycling in quantum universal programmable processors</title><link>https://qi.lip6.fr/fr/seminars/2025-05-26-micha%C5%82-studzinski/</link><pubDate>Mon, 26 May 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/seminars/2025-05-26-micha%C5%82-studzinski/</guid><description>&lt;h2 id="entanglementrecycling-in-quantum-universal-programmable-processors"&gt;Entanglementrecycling in quantum universal programmable processors&lt;/h2&gt;
&lt;p&gt;Ce séminaire, donné par Michał Studziński, aura lieu le 26 May 2025, à 9:0.
Il aura lieu en salle 24-25/405.&lt;/p&gt;
&lt;p&gt;Vous trouverez un plan du campus &lt;a href="https://sciences.sorbonne-universite.fr/vie-de-campus-sciences/accueil-vie-pratique/plan-du-campus" target="_blank" rel="noopener"&gt;ici&lt;/a&gt;.&lt;/p&gt;
&lt;h2 id="résumé"&gt;Résumé&lt;/h2&gt;
&lt;p&gt;We study a model of a quantum universal programmable processor basedon variants of port-based teleportation schemes. The main goal ofthis talk is to evaluate the performance of such a processor aftermultiple rounds of execution, with the quantum program encoded withinit. We analytically characterize the degradation of the processorand, in the case where the resource state consists of N EPR pairs, wedemonstrate the possibility of reusing it for subsequent rounds ofteleportation in the limit N→∞. For an optimized processor, wecompare the performance of the protocol to that of multi-port-basedteleportation, showing that resource state reuse remains possible.Results are presented for both probabilistic and deterministicprocessors and rely on mathematical tools inspired by the mixedSchur-Weyl duality. Speaker: Michał Studziński, International Centre for Theory of QuantumTechnologies, University of Gdańsk, Poland&lt;/p&gt;</description></item><item><title>Multicopy quantum state teleportation with application to storage and retrieval of quantum programs</title><link>https://qi.lip6.fr/fr/publication/4704752-multicopy-quantum-state-teleportation-with-application-to-storage-and-retrieval-of-quantum-programs/</link><pubDate>Sat, 21 Sep 2024 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4704752-multicopy-quantum-state-teleportation-with-application-to-storage-and-retrieval-of-quantum-programs/</guid><description>&lt;p&gt;This work considers a teleportation task for Alice and Bob in a scenario where Bob cannot perform corrections. In particular, we analyse the task of \textit{multicopy state teleportation}, where Alice has $k$ identical copies of an arbitrary unknown $d$-dimensional qudit state $\vert\psi\rangle$ to teleport a single copy of $\vert\psi\rangle$ to Bob using a maximally entangled two-qudit state shared between Alice and Bob without Bob&amp;rsquo;s correction. Alice may perform a joint measurement on her half of the entangled state and the $k$ copies of $\vert\psi\rangle$. We prove that the maximal probability of success for teleporting the exact state $\vert\psi\rangle$ to Bob is $p(d,k)=\frac{k}{d(k-1+d)}$ and present an explicit protocol to attain this performance. Then, by utilising $k$ copies of an arbitrary target state $\vert\psi\rangle$, we show how the multicopy state teleportation protocol can be employed to enhance the success probability of storage and retrieval of quantum programs, which aims to universally retrieve the action of an arbitrary quantum channel that is stored in a state. Our proofs make use of group representation theory methods, which may find applications beyond the problems addressed in this work.&lt;/p&gt;</description></item><item><title>Optimal universal quantum circuits for unitary complex conjugation</title><link>https://qi.lip6.fr/fr/publication/4055434-optimal-universal-quantum-circuits-for-unitary-complex-conjugation/</link><pubDate>Fri, 31 Mar 2023 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4055434-optimal-universal-quantum-circuits-for-unitary-complex-conjugation/</guid><description/></item></channel></rss>