no code implementations • 7 Dec 2022 • Nathaniel Johnston, Benjamin Lovitz, Aravindan Vijayaraghavan
While all of these problems are NP-hard in the worst case, our algorithm solves them in polynomial time for generic subspaces of dimension up to a constant multiple of the maximum possible.
no code implementations • 29 Aug 2014 • Somshubhro Bandyopadhyay, Alessandro Cosentino, Nathaniel Johnston, Vincent Russo, John Watrous, Nengkun Yu
We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization.
Quantum Physics
no code implementations • 18 Mar 2013 • Nathaniel Johnston
We examine the open problem of finding the shortest string that contains each of the n!
Combinatorics
1 code implementation • 7 Mar 2012 • Nathaniel Johnston
We analyze the computational complexity of solving the three "temporal rift" puzzles in the recent popular video game Final Fantasy XIII-2.
Computational Complexity
