3 citations · 3 across the 3 of their papers we have counts for
3 papers
quant-ph2021
Topologically driven no-superposing theorem with a tight error bound
Zuzana Gavorová
To better understand quantum computation we can search for its limits or no-gos, especially if analogous limits do not appear in classical computation. Classical computation easily…
quant-ph2020★ 3 cited
Topological obstructions to quantum computation with unitary oracles
Zuzana Gavorová, Matan Seidel, Yonathan Touati
Algorithms with unitary oracles can be nested, which makes them extremely versatile. An example is the phase estimation algorithm used in many candidate algorithms for quantum spee…
quant-ph2020
Notes on distinguishability of postselected computations
Zuzana Gavorová
The framework of postselection is becoming more and more important in various recent directions in Quantum Computation research. Postselection renders simple computational models a…