Nathaniel Johnston

According to our database1, Nathaniel Johnston authored at least 12 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A new formula for the determinant and bounds on its tensor and Waring ranks.
Comb. Probab. Comput., 2024

2023
A hierarchy of eigencomputations for polynomial optimization on the sphere.
CoRR, 2023

Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Entangled subspaces and generic local state discrimination with pre-shared entanglement.
Quantum, 2022

2015
Limitations on Separable Measurements by Convex Optimization.
IEEE Trans. Inf. Theory, 2015

Is absolute separability determined by the partial transpose?
Quantum Inf. Comput., 2015

2013
Non-uniqueness of minimal superpermutations.
Discret. Math., 2013

The Minimum Size of Qubit Unextendible Product Bases.
Proceedings of the 8th Conference on the Theory of Quantum Computation, 2013

2012
The Complexity of the Puzzles of Final Fantasy XIII-2
CoRR, 2012

2011
A family of norms with applications in quantum information theory II.
Quantum Inf. Comput., 2011

2010
The B36/S125 "2x2" Life-Like Cellular Automaton.
Proceedings of the Game of Life Cellular Automata., 2010

2009
Computing stabilized norms for quantum operations via the theory of completely bounded maps.
Quantum Inf. Comput., 2009


  Loading...