Peter Johnson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Peter Johnson has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
A.J.W Hilton
Department of Mathematics, University of Reading, Whiteknights, Reading RG6 6AX, UK
1 shared publication- Adam Blumenthal
Department of Mathematics and Statistics, Auburn University, AL, 36849, USA
1 shared publication - Alexis Krumpelman
Morehead State University
1 shared publication Andrew Owens
Auburn University
1 shared publication- Anthony J. W. Hilton
QUEEN MARY UNIVERSITY OF LONDON SCHOOL OF MATHEMATICAL SCIENCES ENGLAND UNITED KINGDOM
1 shared publication Auburn University
1 shared publication
Latest Publications
- Open Access
Babai Numbers and Babai Spectra of Paths and Cycles
We study Babai numbers and Babai $k$-spectra of paths and cycles. We completely determine the Babai numbers of paths $P_n$ for $n>1$ and $1 \leq k \leq n-1$, and the Babai $k$-spectra for $P_n$ when $1 \leq k \leq n/2$. We also completely determine Babai numbers and Babai $k$-spectra of all cycles $C_n$ for $k \in \{1,2\}$ and $n \geq 3$ if $k=1$ and $n > 3$ if $k=2$.Open AccessBabai Numbers and Babai Spectra of Paths and Cycles
We study Babai numbers and Babai $k$-spectra of paths and cycles. We completely determine the Babai numbers of paths $P_n$ for $n>1$ and $1 \leq k \leq n-1$, and the Babai $k$-spectra for $P_n$ when $1 \leq k \leq n/2$. We also completely determine Babai numbers and Babai $k$-spectra of all cycles $C_n$ for $k \in \{1,2\}$ and $n \geq 3$ if $k=1$ and $n > 3$ if $k=2$. - Open Access
State Preparation Boosters for Early Fault-Tolerant Quantum Computation
Quantum computing is believed to be particularly useful for the simulation of chemistry and materials, among the various applications. In recent years, there have been significant advancements in the development of near-term quantum algorithms for quantum simulation, including VQE and many of its variants. However, for such algorithms to be useful, they need to overcome several critical barriers including the inability to prepare high-quality approximations of the ground state. Current challenges to state preparation, including barren plateaus and the high-dimensionality of the optimization landscape, make state preparation through ansatz optimization unreliable. In this work, we introduce the method of ground state boosting, which uses a limited-depth quantum circuit to reliably increase the overlap with the ground state. This circuit, which we call a booster, can be used to augment an ansatz from VQE or be used as a stand-alone state preparation method. The booster converts circuit depth into ground state overlap in a controllable manner. We numerically demonstrate the capabilities of boosters by simulating the performance of a particular type of booster, namely the Gaussian booster, for preparing the ground state of $N_2$ molecular system. Beyond ground state preparation as a direct objective, many quantum algorithms, such as quantum phase estimation, rely on high-quality state preparation as a subroutine. Therefore, we foresee ground state boosting and similar methods as becoming essential algorithmic components as the field transitions into using early fault-tolerant quantum computers.Open AccessState Preparation Boosters for Early Fault-Tolerant Quantum Computation
Quantum computing is believed to be particularly useful for the simulation of chemistry and materials, among the various applications. In recent years, there have been significant advancements in the development of near-term quantum algorithms for quantum simulation, including VQE and many of its variants. However, for such algorithms to be useful, they need to overcome several critical barriers including the inability to prepare high-quality approximations of the ground state. Current challenges to state preparation, including barren plateaus and the high-dimensionality of the optimization landscape, make state preparation through ansatz optimization unreliable. In this work, we introduce the method of ground state boosting, which uses a limited-depth quantum circuit to reliably increase the overlap with the ground state. This circuit, which we call a booster, can be used to augment an ansatz from VQE or be used as a stand-alone state preparation method. The booster converts circuit depth into ground state overlap in a controllable manner. We numerically demonstrate the capabilities of boosters by simulating the performance of a particular type of booster, namely the Gaussian booster, for preparing the ground state of $N_2$ molecular system. Beyond ground state preparation as a direct objective, many quantum algorithms, such as quantum phase estimation, rely on high-quality state preparation as a subroutine. Therefore, we foresee ground state boosting and similar methods as becoming essential algorithmic components as the field transitions into using early fault-tolerant quantum computers. - Open Access
- 1 March 2021
- Published by Tamkang Journal of Mathematics in Tamkang Journal of Mathematics
- Vol. 52 (1) , 113-123
On the Babai and Upper Chromatic Numbers of Graphs of Diameter 2
The Babai numbers and the upper chromatic number are parameters that can be assigned to any metric space. They can, therefore, be assigned to any connected simple graph. In this paper we make progress in the theory of the first Babai number and the upper chromatic number in the simple graph setting, with emphasis on graphs of diameter 2.
- 1 March 2021
- Published by Tamkang Journal of Mathematics in Tamkang Journal of Mathematics
- Vol. 52 (1) , 113-123
Open AccessOn the Babai and Upper Chromatic Numbers of Graphs of Diameter 2
The Babai numbers and the upper chromatic number are parameters that can be assigned to any metric space. They can, therefore, be assigned to any connected simple graph. In this paper we make progress in the theory of the first Babai number and the upper chromatic number in the simple graph setting, with emphasis on graphs of diameter 2.
- 29 July 2020
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 64 (1) , 13-24
On Single-Distance Graphs on the Rational Points in Euclidean Spaces
For positive integers n and d > 0, let $G(\mathbb {Q}^n,\; d)$ denote the graph whose vertices are the set of rational points $\mathbb {Q}^n$ , with $u,v \in \mathbb {Q}^n$ being adjacent if and only if the Euclidean distance between u and v is equal to d. Such a graph is deemed “non-trivial” if d is actually realized as a distance between points of $\mathbb {Q}^n$ . In this paper, we show that a space $\mathbb {Q}^n$ has the property that all pairs of non-trivial distance graphs $G(\mathbb {Q}^n,\; d_1)$ and $G(\mathbb {Q}^n,\; d_2)$ are isomorphic if and only if n is equal to 1, 2, or a multiple of 4. Along the way, we make a number of observations concerning the clique number of $G(\mathbb {Q}^n,\; d)$ .- 29 July 2020
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 64 (1) , 13-24
On Single-Distance Graphs on the Rational Points in Euclidean Spaces
For positive integers n and d > 0, let $G(\mathbb {Q}^n,\; d)$ denote the graph whose vertices are the set of rational points $\mathbb {Q}^n$ , with $u,v \in \mathbb {Q}^n$ being adjacent if and only if the Euclidean distance between u and v is equal to d. Such a graph is deemed “non-trivial” if d is actually realized as a distance between points of $\mathbb {Q}^n$ . In this paper, we show that a space $\mathbb {Q}^n$ has the property that all pairs of non-trivial distance graphs $G(\mathbb {Q}^n,\; d_1)$ and $G(\mathbb {Q}^n,\; d_2)$ are isomorphic if and only if n is equal to 1, 2, or a multiple of 4. Along the way, we make a number of observations concerning the clique number of $G(\mathbb {Q}^n,\; d)$ .- Open Access
- 1 December 2017
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 14 (3) , 216-223
Connected minimum secure-dominating sets in grids
For any (finite simple) graph G the secure domination number of G satisfies γs(G)≥|V(G)|2. Here we find a secure-dominating set S in G such that |S|=⌈|V(G)|2⌉ in all cases when G is a grid, and in ...
- 1 December 2017
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 14 (3) , 216-223
Open AccessConnected minimum secure-dominating sets in grids
For any (finite simple) graph G the secure domination number of G satisfies γs(G)≥|V(G)|2. Here we find a secure-dominating set S in G such that |S|=⌈|V(G)|2⌉ in all cases when G is a grid, and in ...
- Open Access
- 1 December 2017
- Published by Tamkang Journal of Mathematics in Tamkang Journal of Mathematics
- Vol. 48 (4) , 301-320
Regular clique assemblies, configurations, and friendship in Edge-Regular graphs
An edge-regular graph is a regular graph in which, for some $\lambda$, any two adjacent vertices have exactly $\lambda$ common neighbors. This paper is about the existence and structure of edge-regular graphs with $\lambda =1$ and about edge-regular graphs with $\lambda >1$ which have local neighborhood structure analogous to that of the edge-regular graphs with $\lambda =1$.- 1 December 2017
- Published by Tamkang Journal of Mathematics in Tamkang Journal of Mathematics
- Vol. 48 (4) , 301-320
Open AccessRegular clique assemblies, configurations, and friendship in Edge-Regular graphs
An edge-regular graph is a regular graph in which, for some $\lambda$, any two adjacent vertices have exactly $\lambda$ common neighbors. This paper is about the existence and structure of edge-regular graphs with $\lambda =1$ and about edge-regular graphs with $\lambda >1$ which have local neighborhood structure analogous to that of the edge-regular graphs with $\lambda =1$. - Open Access
- 1 January 2017
- Published by Georgia Southern University in Theory and Applications of Graphs
- Vol. 4 (2) , 1-9
Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
It is well known that if the edges of a finite simple connected graph on n vertices are colored so that no cycle is rainbow, then no more than n-1 colors can appear on the edges. In previous work it has been shown that the essentially different rainbow-cycle-forbidding edge colorings of Kn with n-1 colors appearing are in 1-1 correspondence with (can be encoded by) the (isomorphism classes of) full binary trees with n leafs. In the encoding, the natural Huffman labeling of each tree arising from the assignment of 1 to each leaf plays a role. Very recently it has been shown that a similar encoding holds for rainbow-cycle-forbidding edge colorings of Ka,b with a+b-1 colors appearing. In this case the binary trees are given Huffman labelings arising from certain assignments of (0,1) or (1,0) to the leafs. (Sibling leafs are not allowed to be assigned the same label.) In this paper we prove the analogous result for complete r-partite graphs, for r > 2.
- 1 January 2017
- Published by Georgia Southern University in Theory and Applications of Graphs
- Vol. 4 (2) , 1-9
Open AccessEdge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
It is well known that if the edges of a finite simple connected graph on n vertices are colored so that no cycle is rainbow, then no more than n-1 colors can appear on the edges. In previous work it has been shown that the essentially different rainbow-cycle-forbidding edge colorings of Kn with n-1 colors appearing are in 1-1 correspondence with (can be encoded by) the (isomorphism classes of) full binary trees with n leafs. In the encoding, the natural Huffman labeling of each tree arising from the assignment of 1 to each leaf plays a role. Very recently it has been shown that a similar encoding holds for rainbow-cycle-forbidding edge colorings of Ka,b with a+b-1 colors appearing. In this case the binary trees are given Huffman labelings arising from certain assignments of (0,1) or (1,0) to the leafs. (Sibling leafs are not allowed to be assigned the same label.) In this paper we prove the analogous result for complete r-partite graphs, for r > 2.
- 8 October 2013
- Published by Springer Nature in Aequationes mathematicae
- Vol. 89 (3) , 497-510
Unifying inequalities of Hardy, Copson, and others
- 8 October 2013
- Published by Springer Nature in Aequationes mathematicae
- Vol. 89 (3) , 497-510
Unifying inequalities of Hardy, Copson, and others
- 12 October 2011
- Published by Springer Nature
- p. 97-113
Szlam’s Lemma: Mutant Offspring of a Euclidean Ramsey Problem from 1973, with Numerous Applications
- 12 October 2011
- Published by Springer Nature
- p. 97-113
Szlam’s Lemma: Mutant Offspring of a Euclidean Ramsey Problem from 1973, with Numerous Applications
- 12 October 2010
- Published by Springer Nature
- p. 163-176
Euclidean Distance Graphs on the Rational Points
- 12 October 2010
- Published by Springer Nature
- p. 163-176
Euclidean Distance Graphs on the Rational Points