Enrico Rinaldi

The 𝐆𝐞𝐧𝐞𝐬𝐢𝐬 𝐌𝐢𝐬𝐬𝐢𝐨𝐧 announced by @WhiteHouse and led by @ScienceUnderSec is a landmark moment for the global scientific community and a powerful signal that computer-led scientific discovery has entered a new era.

Today, we launched Helios, a technological marvel redefining the possible. Helios is the most accurate quantum computer in the world, with 98 of the highest fidelity physical qubits ever released, and 48 error-corrected logical qubits. Learn more: quantinuum.com/blog/introduci…

Some thoughts on the recent Quantinuum magic state experiments: arxiv.org/abs/2506.14688 arxiv.org/abs/2506.14169 (Disclaimer: I am a coauthor of the second paper.)

We tested a pre-release version of o3 and found that it frequently fabricates actions it never took, and then elaborately justifies these actions when confronted. We were surprised, so we dug deeper 🔎🧵(1/) x.com/OpenAI/status/…

Re Carlo si preoccupava di non rovinare la lingua di Dante in Aula. Gli ho mostrato il nostro meglio. Buona visione ✨

Quantum advantage on a "real" problem (i.e. not random circuit sampling) from @QuantinuumQC phys.org/news/2025-04-s…

Exciting progress from our partnership with RIKEN, Japan’s top research institute and operator of the Fugaku supercomputer. A new paper in Physical Review Research marks the first big result from our quantum-HPC collaboration: researchers from RIKEN, Quantinuum, and Keio University showed how quantum information can be “scrambled” using a special quantum circuit. This insight could deepen our understanding of quantum chaos, thermalization—and even black holes. Read more in our blog post here: lnkd.in/gcXxeFNa Read the paper here: lnkd.in/gyBP3Bfv

A thread on knots. Every knot K has a corresponding Jones polynomial V(t), a Laurent polynomial in one complex variable. Computing the Jones is hard. The Jones is a knot invariant: if V neq V', then K and K' are topologically inequivalent. 1/6

@newscientist covers our work at @QuantinuumQC on pushing both quantum and classical algorithms for a famous problem in knot theory: evaluating the Jones polynomial. This problem is quantum native and, therefore, a good candidate for exhibiting exponential quantum advantage.

This is what it is like to drive a huge American SUV in a Japanese city. This clip is being shared in response to the Trump administration's claims that Japanese aren't buying enough American cars because of unfair trade barriers.

A fair comparison of classical and quantum algorithms to simulate quantum matter. A specific physics problem running on Quantinuum System Model H2 shows the reliability of quantum computing when classical techniques are failing. Exciting times ahead!

We’re marking a major milestone in the intersection of AI and quantum computing with our latest paper, published in partnership with @GoogleDeepMind, in @NatMachIntell. Read more in our blogpost here: quantinuum.com/blog/quantinuu…

A poster at a train station in Tokyo warns against unconscious bias: The speaker is assuming the transfer student isn't Japanese based on their physical appearance and praising his Japanese ability. If he was born and raised in Japan, this compliment could hurt his feelings.

As the only quantum computing company with a quantum computer powerful enough that it can't be simulated, Quantinuum has published a unique and highly influential paper on an end-to-end quantum algorithm that only a quantum computer can solve efficiently. quantinuum.com/blog/untanglin…

🥇Announcing the 1st commercial application for quantum computers! Quantinuum, along with our partners JPMorganChase, @Argonne, @ORNL, and @UTAustin, have turned our quantum computer into a reliable and accessible source of high-quality randomness. 🔗quantinuum.com/blog/quantinuu…

Starting this new session about Error correction & Error mitigation at #AI4Quantum with @enricesena from @QuantinuumQC! ☺️ 🗣️Denoising #quantum circuits: from optimal circuit to mitigated results using #AI #conference #science #DCAI @novonordiskfond

@MvsCerezo After the @gppcarleo reply the waiting became unbearable. I have to stop watching.

Waiting for the DWave reply

@gppcarleo @dventu @NASA @MatthiasTroyer @MSFTResearch Now we know: arxiv.org/abs/2503.08247

Almost exactly 8 years ago, I was presenting at the 2016 APS March Meeting in Baltimore (chair @dventu of @NASA) a variational method to classically simulate adiabatic quantum optimization. The complete draft of that work with Bela Bauer and @MatthiasTroyer of @MSFTResearch has been sitting in a drawer until now. Check it out here arxiv.org/abs/2403.05147 ! In a nutshell: we show that a two-body time dependent jastrow wave function captures well the full unitary quantum dynamics--also in the non-adiabatic regime--in 1D lattices, in the Sherrington-Kirkpatrick model, in the 2D Chimera Graph, up to 108 qubits. We also show some qualitative differences between the hardness of specific instances in quantum annealing and classical annealing. Since people will ask, let me immediately clarify this: we did not simulate the specific adiabatic schedule and geometries as proposed by @dwavequantum and collaborators in their latest preprint on computational supxxxxxy, simply because...well, it was 2016. It would be interesting to see what happens in that case, though the hunch is that there should be no qualitative differences to the 2D Chimera Graph we studied. However, who knows...

The dawn of the Hybrid Quantum-Supercomputer era has begun. quantinuum.com/press-releases…

Developing quantum algorithms involves combining well-crafted building blocks, much like building a house entails setting the foundation, framing the structure, and adding a roof. arxiv.org/abs/2412.17706