Search NASA⌕ Search

Engineering topics

Lemons, Nathan Wishard

Publications and source records attributed to Lemons, Nathan Wishard.

Quantum Algorithm Implementations for Beginners

As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have less than 100 qubits, quantum computing hardware is widely expected to grow in terms of qubit count, quality, and connectivity. This review aims at explaining the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional. We give an introduction to quantum computing algorithms and their implementation on real quantum hardware. We survey 20 different quantum algorithms, attempting to describe each in a succinct and self-contained fashion. We show how these algorithms can be implemented on IBM’s quantum computer, and in each case, we discuss the results of the implementation with respect to differences between the simulator and the actual hardware runs. This article introduces computer scientists, physicists, and engineers to quantum algorithms and provides a blueprint for their implementations.

97 MATHEMATICS AND COMPUTING↗

Induced and non-induced poset saturation problems

A subfamily G ⊆ F ⊆ 2 [ n ] of sets is a non-induced (weak) copy of a poset P in F if there exists a bijection i : P → G such that p ≤ P q implies i ( p ) ⊆ i ( q ) . In the case where in addition p ≤ P q holds if and only if i ( p ) ⊆ i ( q ) , then is an induced (strong) copy of P in G . We consider the minimum number sat ( n , P ) [resp. sat ⁎ ( n , P ) ] of sets that a family F ⊆ 2 [ n ] can have without containing a non-induced [induced] copy of P and being maximal with respect to this property, i.e., the addition of any G ∈ 2 [ n ] ∖ F creates a non-induced [induced] copy of P.

97 MATHEMATICS AND COMPUTING↗

Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree

Let $\mathcal{H}$ be an $r$-uniform hypergraph. The minimum positive co-degree of $\mathcal{H}$, denoted by $\delta_{r-1}^+(\mathcal{H})$, is the minimum $k$ such that if $S$ is an $(r-1)$-set contained in a hyperedge of $\mathcal{H}$, then $S$ is contained in at least $k$ hyperedges of $\mathcal{H}$. For $r\geq k$ fixed and $n$ sufficiently large, we determine the maximum possible size of an intersecting $r$-uniform $n$-vertex hypergraph with minimum positive co-degree $\delta_{r-1}^+(\mathcal{H}) \geq k$ and characterize the unique hypergraph attaining this maximum. This generalizes the Erd\Hos--Ko--Rado theorem which corresponds to the case $k=1$. Furthermore, our proof is based on the delta-system method.

97 MATHEMATICS AND COMPUTING↗

The structure of hypergraphs without long Berge cycles

Here, we study the structure of r-uniform hypergraphs containing no Berge cycles of length at least k for k ≤ r, and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such hypergraphs, giving an affirmative answer to the conjectured value when k = r and giving a simple solution to a recent result of Kostochka-Luo when k < r.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The cost of embedding

This report describes the cost of embedding and its implication for quantum computing.

97 MATHEMATICS AND COMPUTING↗