62 citations · 569 across the 16 of their papers we have counts for
Showing 2012 · quant-phShow all
2 papers · 2 filters
quant-ph2012★ 19 cited
Solving search problems by strongly simulating quantum circuits
T. H. Johnson, J. D. Biamonte, S. R. Clark +1
Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms. The most complete type of simulation, strong simulation, is believed…
quant-ph2012★ 6 cited
Time Invariant Discord and Non-Markovianity
Pinja Haikka, Tomi H. Johnson, Sabrina Maniscalco
We study non-Markovianity and information flow for qubits experiencing local dephasing with an Ohmic class spectrum. We demonstrate the existence of a temperature-dependent critica…