This publication in Theory of Computing is a great cap on my grad school career. My dissertation was all about *theory*, and Theory of Computing is a top-tier respected journal. So, I get one last stamp/sticker/win on my theory work as I start my industry career.
It turns out I was able to fix Scott's bug using another of Scott's results, plus a couple new lemmas.
(Specifically, I showed YQP* is contained in APP and thus is PP-low).
(Scott has joked YQP stands for "Yoda Quantum Polynomial Time"... now some friends joke it stands for "Yirka Quantum Polynomial Time".)
This project has a great story. My adviser, Scott Aaronson, asked me around 2021 if I could fix an error in one of his old papers. I had no idea how, but one day I was reading about a weird complexity class, YQP, in another one of Scott's papers.
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...
Just $995 each!
I had no idea there was competition for the name 😅.
I'm working with Blanqet, the 'q' is apparently very important.
Just to name a few team members: Bill Fefferman, Sean Hallgren, Liang Jiang, Yevgeniy Dodis, and my PhD advisor Scott Aaronson.
Blanqet is based in Chicago, and I'll be working out of Austin.
Hoping to share more details in the future!
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
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!
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.
Thanks to the UT Graduate School for showcasing my work on quantum computing and Hamiltonian complexity 📸⚛️
@utaustin.bsky.social
www.instagram.com/p/DIMeMjPPtHm/
Bill is now on my PhD dissertation committee.
I think this is the first time I've disproved someone's published conjecture, so I'm happy Bill just seems happy about it 😄
Before I started my PhD at UT, I attended AQIS 2018 in Japan. I spoke with Bill Fefferman in Kyoto, and he suggested a conjecture of his for me to work on: that no Grover-style quantum speedup was possible using an in-place query model.
We develop a new quantum search algorithm that achieves the same quantum advantage as Grover's algorithm but in a novel input model that prevents the quantum reflections at the core of Grover's algorithm.
I'm really happy with this project, because it has a great story. 🔖
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 revisited the idea over the years, and could never prove the impossibility. Well, in summer 2024, I realized why: the conjecture is false!
This new paper presents an algorithm with the full Grover-style speedup.
Unlike in the photo, I'm happy to be on good terms with my committee and expect it to be a nice capstone to my grad school experience.
But, still a little nervous 😅
#PhD #QuantumComputing
XKCD Comic: The best thesis defense is a good thesis offense.
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).
As I write my dissertation, I notice and remember things about my past work that could be improved. This one has been in my notebook for years, so it's a good time to share.
I hope somebody solves this problem and responds to my conjecture!
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.
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
Hello world / Hello BlueSky
