Check out our paper with Lennart, @jenseisert.bsky.social, Weiyuan, and Louis! ⚛️ Here's the results, and the story that led to this paper (which I found quite interesting as a story of research discovery in this new AI era of research): 👇
Antonio Anna Mele
@antonioannamele.bsky.social
Thinking about Quantum information at Freie Universität Berlin antonioannamele.com
It has been a very fun project with Google Quantum AI team. OTOCs observable do not concentrate in deep random circuits of system-scale depth! 🏜️
Francesco Anna Mele@francescoannamele.bsky.social · 5d agoRemember one of the invited talk at QIP26? It was about an experiment run on Google’s quantum computer as a promising way to experimentally demonstrate verifiable quantum advantage. This became colloquially known as “Quantum Echoes” 1/
How does classical behaviour emerge from quantum mechanics? In our new paper, we answer this question through the lens of Gaussian state learning. arxiv.org/pdf/2609.26705
In our new work, we show that strong unitary designs--ensembles that are indistinguishable from Haar random unitaries even by algorithms granted not only forward access, but also inverse, complex conjugate, and transpose access--can be generated in logarithmic time, without any chill-qubits.
This is exactly the kind of public and constructive discussion I was hoping to see! Robert Huang is talking about the impact of AI and the social norms around its use in our qinfo community www.youtube.com/live/vT5blu-...
Talk by Hsin-Yuan Huang (Caltech)
YouTube video by Simons Institute for the Theory of Computing
youtube.com
We know LLMs can one-shot quantim information papers now, and even write decent manuscripts. What's the consensus of proper practice for what to do with those AI-generated papers? I review the proof, I sign my name, acknowledge the it is AI made, put it on arxiv, rinse, repeat?
In the absence of quantum error correction, circuits of #quantumcomputers can be logarithmically deep. www.nature.com/articles/s41...
New paper on the arXiv arxiv.org/abs/2512.10214 with my totally amazing coauthor Lennart Bittel! We solve a fundamental open question in quantum information theory and tomography: What is the optimal (query) complexity of quantum process tomography?
Super happy to share that our paper "Learning quantum states of continuous-variable systems" has been published in Nature Physics 🎉 www.nature.com/articles/s41...
Learning quantum states of continuous-variable systems - Nature Physics
Finding a classical description of a quantum state can require resource-intensive tomography protocols. It has now been shown that, for bosonic systems, tomography is extremely inefficient in general,...
nature.com
Just a friendly reminder that there are currently two ads for postdocs at Los Alamos National Laboratory: Quantum Simulations of fermionic systems apply here: lanl.jobs/search/jobde... Quantum Simulations for nuclear physics apply here: lanl.jobs/search/jobde... Shares appreciated
Quantum Computing and Early Fault-Tolerant Simulations at Los Alamos National Laboratory
Los Alamos National Laboratory is Hiring! Search available jobs or submit your resume now by visiting this link. Please share with anyone you feel would be a great fit.
lanl.jobs
Super happy to see that two of our papers were accepted as talks at QIP 2026 🎉 - A complete theory of the Clifford commutant arxiv.org/abs/2504.12263. - Efficient learning of bosonic Gaussian unitaries arxiv.org/abs/2510.05531.
A complete theory of the Clifford commutant
The Clifford group plays a central role in quantum information science. It is the building block for many error-correcting schemes and matches the first three moments of the Haar measure over the unit...
arxiv.org
The only thing that could possibly be hotter than Italian twins explaining entanglement in Italian is Italian triplets explaining the GHZ state.
Francesco Anna Mele@francescoannamele.bsky.social · 11mo agoHappy to share our TEDx talk where me and my twin @antonioannamele.bsky.social chat about quantum technologies! (Italian only) youtu.be/yzXUsDUPt8A?...
I’m super happy to share that I have been awarded the 2025 Google PhD Fellowship -- announced yesterday at blog.google/outreach-ini... 🥳 The fellowship “recognizes outstanding graduate students doing exceptional and innovative research in areas relevant to computer science and related fields.”
Announcing the 2025 Google PhD Fellows
Today, we are announcing the recipients of the 2025 Google PhD Fellowship Program.
blog.google
Super happy to share our new preprint today on ArXiv: 🥳 arxiv.org/pdf/2510.05531 It’s about efficient learning of bosonic Gaussian unitaries with provable recovery guarantees in a physically motivated accuracy metric: the "energy-constrained diamond-norm".
The saga of *quantum learning theory with CV systems* never ends! And indeed, when you look closely at this field, many natural and promising questions arise. For instance: How to learn CV Gaussian unitaries? arxiv.org/pdf/2510.05531 1/
We recently posted 2 works on quantum resource theories: arxiv.org/abs/2506.19696, arxiv.org/abs/2507.10851 👂Huh? Yall want more? We got you covered with a NEW work Analyzing the free states of one quantum resource theory as resource states of another arxiv.org/abs/2507.11793
Characterizing quantum resourcefulness via group-Fourier decompositions
In this work we present a general framework for studying the resourcefulness in pure states for quantum resource theories (QRTs) whose free operations arise from the unitary representation of a group....
arxiv.org
New work on Quantum resource theories! arxiv.org/abs/2507.10851 A big thanks to my collaborators @antonioannamele.bsky.social Pablo Bermejo Paolo Braccia Andrew Deneris @martinlaroo.bsky.social and specially@mvscerezo.bsky.social We provide a unifying framework leading to new free operations 🧵⬇️
A unified approach to quantum resource theories and a new class of free operations
In quantum resource theories (QRTs) certain quantum states and operations are deemed more valuable than others. While the determination of the ``free'' elements is usually guided by the constraints of...
arxiv.org
Just had the chance to spend a wonderful week in Florence, attending the “Understanding Quantum Machine Learning” workshop ggi.infn.it/showevent.pl... organized by Leonardo Banchi, Giacomo De Palma, Anderson M. Hernandez & Dario Trevisan, at the charming Galileo Galilei Institute. 🇮🇹
ggi.infn.it
Super happy to see our beautiful work out — led by the amazing Los Alamos team — now on arXiv: “Characterizing Quantum Resourcefulness via Group-Fourier Decompositions” lnkd.in/dQWhG4my. Check out Marco’s great summary!
This link will take you to a page that’s not on LinkedIn
lnkd.in
Marco Cerezo@mvscerezo.bsky.social · last yr.🚨Excited to share our new paper "Characterizing quantum resourcefulness via group-Fourier decompositions" from last year's LANL Quantum Computing summer School📘 arxiv.org/abs/2506.19696 !
Glad to see our Clifford commutant paper accepted as a talk at TQC 2025 happening later this year in India! 🥳
Antonio Anna Mele@antonioannamele.bsky.social · last yr.🧵 Super excited to finally share our new paper 🎉 Together with the dream team- Lennart Bittel, @jenseisert.bsky.social, Lorenzo Leone, @sfeoliviero.bsky.social - we present a full theory of the Clifford commutant ⚡, a central object in quantum information. ⚛️ 📄 arxiv.org/abs/2504.12263
A complete theory of the Clifford commutant scirate.com/arxiv/2504.1... The Clifford group is ubiquitous in quantum information science, with applications in benchmarking, quantum error correction and learning algorithms. Understanding which operators commute with is a powerful tool.
🧵 Super excited to finally share our new paper 🎉 Together with the dream team- Lennart Bittel, @jenseisert.bsky.social, Lorenzo Leone, @sfeoliviero.bsky.social - we present a full theory of the Clifford commutant ⚡, a central object in quantum information. ⚛️ 📄 arxiv.org/abs/2504.12263
A complete theory of the Clifford commutant
The Clifford group plays a central role in quantum information science. It is the building block for many error-correcting schemes and matches the first three moments of the Haar measure over the unit...
arxiv.org
I'm excited to share a new preprint about learning unitary operators of mildly-interacting fermions! arxiv.org/abs/2504.11318 @antonioannamele.bsky.social posed this very interesting question to me and I'm glad to have made progress towards it.
Mildly-Interacting Fermionic Unitaries are Efficiently Learnable
Recent work has shown that one can efficiently learn fermionic Gaussian unitaries, also commonly known as nearest-neighbor matchcircuits or non-interacting fermionic unitaries. However, one could ask ...
arxiv.org
I'm super happy to see this paper out on ArXiv today: arxiv.org/abs/2504.11318 by @vishnu-psiyer.bsky.social, presenting a quantum algorithm to learn t-doped fermionic Gaussian unitaries. This work solves one of the open questions we raised in our previous paper: journals.aps.org/prxquantum/a....
Mildly-Interacting Fermionic Unitaries are Efficiently Learnable
Recent work has shown that one can efficiently learn fermionic Gaussian unitaries, also commonly known as nearest-neighbor matchcircuits or non-interacting fermionic unitaries. However, one could ask ...
arxiv.org
Happy to announce that our paper is now published in @quantum-journal.bsky.social . We show that deciding whether a given dataset, formed by a few Majorana correlation functions estimates, can be consistent with a free-fermionic state is an NP-complete problem. quantum-journal.org/papers/q-202...
Super happy to see our work "Efficient learning of quantum states prepared with few fermionic non-Gaussian gates" now published in PRX Quantum. ⚛️ 🥳 Huge thanks to my incredible coauthor Yaroslav Herasymenko for the fun collaboration! 🚀 Catch our talk at #QIP2025 to learn more!
Efficient Learning of Quantum States Prepared With Few Fermionic Non-Gaussian Gates
A novel tomography algorithm with provably optimal run-time can uncover fundamental properties of a broad class of states and provide efficient circuit compilation.
journals.aps.org
Check out the great Bluesky-thread by Armando about our recent work. ⚛️ We show that ‘typical’ noisy circuits can be efficiently simulated classically for any local noise and circuit architecture — in contrast to fault-tolerantly designed noisy circuits. ⚡️
Armando Angrisani@aangrisani.bsky.social · 2y agoIn arXiv:2501.13101, we explore a broad class of noisy circuits across all geometries, significantly relaxing the strict assumptions on geometric locality and noise models imposed by prior works.
Another amazing paper from our Summer School student @antonioannamele.bsky.social (is that 3 papers already?!) and from our collaboration with the power house that are @aangrisani.bsky.social and @quantummanuel.bsky.social, from @qzoeholmes.bsky.social! 's incredible group. arxiv.org/abs/2501.13101
Armando Angrisani@aangrisani.bsky.social · 2y agoJust released two papers on classical simulation of quantum circuits with arbitrary local noise! arxiv.org/abs/2501.13101 arxiv.org/abs/2501.13050 🧵👇