Christophe Piveteau

which in turn are a variant of classical belief propagation decoding.

Thanks to @joerenes.bsky.social for the really enjoyable collaboration!

3/3

25.09.2025 08:06 — 👍 0    🔁 0    💬 0    📌 0

Our algorithm can be used to optimally(!) decode any classical linear code with an efficient trellis representation that is transmitted over a binary-input classical-quantum pure-state channel. As such, it can be considered a quantum analogue of the classical Viterbi/BCJR algorithms, ...

2/3

25.09.2025 08:05 — 👍 2    🔁 0    💬 1    📌 0

Efficient and optimal quantum state discrimination via quantum belief propagation We present an efficient quantum algorithm for a structured state discrimination problem we call the subspace decoding task. Building on this, we show that the algorithm enables efficient and optimal d...

Really excited about our new paper on quantum belief propagation (aka "belief propagation with quantum messages")!
arxiv.org/abs/2509.19441
Our new quantum algorithm solves a structured state discrimination problem which is central for quantum algorithm based on Regev's reduction (like DQI).

1/3

25.09.2025 08:04 — 👍 11    🔁 1    💬 1    📌 0

Finally, I'm super excited to announce that I will soon start a postdoc at Inria Paris in the COMSIQ group, funded by a SNF Postdoc.Mobility grant!
@snf-fns-ch.bsky.social

(4/4)

28.03.2025 09:42 — 👍 7    🔁 0    💬 0    📌 1

Combining quantum processors with real-time classical communication - Nature A 142-qubit processor can be realized by connecting two smaller quantum processors using classical communications and circuit cutting.

Circuit knitting protocols have gained some attention in recent years, because some people hope they could help us to do something useful with near term quantum devices. See for example www.nature.com/articles/s41... (work not by me) which experimentally implemented some of our protocols.

(3/4)

28.03.2025 09:41 — 👍 3    🔁 0    💬 1    📌 0

These techniques allow you to do cool things, like simulating a large quantum computer with smaller ones (usually called "circuit knitting" or "circuit cutting"), by dividing the circuit into smaller chunks. The simulation overhead grows exponentially with the amount of non-local interactions.
(2/3)

28.03.2025 09:39 — 👍 3    🔁 0    💬 1    📌 0

Simulating quantum circuits with restricted quantum computers It is one of the most fundamental objectives in quantum information science to understand the boundary between the computational power of classical and quantum computers. One possible avenue to explor...

Hey all! Just uploaded my PhD thesis on the arXiv, which I recently defended in January. Feel free to check it out! 🤗

arxiv.org/abs/2503.21773

It's about quasiprobabilistic algorithms to simulate quantum circuits - not just on classical computers, but also on restricted quantum computers.

(1/4)

28.03.2025 09:32 — 👍 21    🔁 1    💬 1    📌 0

Congratulations! 😊

04.12.2024 10:27 — 👍 1    🔁 0    💬 0    📌 0