35 citations · 82 across the 6 of their papers we have counts for
10 papers
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…
Comment on "Inherent security of phase coding quantum key distribution systems against detector blinding attacks" [Laser Phys. Lett. 15, 095203 (2018)]
Aleksey Fedorov, Ilja Gerhardt, Anqi Huang +8
This is a brief comment on the Letter by Balygin and his coworkers [Laser Phys. Lett. 15, 095203 (2018)]. We point out an error that invalidates the Letter's conclusions.
Comment on "The photon identification loophole in EPRB experiments: computer models with single-wing selection"
Mateus Araújo, Philippe Grangier, Jan-Åke Larsson
Contrary to the claims made in Ref. [1], the recent Bell tests by Giustina et al. and Shalm et al. do not suffer from a "photon identification loophole". The model discussed in Ref…
Postselection-loophole-free Bell violation with genuine time-bin entanglement
Francesco Vedovato, Costantino Agnesi, Marco Tomasin +4
Entanglement is an invaluable resource for fundamental tests of physics and the implementation of quantum information protocols such as device-independent secure communications. In…
Tight Bounds for the Pearle-Braunstein-Caves Chained Inequality Without the Fair-Coincidence Assumption
Jonathan Jogenfors, Jan-Åke Larsson
In any Bell test, loopholes can cause issues in the interpretation of the results, since an apparent violation of the inequality may not correspond to a violation of local realism.…
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…