353 citations · 693 across the 10 of their papers we have counts for
10 papers
Experimental Verification of Multipartite Entanglement in Quantum Networks
W. McCutcheon, A. Pappa, B. A. Bell +9
Multipartite entangled states are a fundamental resource for a wide range of quantum information processing tasks. In particular, in quantum networks it is essential for the partie…
Factoring Safe Semiprimes with a Single Quantum Query
Frédéric Grosshans, Thomas Lawson, François Morain +1
Shor's factoring algorithm (SFA), by its ability to efficiently factor large numbers, has the potential to undermine contemporary encryption. At its heart is a process called order…
Nonlocality and conflicting interest games
Anna Pappa, Niraj Kumar, Thomas Lawson +4
Nonlocality enables two parties to win specific games with probabilities strictly higher than allowed by any classical theory. Nevertheless, all known such examples consider games…
Odd orders in Shor's factoring algorithm
Thomas Lawson
Shor's factoring algorithm (SFA) finds the prime factors of a number, , exponentially faster than the best known classical algorithm. Responsible for the speed-up is a s…
Demonstrating genuine multipartite entanglement and nonseparability without shared reference frames
Celal Furkan Senel, Thomas Lawson, Marc Kaplan +2
Multipartite nonlocality is of great fundamental interest and constitutes a useful resource for many quantum information protocols. However, demonstrating it in practice, by violat…
Reliable experimental quantification of bipartite entanglement without reference frames
Thomas Lawson, Anna Pappa, Boris Bourdoncle +3
Simply and reliably detecting and quantifying entanglement outside laboratory conditions will be essential for future quantum information technologies. Here we address this issue b…