#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2008

2015

- This year (0)
- Last 5 years (5)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nathaniel Johnston, David W. Kribs, Vern I. Paulsen
- Quantum Information & Computation
- 2009

The diamond and completely bounded norms for linear maps play an increasingly important role in quantum information science, providing fundamental stabilized distance measures for differences of… (More)

- Nathaniel Johnston, David W. Kribs
- Quantum Information & Computation
- 2011

We consider the problem of computing the family of operator norms recently introduced in [1]. We develop a family of semidefinite programs that can be used to exactly compute them in small dimensions… (More)

We show that the multiplicative domain of a completely positive map yields a new class of quantum error correcting codes. In the case of a unital quantum channel, these are precisely the codes that… (More)

We consider a family of vector and operator norms which we refer to as Schmidt norms. We show that these norms have several uses in quantum information theory – they can be used to help classify… (More)

- Nathaniel Johnston
- Game of Life Cellular Automata
- 2010

- Somshubhro Bandyopadhyay, Alessandro Cosentino, Nathaniel Johnston, Vincent Russo, John Watrous, Nengkun Yu
- IEEE Transactions on Information Theory
- 2015

We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization. Specific results that we prove include: an exact formula… (More)

- Srinivasan Arunachalam, Nathaniel Johnston, Vincent Russo
- Quantum Information & Computation
- 2015

The absolute separability problem asks for a characterization of the quantum states ρ ∈ Mm ⊗Mn with the property that UρU† is separable for all unitary matrices U. We investigate whether or not it is… (More)

- Nathaniel Johnston
- Discrete Mathematics
- 2013

We examine the open problem of finding the shortest string that contains each of the n! permutations of n symbols as contiguous substrings (i.e., the shortest superpermutation on n symbols). It has… (More)

- Nathaniel Johnston, David W. Kribs
- 2011 ICO International Conference on Information…
- 2011

We consider a family of operator norms defined by the Schmidt decomposition theorem for quantum states. We use these norms to tackle two fundamental problems in quantum information theory: the… (More)

The B36/S125 (or “2x2”) cellular automaton is one that takes place on a 2D lattice much like Conway’s Game of Life. Although it exhibits high-level behaviour that is similar to Life, such as chaotic… (More)