Jakob Günther
@jakg.bsky.social
Spends time thinking about quantum computing and molecules. PhD-candidate. Also interested in fields of practical relevance, like climate science.
cool stuff! As I understand you are not considering the error in operator norm but in terms of an expectation w.r.t. a state. That reminds me of adiabatic evolution, following some eigenstate along a time-dependent Hamiltonian. You don't mention that application, so maybe I am missing something?
October 29, 2024 at 2:07 AM
cool stuff! As I understand you are not considering the error in operator norm but in terms of an expectation w.r.t. a state. That reminds me of adiabatic evolution, following some eigenstate along a time-dependent Hamiltonian. You don't mention that application, so maybe I am missing something?
yea, specialised hardware for matrix manipulation accelerates matrix manipulations - they state a 80x speedup compared to a parallel CPU implementation. There's no algorithmic improvement that changes the asymptotic scaling with bond dimension or number of sites.
September 22, 2024 at 3:27 PM
yea, specialised hardware for matrix manipulation accelerates matrix manipulations - they state a 80x speedup compared to a parallel CPU implementation. There's no algorithmic improvement that changes the asymptotic scaling with bond dimension or number of sites.
Hi, could you add me to the list? I am a PhD-student in quantum physics in Copenhagen: qmath.ku.dk/staff/
People – University of Copenhagen
qmath.ku.dk
September 19, 2024 at 6:52 PM
Hi, could you add me to the list? I am a PhD-student in quantum physics in Copenhagen: qmath.ku.dk/staff/