258 citations · 779 across the 22 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
quant-ph2015★ 28 cited
Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
Niklas Johansson, Jan-Åke Larsson
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum res…
quant-ph2015★ 1 cited
Efficient classical simulation of the Deutsch-Jozsa algorithm
Niklas Johansson, Jan-Åke Larsson
In 1985, David Deutsch challenged the Church-Turing thesis by stating that his quantum model of computation "could, in principle, be built and would have many remarkable properties…