3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.CC2017
Uniform Diagonalization Theorem for Complexity Classes of Promise Problems including Randomized and Quantum Classes
Friederike Anna Dziemba
Diagonalization in the spirit of Cantor's diagonal arguments is a widely used tool in theoretical computer sciences to obtain structural results about computational problems and co…
quant-ph2016
Adiabatic Quantum Computation
Friederike Anna Dziemba
The quantum adiabatic theorem ensures that a slowly changing system, initially prepared in its ground state, will evolve to its final ground state with arbitrary precision. As a fi…
quant-ph2015★ 3 cited
Phase context decomposition of diagonal unitaries for higher-dimensional systems
Kerstin Beer, Friederike Anna Dziemba
We generalize an efficient decomposition method for diagonal operators by Welch et al. to qudit systems. The phase-context aware method focusses on cascaded entanglers whose decomp…