Zoltán Zimborás
banner
zoltanzimboras.bsky.social
Zoltán Zimborás
@zoltanzimboras.bsky.social
Wigner's friend. Coincidentally also the Head of the Quantum Computing Group at Wigner RCP. Occasionally hired for the indirect observation of measurements.
Pinned
To reach some consensus about the prospects of near-term (late nisq and early fault tolerant) quantum computing, we had a 3-day discussion event (“Quantum Now”) in Lapland with both optimists and pessimists. This continued at SeeQA 2024 in Oxford. See our conclusions here arxiv.org/abs/2501.05694
Myths around quantum computation before full fault tolerance: What no-go theorems rule out and what they don't
In this perspective article, we revisit and critically evaluate prevailing viewpoints on the capabilities and limitations of near-term quantum computing and its potential transition toward fully fault...
arxiv.org
Super happy to see that our paper on the "Quantum generalizations of Glauber and Metropolis dynamics" with Anthony Chen, Csaba Czabán, João Doriguello, András Gilyén, Balázs Kabella, Michael Kastoryano, József Mák was accepted as a talk at #QIP2026 🎉🎉🎉
November 8, 2025 at 5:06 PM
Thanks a lot for visiting, Alex (@physicistalex.bsky.social)!
It was super nice and productive - we found a couple of nice platonic ideas concerning hyperbolic tilings and spin models.
Back from an exciting week visiting the great @zoltanzimboras.bsky.social in Budapest!

As you can see, I was also very busy pensively staring at Platonic solids at the Hungarian National Museum.
August 30, 2025 at 10:27 PM
The paper was a result of a wonderful collaboration with Lorenzo Grevink, @haferjonas.bsky.social , @markusheinrich.bsky.social, Jonas Helsen, Marcel Hinsche, Tommy Schuster that started during a discussion at the Random Quantum Circuits in Amsterdam.
In our new paper, we derive linear lower bounds on the circuit depth of Clifford, orthogonal, symplectic, matchgate designs (built of local gates from the respective groups).
Some statistical features of Haar unitaries can be well approximated in log depth, exponentially faster than previously thought. We give evidence that this is a 'truly quantum' effect by deriving linear lower bounds for orthogonal, Clifford, symplectic, matchgate groups
scirate.com/arxiv/2506.2...
July 1, 2025 at 2:30 PM
In our new paper, we derive linear lower bounds on the circuit depth of Clifford, orthogonal, symplectic, matchgate designs (built of local gates from the respective groups).
Some statistical features of Haar unitaries can be well approximated in log depth, exponentially faster than previously thought. We give evidence that this is a 'truly quantum' effect by deriving linear lower bounds for orthogonal, Clifford, symplectic, matchgate groups
scirate.com/arxiv/2506.2...
Will it glue? On short-depth designs beyond the unitary group
We provide a range of results on several groups of broad interest in quantum information science: the Clifford group, the orthogonal group, the unitary symplectic groups, and the matchgate group. For ...
scirate.com
July 1, 2025 at 2:28 PM
Reposted by Zoltán Zimborás
This is not the way for HTML papers to gain visibility, but it's a kind of fallback I suppose.

Last day's PDFs should be gradually coming back online, apologies for the delay.
ArXiv seems broken this morning, can't get the pdf of today's papers. (Btw, the html option still works, so one can access the papers in that form.)
@arxiv-quant-ph.bsky.social
June 11, 2025 at 2:15 PM
ArXiv seems broken this morning, can't get the pdf of today's papers. (Btw, the html option still works, so one can access the papers in that form.)
@arxiv-quant-ph.bsky.social
June 11, 2025 at 4:38 AM
Our new Majorana Propagation method is out! It can be used either alone as a classical simulation method or in conjunction with quantum subroutines, see @qzoeholmes.bsky.social's thread below.
(Btw, it's so efficient that it broke scirate: this and all papers after ours are missing from scirate.)
Hey! On the arXiv today we present `Majorana Propagation’ a new classical algorithm for simulating Fermionic circuits.

Depending on your mood... the algorithm can be viewed either as naturally suited to compete with, or collaboratively enhance, quantum hardware simulations.
March 25, 2025 at 5:22 PM
Happy to share that I will join University of Helsinki as a Professor at the Department of Physics. The team at UH has been incredibly welcoming, and I’m looking forward to working here. More to come soon (e.g., announcements of open postdoc, PhD positions)!
February 21, 2025 at 4:52 PM
Wow! Wonder how what Google map shows in Mexico....
Google map on my computer simply shows Gulf of America. The difference probably because google treats US users differently from international users.
February 11, 2025 at 3:40 PM
That was fast! Today on my Google Map:
February 11, 2025 at 12:30 PM
Recently, I was rereading Carl Sagan’s book, "The Demon-Haunted World: Science as a Candle in the Dark" published in 1995. I am just now randomly posting a paragraph from it; you know, any resemblance to actual events is purely coincidental.
February 9, 2025 at 5:55 PM
I am super happy that this work is out now in Nature Communications!
It was really fun to work and discuss with Charles ChunJun Cao, Wissam Chemissany and Alexander Jahn!

www.nature.com/articles/s41...
Overlapping qubits from non-isometric maps and de Sitter tensor networks - Nature Communications
For some states in quantum gravity, notions of locality can deviate from effective field theory predictions. Here, the authors show that such deviations can be recast in the quantum information framew...
www.nature.com
February 6, 2025 at 3:58 PM
Reposted by Zoltán Zimborás
"We do not yet have proven exponential quantum speedups for end-to-end applications in machine learning, optimization, quantum chemistry, or materials science that guarantee substantial commercial and financial value." arxiv.org/pdf/2501.05694
January 14, 2025 at 1:48 AM
To reach some consensus about the prospects of near-term (late nisq and early fault tolerant) quantum computing, we had a 3-day discussion event (“Quantum Now”) in Lapland with both optimists and pessimists. This continued at SeeQA 2024 in Oxford. See our conclusions here arxiv.org/abs/2501.05694
Myths around quantum computation before full fault tolerance: What no-go theorems rule out and what they don't
In this perspective article, we revisit and critically evaluate prevailing viewpoints on the capabilities and limitations of near-term quantum computing and its potential transition toward fully fault...
arxiv.org
January 13, 2025 at 4:00 PM