Louis Vignoli

Louis Vignoli

@lvignoli.eu

FTQC at Pasqal

51 followers65 following82 posts

In the text there, they discuss that "it reduces the code distance by 1", so they stick to the intra-SE implementation for performance reason. It does not jump at me why exactly.

View full thread

And of course if you got all stoked by André Srchottenloer's unmasking of Google obfuscated ECC circuits, this is your opportunity to make it so that it runs for real on a quantum processor, with all the additional complexity it incurs 🥊 bsky.app/profile/crai...

Craig Gidney@craiggidney.bsky.social

Blog post: "The French have the Quantum Circuits" algassert.com/post/2602 André Schrottenloher just published a preprint showing how to construct quantum ECDLP circuits with costs similar to the ones in our zero knowledge proofs.

So if you got excited by Iceberg's Pinnacle, want to improve on Oratomic's runtimes, or have ideas revolving around RASCqL or , all of that in the settings of realistic hardware constraints over the next decade, this job is for you 🫶

A post from Gidney on this platform: bsky.app/profile/crai...

Craig Gidney@craiggidney.bsky.social

As timelines tighten, details might benefit attackers more than defenders. So we're trying something weird: proving a circuit exists without revealing it. For example, here's a zero-knowledge proof that we found 10x smaller quantum circuits for ECDLP: github.com/tanujkhattar...

Louis Vignoli reposted

The forward-looking Oratomic time-efficient architecture claims to "potentially enable runtimes of 10 days for ECC–256 with ≈26,000 qubits, and 97 days for RSA–2048 with ≈102,000." This is based on stitching together several gadgets and plausibly assuming they can work together on an atom platform.

I have yet to read it in details, but as I get it Appendix A outlines how to give a proof that « I know how to break dlog with this many qubit hours » without disclosing the actual technique. Now everyone can keep there little recipes while making substantiated warning claims.

As rightfully pointed out, this is not the common practices of the crypto communities. But one could argue there is commercial value in hiding their estimated distance to « Q-day and implementation details.

Having been logged off unexpectedly, I was surprised and thrilled to discover that @odpomery.bsky.social did the Bluesky login screen illustration, only to find out few hours later he actually did two! Such a treat to see an artist you cherish pop up at a place you value 😃 Thank you Owen!

Louis Vignoli reposted

After the CEA in France and Jülich in Germany, this is the 3rd QPU installed and operational in a European HPC center! Huge congrats to all my involved colleagues at @pasqal-quantum.bsky.social!

Pasqal@pasqal-quantum.bsky.social

Pasqal has delivered Italy’s first 140‑qubit neutral atom quantum computer, integrated with @cineca.bsky.social's Leonardo supercomputer. Co‑funded by @eurohpc-ju.bsky.social & ICSC, this operational system boosts Europe’s sovereign hybrid HPC–quantum infrastructure www.pasqal.com/newsroom/pas...

I am genuinely impressed that we can now build these machines, ship them and make them operate in the HPC constrained environment reliably. Part of the company structured itself precisely for this, but I am still amazed.

Louis Vignoli reposted

Fuck you people. Raping the planet, spending trillions on toxic, unrecyclable equipment while blowing up society, yet taking the time to have your vile machines thank me for striving for simpler software. Just fuck you. Fuck you all. I can't remember the last time I was this angry.

Congrats Philippe! Exciting times ahead 😀

Philippe Faist@phfaist.bsky.social

So this just happened 🎉 I'm profoundly excited about what's ahead and deeply grateful for all the support that everyone provided along the way! #ERCCoG

Yeah, states get close through a noisy Clifford circuit, what else to expect? And after all an encoded qubit is like a qubit. Logical memory error rate will converges to 0.5, just slower.

Louis Vignoli reposted

Replying to @deenamousa.com

If benchmark performance translated to reality, radiologists should be the canary in the coal mine of AI job loss. Instead, radiology residency slots hit a record high in 2025.

Similar to me is: paper consumption kept growing when digital word processors appeared, as they eased the production of documents. Only recently local stagnation was observed, that we can attribute to the overall digitization of processes. chrislang.org/2008/02/05/t... Graphs in footnote [4]

chrislang.orgThe Convention on Biodiversity, GM trees and paper consumptionThe CBD report on GM trees recommends a precautionary approach to the use of GM trees. A ban would be better.

It's amazing how jj is a pleasure to work with. 20 minutes ago I erased by mistake an _untracked_ file that I used to record progress while editing history on my local branch.

View full thread

It's amazing how jj is a pleasure to work with. 20 minutes ago I erased by mistake an _untracked_ file that I used to record progress while editing history on my local branch.

In 30 minutes, Pascal Scholl and I will give technical details on FTQC and how we do it at Pasqal, with the plans on the coming years. See you there!

Pasqal@pasqal-quantum.bsky.social

Exclusive Webinar on FTQC on July 10th 💡 You will learn more about: • Our strategy to perform FTQC in a relevant regime for applications • The key technological features required to perform FTQC with neutral atoms • The typical applications we envision targeting with FTQC ow.ly/FESM50Wce5x

It has been a hot day in Paris—currently 31°; and yet we are supposed to have hail! 🌨️ Friday evening picnic cancelled as the town closed all parks…

Louis Vignoli reposted

Forget the 10²⁵ years needed to simulate Google's Willow chip on world's fastest supercomputer. The most impressive number in quantum computing in this: It would take 3678 years for a quantum computing PhD student to earn the 103 million made by the IonQ CEO Niccolo de Masi in his first 90 days.

Louis Vignoli reposted

Replying to @craiggidney.bsky.social

This is a typical "making the hard part harder" paper. Making good qubits is *already* the hardest part. Replacing those qubits (2-level systems) with n-level systems isn't helping, it's hurting. But the increased difficulty is hard to quantify, whereas counting oscillators is easy, so here we are.