We have 2 of 13 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
A rigorous parallelization framework is presented and it is proved that the resulting parallel sparse-blossom algorithm produces the same correction as the original, non-parallel sparse blossom.
The results show that the factorization underlying a quantum block encoding can itself provide sufficient classical structure even when sampling-and-query access to the composite matrix is unavailable, suggesting a classical sampler with prescribed accuracy and polynomially related runtime.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
