Headed to #TQC2026. Actually my first TQC! Deadlines just usually worked out for me to submit to QIP instead 😄

I'm moving from Austin to #Philadelphia next month. I'll continue working remotely with Blanqet. If anyone has tips for a Quantum Computing Researcher in the Philadelphia area, please share! I look forward to being so close to colleagues and friends on the east coast. See you soon!

My paper "Even quantum advice is unlikely to solve PP" is now published in the journal Theory of Computation. doi.org/10.4086/toc....

Nice to visit the Blanqet office in Chicago for the first time

I'll be at IEEE Quantum Week in Albuquerque this week on behalf of Blanqet. I'll be there Wed. to Fri., in particular for the Workshop on Quantum Algorithms for Financial Applications on Thu. Looking forward to networking. Let me know if you're around and want to chat!

My PhD dissertation at @utaustin.bsky.social is now available online. "Quantum complexity of physically inspired problems and computational resources" doi.org/10.26153/tsw...

Post-PhD, I'm now working as a Quantum Computing Researcher & Consultant at Blanqet. It's a very young startup formed by an incredible group of professors. blanqet.net

Blanqet

Breaking Barriers in Science and Technology

blanqet.net

Officially Justin Yirka, Ph.D. I graduated from @utaustin.bsky.social this weekend.

Happy to say our work "Quantum Search with In-Place Queries" was accepted to TQC!

Justin Yirka@justinyirka.bsky.social · last yr.

Just released a new paper on arXiv: "Quantum Search with In-Place Queries." Check it out: scirate.com/arxiv/2504.0... Work with Sandia National Labs, coauthors Blake Holman and Ronak Ramachandran In short, we develop a new quantum search algorithm. #Quantum #QuantumComputing #arXiv

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

Thanks to the UT Graduate School for showcasing my work on quantum computing and Hamiltonian complexity 📸⚛️ @utaustin.bsky.social www.instagram.com/p/DIMeMjPPtHm/

Just released a new paper on arXiv: "Quantum Search with In-Place Queries." Check it out: scirate.com/arxiv/2504.0... Work with Sandia National Labs, coauthors Blake Holman and Ronak Ramachandran In short, we develop a new quantum search algorithm. #Quantum #QuantumComputing #arXiv

My PhD Defense is this Wednesday! 🎓 For my dissertation "Quantum Complexity of Physically Inspired Problems and Computational Resources." With committee Scott Aaronson, Bill Fefferman, Nick Hunter-Jones, and David Soloveichik. It will be open to the public on campus (Zoom link by request).

Today I posted a short preprint: "A Note on the Complexity of the Spectral Gap Problem". I describe a problem left open by my first paper, with Sev Gharibian. I include a small improvement, and I make a conjecture.

A Note on the Complexity of the Spectral Gap Problem

The problem of estimating the spectral gap of a local Hamiltonian is known to be contained in the class $P^{QMA[log]}$: polynomial time with access to a logarithmic number of QMA queries. The problem ...

arxiv.org

Looking forward to @qip2025.bsky.social. I'll be there Tuesday to Friday - say hi!

🎓 I'm graduating this May with a PhD in #QuantumComputing from @utaustin.bsky.social with Scott Aaronson. I'm now seeking a role outside academia. I would appreciate your support! If you hear of any opportunities or want to chat, please send me a message or reply below. www.justinyirka.com

www.justinyirka.com

Hello world / Hello BlueSky