<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Matty J Hoban | LIP6 - Équipe QI</title><link>https://qi.lip6.fr/fr/people/matty-j-hoban/</link><atom:link href="https://qi.lip6.fr/fr/people/matty-j-hoban/index.xml" rel="self" type="application/rss+xml"/><description>Matty J Hoban</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>fr</language><copyright>© 2022 LIP6 Quantum Information Team</copyright><lastBuildDate>Tue, 27 Nov 2018 00:00:00 +0000</lastBuildDate><image><url>https://qi.lip6.fr/media/icon_hu_bdeccd9e706ea09d.png</url><title>Matty J Hoban</title><link>https://qi.lip6.fr/fr/people/matty-j-hoban/</link></image><item><title>A simple protocol for fault tolerant verification of quantum computation</title><link>https://qi.lip6.fr/fr/publication/2164407-a-simple-protocol-for-fault-tolerant-verification-of-quantum-computation/</link><pubDate>Tue, 27 Nov 2018 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/2164407-a-simple-protocol-for-fault-tolerant-verification-of-quantum-computation/</guid><description>&lt;p&gt;With experimental quantum computing technologies now in their infancy, the search for efficient means of testing the correctness of these quantum computations is becoming more pressing. An approach to the verification of quantum computation within the framework of interactive proofs has been fruitful for addressing this problem. Specifically, an untrusted agent (prover) alleging to perform quantum computations can have his claims verified by another agent (verifier) who only has access to classical computation and a small quantum device for preparing or measuring single qubits. However, when this quantum device is prone to errors, verification becomes challenging and often existing protocols address this by adding extra assumptions, such as requiring the noise in the device to be uncorrelated with the noise on the prover&amp;rsquo;s devices. In this paper, we present a simple protocol for verifying quantum computations, in the presence of noisy devices, with no extra assumptions. This protocol is based on post hoc techniques for verification, which allow for the prover to know the desired quantum computation and its input. We also perform a simulation of the protocol, for a one-qubit computation, and find the error thresholds when using the qubit repetition code as well as the Steane code.&lt;/p&gt;</description></item><item><title>One-Sided Device-Independent Certification of Unbounded Random Numbers</title><link>https://qi.lip6.fr/fr/publication/2125360-one-sided-device-independent-certification-of-unbounded-random-numbers/</link><pubDate>Mon, 02 Jul 2018 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/2125360-one-sided-device-independent-certification-of-unbounded-random-numbers/</guid><description>&lt;p&gt;The intrinsic non-locality of correlations in Quantum Mechanics allow us to certify the behaviour of a quantum mechanism in a device independent way. In particular, we present a new protocol that allows an unbounded amount of randomness to be certified as being legitimately the consequence of a measurement on a quantum state. By using a sequence of non-projective measurements on single state, we show a more robust method to certify unbounded randomness than the protocol of [5], by moving to a one-sided device independent scenario. This protocol also does not assume any specific behaviour of the adversary trying to fool the participants in the protocol, which is an advantage over previous steering based protocols. We present numerical results which confirm the optimal functioning of this protocol in the ideal case. Furthermore, we also study an experimental scenario to determine the feasibility of the protocol in a realistic implementation. The effect of depolarizing noise is examined, by studying a potential state produced by a networked system of ion traps.&lt;/p&gt;</description></item></channel></rss>