<feed xmlns="http://www.w3.org/2005/Atom"> <id>https://perso.telecom-paristech.fr/tnemoz/</id><title>Tristan Nemoz's site</title><subtitle>A blog dedicated to my research on Quantum information, and which is to be used as a personal portfolio.</subtitle> <updated>2025-08-12T15:25:37+02:00</updated> <author> <name>Tristan Nemoz</name> <uri>https://perso.telecom-paristech.fr/tnemoz/</uri> </author><link rel="self" type="application/atom+xml" href="https://perso.telecom-paristech.fr/tnemoz/feed.xml"/><link rel="alternate" type="text/html" hreflang="en" href="https://perso.telecom-paristech.fr/tnemoz/"/> <generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator> <rights> © 2025 Tristan Nemoz </rights> <icon>/tnemoz/assets/img/favicons/favicon.ico</icon> <logo>/tnemoz/assets/img/favicons/favicon-96x96.png</logo> <entry><title>Exactly computing the trace distance between binary phase states and Haar random ones</title><link href="https://perso.telecom-paristech.fr/tnemoz/posts/exactly-computing-the-trace-distance-between-phase-states-and-haar-random-ones/" rel="alternate" type="text/html" title="Exactly computing the trace distance between binary phase states and Haar random ones" /><published>2025-03-09T16:40:00+01:00</published> <updated>2025-08-12T15:25:19+02:00</updated> <id>https://perso.telecom-paristech.fr/tnemoz/posts/exactly-computing-the-trace-distance-between-phase-states-and-haar-random-ones/</id> <content type="text/html" src="https://perso.telecom-paristech.fr/tnemoz/posts/exactly-computing-the-trace-distance-between-phase-states-and-haar-random-ones/" /> <author> <name>Tristan Nemoz</name> </author> <category term="Research" /> <summary>Introduction Prologue The very first thing I’ve worked on upon starting my PhD is Pseudorandom Quantum States, or PRS for short. In particular, I realized that in the proof of Brakerski and Shmueli, one inequality was unnecessarily loose, meaning that we could improve the bound on the trace distance. It was definitely not worth writing anything about it, and so I forgot about it. Some time late...</summary> </entry> <entry><title>Coding the AlphaZero search algorithm from scratch - Part 2: Implementing the MCTS algorithm</title><link href="https://perso.telecom-paristech.fr/tnemoz/posts/coding-the-alphazero-search-algorithm-from-scratch-part-2/" rel="alternate" type="text/html" title="Coding the AlphaZero search algorithm from scratch - Part 2: Implementing the MCTS algorithm" /><published>2024-08-15T15:50:00+02:00</published> <updated>2025-02-13T01:21:03+01:00</updated> <id>https://perso.telecom-paristech.fr/tnemoz/posts/coding-the-alphazero-search-algorithm-from-scratch-part-2/</id> <content type="text/html" src="https://perso.telecom-paristech.fr/tnemoz/posts/coding-the-alphazero-search-algorithm-from-scratch-part-2/" /> <author> <name>Tristan Nemoz</name> </author> <category term="Personal projects" /> <summary>Now that we’ve seen in the previous article how the MCTS algorithms works, let us implement it on an actual game: chess! The reasons why I chose this game are: I’m familiar with chess, and thus can understand what the frick the AI is doing; AlphaZero is supposed to work well when playing chess, so we’re supposed to see some improvements between the pure MCTS version and the improved AlphaZ...</summary> </entry> <entry><title>Coding the AlphaZero search algorithm from scratch - Part 1: Presentation of the MCTS algorithm</title><link href="https://perso.telecom-paristech.fr/tnemoz/posts/coding-the-alphazero-search-algorithm-from-scratch-part-1/" rel="alternate" type="text/html" title="Coding the AlphaZero search algorithm from scratch - Part 1: Presentation of the MCTS algorithm" /><published>2024-07-25T20:24:00+02:00</published> <updated>2024-10-28T01:10:52+01:00</updated> <id>https://perso.telecom-paristech.fr/tnemoz/posts/coding-the-alphazero-search-algorithm-from-scratch-part-1/</id> <content type="text/html" src="https://perso.telecom-paristech.fr/tnemoz/posts/coding-the-alphazero-search-algorithm-from-scratch-part-1/" /> <author> <name>Tristan Nemoz</name> </author> <category term="Personal projects" /> <summary>One algorithm I’ve always been fascinated with is AlphaZero. I’ve wondered for quite some time how good it would be if I made it play other games. So, in order to figure it out, and to deepen my understanding of it, I decided to code it myself. This post is part of a series about AlphaZero. You can find the other posts here. Part 1: Presentation of the MCTS algorithm Part 2: Impl...</summary> </entry> </feed>
