Refik Mansuroglu

Many thanks to Timo Eckstein, Ludwig Nützel, Samuel Wilkinson and @hartmannquantum (I guess I should tell my co-authors to create a Twitter account)

Very excited (and a little surprised) that my first work at @FauQuantum on classical compression of Trotter formulas has been featured in IOP's "special celebratory collection" of articles published in 2023 by researchers in Germany! publishingsupport.iopscience.iop.org/questions/cele…

Large-scale simulations of Floquet physics on near-term #quantum computers just published in npj quantum information: doi.org/10.1038/s41534… Many thanks to Timo Eckstein, Piotr Czarnik, Jian-Xin Zhu, @hartmannquantum, @LCincio, @sornborg & @qZoeHolmes !

Our paper on #Quantum #Tensor #Product Decompositions, or QTPD in short😉, has been published in @PRX_Quantum! Thanks for the nice collaboration @CosmicCharsi @hartmannquantum @qZoeHolmes and @sornborg

Excited to show our #Quantenschafkopf game to participants of #Lino24 @lindaunobel. Check quantenschafkopf.de for a sneak peek. Great idea by @LudwigNuetzel ! @FauQuantum @UniFAU @MunichQuantum

New preprint on quantum cooling for fermionic systems: arxiv.org/abs/2403.14506 We present a cooling algorithm to find ground and thermal states of fermionic Hamiltonians. Many thanks to Lucas Marti and @hartmannquantum! @FauQuantum @MunichQuantum

Check out our new pre-print on Tensor Product Decompositions of Quantum Circuits! We study how to split off 🪓 effective actions on small subsystems. arxiv.org/abs/2402.05018 Thanks for this nice collaboration 𝐀𝐫𝐬𝐚𝐥𝐚𝐧 𝐀𝐝𝐢𝐥, @qZoeHolmes @sornborg, @hartmannquantum !

How do you solve chemistry with a quantum computer? The first step is understanding the Fermi-Hubbard model. 𝐋𝐮𝐜𝐚𝐬 𝐌𝐚𝐫𝐭𝐢 on Quantum Algorithmic Cooling at MPQ Garching. #Quantum @hartmannquantum @MPI_Quantum

🚨We're hiring!🚨 The Theory of Quantum Technology Group at FAU Erlangen-Nürnberg invites applications for a postdoc position in quantum algorithms and quantum simulation. For more information, see quantumtheory.nat.fau.eu/files/2023/11/… #QuantumComputing @hartmannquantum

For fixed target accuracy and gate count, we show that we can reach simulation times that are up to 10 times longer than in the Trotter case on an 2D XY model with transverse field.

As everything we do is initial state agnostic, we can reach longer times by just repeating the optimal sequence with an error that scales linear in the number of repetitions K.

Be it Barren plateaus or sample problems, quantum optimization seems more and more out of sight for NISQ computers. In our latest pre-print, we pull the optimization of Hamiltonian simulation into classical pre-processing. Check out this 🧵 arxiv.org/abs/2306.07208 @FauQuantum

Be it Barren plateaus or sample problems, quantum optimization seems more and more out of sight for NISQ computers. In our latest pre-print, we pull the optimization of Hamiltonian simulation into classical pre-processing. Check out this 🧵 arxiv.org/abs/2306.07208 @FauQuantum

Can one find more efficient gate sequences than Trotter for digital quantum simulation? In our new preprint with @MansRefiQ we show that this is always the case, via a problem specific, classically computable cost function for optimizing gate sequences, arxiv.org/abs/2306.07208

Many thanks to Timo Eckstein, Piotr Czarnik, Jian-Xin Zhu, @hartmannquantum, @LCincio, @sornborg and @qZoeHolmes for this very fruitful collaboration!

We finally provide a detailed analysis of QHiFFS errors. When compared to a Trotter-Suzuki formula, we find that QHiFFS yields savings in the ratio, R, of gate numbers that scales linearly in simulation time and cubically (!) with the driving frequency

Check out our new work on simulating periodically driven (Floquet) systems! We managed a high fidelity simulation on a 20 qubit trapped ion device + provide an in depth error analysis of our quantum algorithm. arxiv.org/abs/2303.02209 This 🧵 sums it up.