<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Naomi R Solomons | LIP6 - Équipe QI</title><link>https://qi.lip6.fr/fr/people/naomi-r-solomons/</link><atom:link href="https://qi.lip6.fr/fr/people/naomi-r-solomons/index.xml" rel="self" type="application/rss+xml"/><description>Naomi R Solomons</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>fr</language><copyright>© 2022 LIP6 Quantum Information Team</copyright><lastBuildDate>Wed, 09 Jul 2025 00:00:00 +0000</lastBuildDate><image><url>https://qi.lip6.fr/media/icon_hu_bdeccd9e706ea09d.png</url><title>Naomi R Solomons</title><link>https://qi.lip6.fr/fr/people/naomi-r-solomons/</link></image><item><title>A complexity transition in displaced Gaussian Boson sampling</title><link>https://qi.lip6.fr/fr/publication/5175875-a-complexity-transition-in-displaced-gaussian-boson-sampling/</link><pubDate>Wed, 09 Jul 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/5175875-a-complexity-transition-in-displaced-gaussian-boson-sampling/</guid><description>&lt;p&gt;Abstract Gaussian Boson Sampling (GBS) is the problem of sampling from the output of photon-number-resolving measurements of squeezed states input to a linear optical interferometer. For purposes of demonstrating quantum computational advantage as well as practical applications, a large photon number is often desirable. However, producing squeezed states with high photon numbers is experimentally challenging. In this work, we examine the computational complexity implications of increasing the photon number by introducing coherent states. This displaces the state in phase space and as such we call this modified problem Displaced GBS . By utilising a connection to the matching polynomial in graph theory, we first describe an efficient classical algorithm for Displaced GBS when displacement is high or when the output state is represented by a non-negative graph. Then we provide complexity theoretic arguments for the quantum advantage of the problem in the low-displacement regime and numerically quantify where the complexity transition occurs.&lt;/p&gt;</description></item><item><title>Anonymous and private parameter estimation in networks of quantum sensors</title><link>https://qi.lip6.fr/fr/publication/5458726-anonymous-and-private-parameter-estimation-in-networks-of-quantum-sensors/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/5458726-anonymous-and-private-parameter-estimation-in-networks-of-quantum-sensors/</guid><description>&lt;p&gt;Anonymity and privacy are two key properties of modern communication networks. In quantum networks, distributed quantum sensing has emerged as a powerful use case, with applications to clock synchronisation, detecting gravitational effects and more. In this work, we develop a new protocol that, for the first time, combines the different cryptographic properties of anonymity and privacy for the task of distributed parameter estimation. That is, we present a protocol that allows a selected subset of network participants to anonymously collaborate in estimating the average of their private parameters. Crucially, this is achieved without disclosing either the individual parameter values or the identities of the participants, neither to each other nor to the broader network.&lt;/p&gt;</description></item></channel></rss>