Kekule Cells for Molecular Computation

The configurations of single and double bonds in polycyclic hydrocarbons are abstracted as Kekul'e states of graphs. Sending a so-called soliton over an open channel between ports (external nodes) of the graph changes the Kekul'e state and therewith the set of open channels in the graph. This switching behaviour is proposed as a basis for molecular computation. The proposal is highly speculative but may have tremendous impact. Kekul'e states with the same boundary behaviour (port assignment) can be regarded as equivalent. This gives rise to the abstraction of Kekul'e cells. The basic theory of Kekul'e states and Kekul'e cells is developed here, up to the classification of Kekul'e cells with $\leq 4$ ports. To put the theory in context, we generalize Kekul'e states to semi-Kekul'e states, which form the solutions of a linear system of equations over the field of the bits 0 and 1. We briefly study so-called omniconjugated graphs, in which every port assignment of the right signature has a Kekul'e state. Omniconjugated graphs may be useful as connectors between computational elements. We finally investigate some examples with potentially useful switching behaviour.

💡 Research Summary

The paper proposes a speculative but potentially transformative framework for molecular computation based on the combinatorial properties of polycyclic hydrocarbons. By representing the pattern of single and double bonds in such molecules as binary edge‑labels on a graph, the authors define a “Kekulé state” as a configuration in which every cycle contains exactly one double bond. External vertices, called ports, serve as interfaces to the outside world. When a soliton—a localized charge or electron packet—travels along an open channel between two ports, the bond labels on the traversed path are flipped, thereby moving the system from one Kekulé state to another while preserving the port assignment. This operation is mathematically equivalent to adding a characteristic vector of the path modulo 2, i.e., an XOR operation on the binary state vector.

To manage the potentially huge set of Kekulé states, the authors introduce the concept of a “Kekulé cell.” A cell groups together all Kekulé states that share the same boundary behavior (the same assignment of open/closed ports). Within a cell, the soliton‑induced transitions form a graph whose vertices are the states and whose edges correspond to feasible soliton moves. The paper presents a complete classification of cells with up to four ports. For two‑ and three‑port systems the classification is straightforward; for four ports the authors enumerate all sixteen possible port signatures, identify the nine that are realizable, and list the corresponding state sets and transition graphs. This exhaustive taxonomy provides a library of elementary molecular logic elements.

Recognizing that the strict “one double bond per cycle” condition makes the existence problem highly non‑linear, the authors generalize to “semi‑Kekulé states.” In a semi‑Kekulé state only the parity of the number of double bonds incident to each vertex is prescribed. This relaxation leads to a linear system over GF(2): A·x = b, where A is the incidence matrix of the graph, x the vector of edge labels, and b encodes the required parity at each vertex (including the ports). Solving this system is polynomial‑time via Gaussian elimination, and the solutions that also satisfy the original cycle constraints are precisely the genuine Kekulé states. The linear formulation thus offers an efficient computational tool for exploring the state space and for designing graphs with desired properties.

A particularly interesting class of graphs introduced in the paper are the “omniconjugated graphs.” An omniconjugated graph has the property that, for any admissible port assignment (i.e., any assignment with the correct overall parity), there exists at least one Kekulé state realizing it. Consequently, every pair of ports can be connected by a soliton at any time, making such graphs ideal as universal connectors or communication hubs in a molecular circuit. The authors give small examples—triangular three‑port graphs, the complete graph K₄ as a four‑port omniconjugated structure—and analyze their symmetry, minimum degree, and robustness of the open‑channel set.

The final section showcases concrete graph designs that exhibit useful switching behavior. The authors construct a five‑port “molecular switch” and several six‑port configurations that emulate Boolean gates (AND, OR, XOR) by mapping specific soliton routes to logical truth tables. Transition diagrams and truth tables are provided, demonstrating how the presence or absence of an open channel between selected ports encodes logical 0 or 1. The paper also sketches possible experimental realizations: injection of electrons via scanning tunneling microscopy, electrochemical gating, or ultrafast optical pulses to generate solitons, followed by spectroscopic detection of bond‑order changes. While acknowledging the current technological challenges, the authors argue that the theoretical groundwork laid here could guide future efforts in designing and fabricating molecular‑scale logic components.

In summary, the work develops a rigorous mathematical model linking Kekulé resonance structures to binary state machines, introduces the abstraction of Kekulé cells, provides a linear‑algebraic framework through semi‑Kekulé states, identifies omniconjugated graphs as universal connectors, and demonstrates prototype switching motifs. Together these contributions constitute a foundational step toward realizing computation directly within the chemistry of conjugated molecules.