Zoltán Zimborás
@zoltanzimboras.bsky.social
510 followers 460 following 17 posts
Wigner's friend. Coincidentally also the Head of the Quantum Computing Group at Wigner RCP. Occasionally hired for the indirect observation of measurements.
Posts Media Videos Starter Packs
Pinned
zoltanzimboras.bsky.social
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
zoltanzimboras.bsky.social
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.
physicistalex.bsky.social
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.
zoltanzimboras.bsky.social
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.
zoltanzimboras.bsky.social
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).
markusheinrich.bsky.social
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...
zoltanzimboras.bsky.social
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).
markusheinrich.bsky.social
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
Reposted by Zoltán Zimborás
dginev.bsky.social
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.
zoltanzimboras.bsky.social
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
zoltanzimboras.bsky.social
Yes, at least the HTML papers got visibility 😀.
Btw, the pdfs were in deed back in the afternoon. Thx, for reacting fast!
zoltanzimboras.bsky.social
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
zoltanzimboras.bsky.social
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.)
qzoeholmes.bsky.social
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.
zoltanzimboras.bsky.social
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)!
zoltanzimboras.bsky.social
Wow! Wonder how what Google map shows in Mexico....
ghe1121.bsky.social
Google map on my computer simply shows Gulf of America. The difference probably because google treats US users differently from international users.
zoltanzimboras.bsky.social
That was fast! Today on my Google Map:
zoltanzimboras.bsky.social
I use my quantum crystals every morning
zoltanzimboras.bsky.social
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.
zoltanzimboras.bsky.social
The central idea of our work is that the difficulty of counting degrees of freedom in quantum gravity has a nice quantum info analogue: Verifying the size of a Hilbert space with qubit operations ("overlapping qubits problem") .
Stay tuned for further works on this!
Reposted by Zoltán Zimborás
vva.bsky.social
"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
zoltanzimboras.bsky.social
Great experiment! Let us see whether meme people are willing to use latex/tikzpic (even if they are of the simplest form) instead of the usual "write your text here" meme apps. Btw, I like the color change.
zoltanzimboras.bsky.social
Funny suggestion 😀.
Actually, these meters were made with a short tikzpicture code that one can find directly in the paper's latex source (one just has to enter a number indicating the angle of the meter).
zoltanzimboras.bsky.social
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