Showing 2001Show all
2 papers · 1 filter
quant-ph2001
A note on quantum one-way permutations
Elham Kashefi, Harumichi Nishimura, Vlatko Vedral
We discuss the question of the existence of quantum one-way permutations. First, we prove the equivalence between inverting a permutation and that of constructing a polynomial size…
quant-ph2001
Quantum subroutine problem and the robustness of quantum complexity classes
Harumichi Nishimura, Masanao Ozawa
This paper positively solves the quantum subroutine problem for fully quantum oracles. The quantum subroutine problem asks whether a quantum computer with an efficiently computable…