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
Vishnu Iyer
@vishnu-psiyer.bsky.social
PhD student in quantum information and complexity theory at The University of Texas at Austin. Previously EECS @ UC Berkeley.
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