258 citations · 779 across the 22 of their papers we have counts for
7 papers · 1 filter
Conjugate Logic
Niklas Johansson, Felix Huber, Jan-Åke Larsson
We propose a conjugate logic that can capture the behavior of quantum and quantum-like systems. The proposal is similar to the more generic concept of epistemic logic: it encodes k…
Quantum Simulation Logic, Oracles, and the Quantum Advantage
Niklas Johansson, Jan-Åke Larsson
Query complexity is a common tool for comparing quantum and classical computation, and it has produced many examples of how quantum algorithms differ from classical ones. Here we i…
Realization of Shor's Algorithm at Room Temperature
Niklas Johansson, Jan-Åke Larsson
Shor's algorithm can find prime factors of a large number more efficiently than any known classical algorithm. Understanding the properties that gives the speedup is essential for…
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…
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…
Searching for degeneracies of real Hamiltonians using homotopy classification of loops in SO()
Niklas Johansson, Erik Sjöqvist
Topological tests to detect degeneracies of Hamiltonians have been put forward in the past. Here, we address the applicability of a recently proposed test [Phys. Rev. Lett. {\bf 92…
Optimal Topological Test for Degeneracies of Real Hamiltonians
Niklas Johansson, Erik Sjöqvist
We consider adiabatic transport of eigenstates of real Hamiltonians around loops in parameter space. It is demonstrated that loops that map to nontrivial loops in the space of eige…