<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Nagisa Hara | LIP6 - Équipe QI</title><link>https://qi.lip6.fr/fr/people/nagisa-hara/</link><atom:link href="https://qi.lip6.fr/fr/people/nagisa-hara/index.xml" rel="self" type="application/rss+xml"/><description>Nagisa Hara</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>fr</language><copyright>© 2022 LIP6 Quantum Information Team</copyright><lastBuildDate>Fri, 27 Jun 2025 00:00:00 +0000</lastBuildDate><image><url>https://qi.lip6.fr/media/icon_hu_bdeccd9e706ea09d.png</url><title>Nagisa Hara</title><link>https://qi.lip6.fr/fr/people/nagisa-hara/</link></image><item><title>Nagisa Hara - Not specified</title><link>https://qi.lip6.fr/fr/seminars/2025-06-27-nagisa-hara/</link><pubDate>Fri, 27 Jun 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/seminars/2025-06-27-nagisa-hara/</guid><description>&lt;h2 id="not-specified"&gt;Not specified&lt;/h2&gt;
&lt;p&gt;Ce séminaire, donné par Nagisa Hara, aura lieu le 27 June 2025, à 14:0.
Il aura lieu en salle Not specified.&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;Not specified&lt;/p&gt;</description></item><item><title>A classical proof of quantum knowledge for multi-prover interactive proof systems</title><link>https://qi.lip6.fr/fr/publication/4998853-a-classical-proof-of-quantum-knowledge-for-multi-prover-interactive-proof-systems/</link><pubDate>Thu, 20 Mar 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4998853-a-classical-proof-of-quantum-knowledge-for-multi-prover-interactive-proof-systems/</guid><description>&lt;p&gt;In a proof of knowledge (PoK), a verifier becomes convinced that a prover possesses privileged information. In combination with zero-knowledge proof systems, PoKs are an important part of secure protocols such as digital signature schemes and authentication schemes as they enable a prover to demonstrate possession of a certain piece of information (such as a private key or a credential), without revealing it. Formally, A PoK is defined via the existence of an extractor, which is capable of reconstructing the key information that makes a verifier accept, given oracle access to the prover. We extend the concept of a PoK in the setting of a single classical verifier and two quantum provers, and exhibit the PoK property for a non-local game for the local Hamiltonian problem. More specifically, we construct an extractor which, given oracle access to a provers&amp;rsquo; strategy that leads to high acceptance probability, is able to reconstruct the ground state of a local Hamiltonian. Our result can be seen as a new form of self-testing, where, in addition to certifying a pre-shared entangled state and the prover&amp;rsquo;s strategy, the verifier also certifies a local quantum state. This technique thus provides a method to ascertain that a prover has access to a quantum system, in particular, a ground state, thus indicating a new level of verification for a proof of quantumness.&lt;/p&gt;</description></item></channel></rss>