<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Tom Douce | LIP6 - Équipe QI</title><link>https://qi.lip6.fr/fr/people/tom-douce/</link><atom:link href="https://qi.lip6.fr/fr/people/tom-douce/index.xml" rel="self" type="application/rss+xml"/><description>Tom Douce</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>fr</language><copyright>© 2022 LIP6 Quantum Information Team</copyright><lastBuildDate>Sat, 19 Mar 2022 00:00:00 +0000</lastBuildDate><image><url>https://qi.lip6.fr/media/icon_hudf2fdaa51677944daa4f50609104ef9a_13950_512x512_fill_lanczos_center_3.png</url><title>Tom Douce</title><link>https://qi.lip6.fr/fr/people/tom-douce/</link></image><item><title>Continuous-variable nonlocality and contextuality</title><link>https://qi.lip6.fr/fr/publication/2163802-continuous-variable-nonlocality-and-contextuality/</link><pubDate>Sat, 19 Mar 2022 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/2163802-continuous-variable-nonlocality-and-contextuality/</guid><description>&lt;p>Contextuality is a non-classical behaviour that can be exhibited by quantum systems. It is increasingly studied for its relationship to quantum-over-classical advantages in informatic tasks. To date, it has largely been studied in discrete variable scenarios, where observables take values in discrete and usually finite sets. Practically, on the other hand, continuous-variable scenarios offer some of the most promising candidates for implementing quantum computations and informatic protocols. Here we set out a framework for treating contextuality in continuous-variable scenarios. It is shown that the Fine&amp;ndash;Abramsky&amp;ndash;Brandenburger theorem extends to this setting, an important consequence of which is that nonlocality can be viewed as a special case of contextuality, as in the discrete case. The contextual fraction, a quantifiable measure of contextuality that bears a precise relationship to Bell inequality violations and quantum advantages, can also be defined in this setting. It is shown to be a non-increasing monotone with respect to classical operations that include binning to discretise data. Finally, we consider how the contextual fraction can be formulated as an infinite linear program, and calculated with increasing accuracy using semi-definite programming approximations.&lt;/p></description></item><item><title>Building trust for continuous variable quantum states</title><link>https://qi.lip6.fr/fr/publication/2163270-building-trust-for-continuous-variable-quantum-states/</link><pubDate>Mon, 01 Jun 2020 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/2163270-building-trust-for-continuous-variable-quantum-states/</guid><description>&lt;p>We first introduce heterodyne quantum state tomography, a reliable method for continuous variable quantum state certification which directly yields the elements of the density matrix of the state considered and analytical confidence intervals, using heterodyne detection. This method neither needs mathematical reconstruction of the data, nor discrete binning of the sample space, and uses a single Gaussian measurement setting. Beyond quantum state tomography and without its identical copies assumption, we also derive a general protocol for verifying continuous variable pure quantum states with Gaussian measurements against fully malicious adversaries. In particular, we make use of a De Finetti reduction for infinite-dimensional systems. As an application, we consider verified universal continuous variable quantum computing, with a computational power restricted to Gaussian operations and an untrusted non-Gaussian states source. These results are obtained using a new analytical estimator for the expected value of any operator acting on a continuous variable quantum state with bounded support over Fock basis, computed with samples from heterodyne detection of the state.&lt;/p></description></item><item><title>Probabilistic Fault-Tolerant Universal Quantum Computation and Sampling Problems in Continuous Variables</title><link>https://qi.lip6.fr/fr/publication/1931759-probabilistic-fault-tolerant-universal-quantum-computation-and-sampling-problems-in-continuous-variables/</link><pubDate>Tue, 29 Jan 2019 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/1931759-probabilistic-fault-tolerant-universal-quantum-computation-and-sampling-problems-in-continuous-variables/</guid><description>&lt;p>Continuous-Variable (CV) devices are a promising platform for demonstrating large-scale quantum information protocols. In this framework, we define a general quantum computational model based on a CV hardware. It consists of vacuum input states, a finite set of gates - including non-Gaussian elements - and homodyne detection. We show that this model incorporates encodings sufficient for probabilistic fault-tolerant universal quantum computing. Furthermore, we show that this model can be adapted to yield sampling problems that cannot be simulated efficiently with a classical computer, unless the polynomial hierarchy collapses. This allows us to provide a simple paradigm for short-term experiments to probe quantum advantage relying on Gaussian states, homodyne detection and some form of non-Gaussian evolution. We finally address the recently introduced model of Instantaneous Quantum Computing in CV, and prove that the hardness statement is robust with respect to some experimentally relevant simplifications in the definition of that model.&lt;/p></description></item></channel></rss>