<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Jens Eisert | LIP6 - Équipe QI</title><link>https://qi.lip6.fr/fr/people/jens-eisert/</link><atom:link href="https://qi.lip6.fr/fr/people/jens-eisert/index.xml" rel="self" type="application/rss+xml"/><description>Jens Eisert</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>fr</language><copyright>© 2022 LIP6 Quantum Information Team</copyright><lastBuildDate>Wed, 11 Feb 2026 00:00:00 +0000</lastBuildDate><image><url>https://qi.lip6.fr/media/icon_hudf2fdaa51677944daa4f50609104ef9a_13950_512x512_fill_lanczos_center_3.png</url><title>Jens Eisert</title><link>https://qi.lip6.fr/fr/people/jens-eisert/</link></image><item><title>Complexity of geometrically local stoquastic Hamiltonians</title><link>https://qi.lip6.fr/fr/publication/5506374-complexity-of-geometrically-local-stoquastic-hamiltonians/</link><pubDate>Wed, 11 Feb 2026 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/5506374-complexity-of-geometrically-local-stoquastic-hamiltonians/</guid><description>&lt;p>The QMA-completeness of the local Hamiltonian problem is a landmark result of the field of Hamiltonian complexity that studies the computational complexity of problems in quantum many-body physics. Since its proposal, substantial effort has been invested in better understanding the problem for physically motivated important families of Hamiltonians. In particular, the QMA-completeness of approximating the ground state energy of local Hamiltonians has been extended to the case where the Hamiltonians are geometrically local in one and two spatial dimensions. Among those physically motivated Hamiltonians, stoquastic Hamiltonians play a particularly crucial role, as they constitute the manifestly sign-free Hamiltonians in Monte Carlo approaches. Interestingly, for such Hamiltonians, the problem at hand becomes more &amp;lsquo;&amp;lsquo;classical&amp;rsquo;&amp;rsquo;, being hard for the class MA (the randomized version of NP) and its complexity has tight connections with derandomization. In this work, we prove that both the two- and one-dimensional geometrically local analogues remain MA-hard with high enough qudit dimension. Moreover, we show that related problems are StoqMA-complete.&lt;/p></description></item><item><title>Complexity of geometrically local stoquastic Hamiltonians</title><link>https://qi.lip6.fr/fr/publication/4659421-complexity-of-geometrically-local-stoquastic-hamiltonians/</link><pubDate>Tue, 23 Jul 2024 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4659421-complexity-of-geometrically-local-stoquastic-hamiltonians/</guid><description>&lt;p>The QMA-completeness of the local Hamiltonian problem is a landmark result of the field of Hamiltonian complexity that studies the computational complexity of problems in quantum many-body physics. Since its proposal, substantial effort has been invested in better understanding the problem for physically motivated important families of Hamiltonians. In particular, the QMA-completeness of approximating the ground state energy of local Hamiltonians has been extended to the case where the Hamiltonians are geometrically local in one and two spatial dimensions. Among those physically motivated Hamiltonians, stoquastic Hamiltonians play a particularly crucial role, as they constitute the manifestly sign-free Hamiltonians in Monte Carlo approaches. Interestingly, for such Hamiltonians, the problem at hand becomes more &amp;lsquo;&amp;lsquo;classical&amp;rsquo;&amp;rsquo;, being hard for the class MA (the randomized version of NP) and its complexity has tight connections with derandomization. In this work, we prove that both the two- and one-dimensional geometrically local analogues remain MA-hard with high enough qudit dimension. Moreover, we show that related problems are StoqMA-complete.&lt;/p></description></item><item><title>Quantum certification and benchmarking</title><link>https://qi.lip6.fr/fr/publication/2317400-quantum-certification-and-benchmarking/</link><pubDate>Wed, 17 Jun 2020 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/2317400-quantum-certification-and-benchmarking/</guid><description>&lt;p>Concomitant with the rapid development of quantum technologies, challenging demands arise concerning the certification and characterization of devices. The promises of the field can only be achieved if stringent levels of precision of components can be reached and their functioning guaranteed. This Expert Recommendation provides a brief overview of the known characterization methods of certification, benchmarking, and tomographic recovery of quantum states and processes, as well as their applications in quantum computing, simulation, and communication.&lt;/p></description></item><item><title>Quantum certification and benchmarking</title><link>https://qi.lip6.fr/fr/publication/4990666-quantum-certification-and-benchmarking/</link><pubDate>Wed, 17 Jun 2020 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4990666-quantum-certification-and-benchmarking/</guid><description>&lt;p>Concomitant with the rapid development of quantum technologies, challenging demands arise concerning the certification and characterization of devices. The promises of the field can only be achieved if stringent levels of precision of components can be reached and their functioning guaranteed. This Expert Recommendation provides a brief overview of the known characterization methods of certification, benchmarking, and tomographic recovery of quantum states and processes, as well as their applications in quantum computing, simulation, and communication.&lt;/p></description></item></channel></rss>