69 citations · 261 across the 33 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
quant-ph2022
Space-Bounded Unitary Quantum Computation with Postselection
Seiichiro Tani
Space-bounded computation has been a central topic in classical and quantum complexity theory. In the quantum case, every elementary gate must be unitary. This restriction makes it…
quant-ph2022★ 1 cited
Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection
Ryo Hiromasa, Akihiro Mizutani, Yuki Takeuchi +1
We define rewinding operators that invert quantum measurements. Then, we define complexity classes , , and as sets of decision problems s…