Logic circuits from zero forcing
Abstract
We design logic circuits based on the notion of zero forcing on graphs; each gate of the circuits is a gadget in which zero forcing is performed. We show that such circuits can evaluate every monotone Boolean function. By using two vertices to encode each logical bit, we obtain universal computation. We also highlight a phenomenon of “back forcing” as a property of each function. Such a phenomenon occurs in a circuit when the input of gates which have been already used at a given time step is further modified by a computation actually performed at a later stage. Finally, we show that zero forcing can be also used to implement reversible computation. The model introduced here provides a potentially new tool in the analysis of Boolean functions, with particular attention to monotonicity.
I Introduction
We order the two elements of a set such that . This extends to a partial ordering on the set by comparing words coordinatewise. Let and . Here, means that , for every . A Boolean function is monotone when if , for every .
Monotone Boolean functions have an important role for proving lower bounds of circuit complexity (see, e.g., Leeuwen l90 , Chapter 14.4). Any function obtained by composition of monotone Boolean functions is itself monotone. Examples of monotone Boolean functions are the conjuction AND and the disjunction OR. Indeed, every monotone Boolean function can be realized by AND and OR operations (but without NOT). Boolean functions are important in applications, for example, in the implementation of a class of nonlinear digital filters called stack filters as . Important methods for obtaining nontrivial bounds on specific monotone Boolean functions have been studied (see, e.g., al ).
The concept of zero forcing on graphs is a recent idea that is part of a program studying minimum ranks of matrices with specific combinatorial constraints. Zero forcing has been also called graph infection and graph propagation bg ; s . Notice that, in the context described here, the term “zero forcing” seems to be unfortunate, because we are forcing ones, not zeros. However, we keep the term given that this is now the most commonly used in the literature. In order to define zero forcing, we first need to define a colorchange rule: if is a graph with each vertex colored either white or black, is a black vertex of , and exactly one neighbor of is white, then change the color of to black. Given a coloring of , the final coloring is the result of applying the colorchange rule until no more changes are possible. A zero forcing set for is a set such that if the elements of are initially colored black and the elements of are colored white, the final coloring of is all black.
Zero forcing is related to certain minimum rank/maximum nullity problems of matrices associated to graphs (see min ) and to the controllability of quantum spin systems bg ; bs . Minimimizing the size of zero forcing sets is a difficult combinatorial optimization problem aa .
The remainder of this paper is organized as follows. In Section 2, we prove that zero forcing on graphs realizes all monotone Boolean functions, and highlight some simple related facts. The connection between zero forcing and circuits is obtained by associating a graph to each logic gate. We will show that the functions AND and OR are indeed easily realized by two different gadgets with a few vertices. This is not the first work observing that monotone Boolean functions can be realized in a combinatorial setting. For example, Demaine et al. de have used the movements of a collections of simple interlocked polygons.
In Section 3, we describe the phenomenon of back forcing in the circuit. The phenomenon occurs when the colorchange rule acts to modify the color of a vertex which has been already used during the computation. In some cases, back forcing implies that information about the output of a Boolean circuit can be read not just by looking at the color of a target vertex corresponding to the final output of the process, but at the color of the vertices in certain intermediate or initial gadgets. The idea opens a simple but intriguing scenario consisting of many parties that perform computation in a distributed way: each party holds a subset of the gates and it is able to read certain information about the input of other parties, since the color of its gates may have been modified by back forcing. Back forcing can be avoided by including some extra gadget acting as a filter.
In Section 4, we show that zero forcing becomes universal, i.e., it can realize any Boolean function, if we apply a proper encoding. Specifically the dual rail encoding, where two vertices are assigned to each logical bit, is a method to construct the NOT gate and therefore to obtain universal computation. Conclusions are in Section 5.
Ii Main result
Our main result is easy to prove:
Theorem 1
Zero forcing realizes all monotone Boolean functions.
Proof. It is sufficient to show that zero forcing realizes the functions AND and OR.
Claim 1. The gate AND is realized by the gadget with vertices and edges , where and are the input vertices and is the output vertex, containing the result and being able to propagate the color. All vertices are initially colored white. An illustration of the gadget is below:
Proof of Claim 1. If no action is taken then the final coloring of the gadget is white. If we color vertex black then the final coloring is all white but for vertex . The same holds for vertex . However, if we color vertex and vertex black then the colorchange rule implies that vertex is black at step . In fact, is a zero forcing set for .
Claim 2. The gate OR is realized by the gadget with vertices and edges , where and are the input vertices. The output vertex is vertex . Vertex is initially colored black:
Proof of Claim 2. If no action is taken then the final coloring of the gadget is all white, but for vertex . If we color vertex black then the colorchange rule implies that vertex is black at step . The same holds for vertex and for vertex and vertex together. In fact, are zero forcing sets for , able to propagate the color for inducing the next step of the computation.
It is important to observe that zero forcing does not realize the function NOT, since when a vertex is colored black, it can not change color anymore. The consequence is that zero forcing does not realize universal computation (any Boolean function can be implemented using AND, OR and NOT gates) but monotone Boolean functions only. This concludes the proof.
It may be worth observing the following points:

Notice that extra vertices forming delay lines may be needed to assemble a circuit such that the output produced by zero forcing in parallel gates is syncronous. However, given our choice of gadgets, exactly time steps are required for output of zero forcing in and . At time step the colorchange rule acts on the next gate in the circuit. There is then a convenient distinction between internal and external time: internal time refers to the zero forcing steps inside the gadgets/gates; external time refers to the time steps of the computation.

The gadgets and have three and four vertices, respectively. By inspection on all possible combinations of white and black vertices for graphs with at most four vertices, we can observe that we have chosen the smallest possible gadgets, in terms of number of vertices and edges, realizing the two functions. One might think that the gate OR is realized also by the gagdet with three vertices in the figure:
Although the gadget implements the OR correctly, it cannot be used as an initial or intermediate gate of a circuit, since in this gadget the colorchange rule does not move fowards the output to the next gate, but it halts at vertex :

Let us consider the gadget . If we color vertex black then the colorchange rule implies that vertex is black at step . Suppose that vertex is colored white at step . At step the gate has computed the OR function in vertex with input . At step vertex is also colored black under the action of the colorchange rule, because this is the unique white neighbour of vertex . This is necessary in order for the computation to proceed using the output (black vertex ). So, for all inputs with output , the vertices of are black after two steps of the internal time. Such behaviour is discussed in more detail in the next section.

It is straightforward to realize the operation COPY:
Iii Back forcing
If each Boolean variable in the input of a circuit is set to , then the vertices of the circuit that are initially colored black form a zero forcing set. However, this is not the only situation in which we have a zero forcing set. The next figure gives an example:
This is a circuit computing the Boolean function AND OR AND . The number in the vertices of the figure specify the internal time step at which the vertex is black; the vertices labeled by are initially colored black. The output of the circuit is at step and at step of the internal time the vertices encoding the input of the function are all colored black. This can happen if and only if three of the input vertices are colored white at internal time .
The phenomenon will be called back forcing, because it is induced by the colorchange rule acting backwards with respect to the direction from input to output in the whole circuit. The gadget exhibits back forcing conditionally on having input . The type of back forcing in can be called transmittal back forcing, because if something back forces its output black then the gate transmits the back force, i.e., it modifies the color of the output vertex in a gate used previously. The figure clarifies the dynamics:
The gadget needs to force an input forward in order to color black one of the output vertices adjacent to its inputs and in another gate. In this sense, does not have transmittal back forcing. In other words, a gate at external time , can not back force its color into at external time . In contrast, the circuit AND OR AND can initiate back forcing as described above (when it an intermediate element in the circuit).
We can also slow down back forcing, by including appropriate delay lines – for example, by adding extra vertices in each gadget or between them. Alternatively, we could consider delay lines directly embedded in the structure of the gadgets implementing the logical gates.
Also, back forcing can be avoided completely by including the gadget below. The gadget acts as a filter. In some sense, the filter can be understood as an electronic diode allowing zero forcing only in one direction:
In relation to the circuit for the function AND OR AND , it may be interesting to see that if there are two parties each one chosing the input of one of the two AND gates, and each one having access to only the corrisponding vertices, given the back forcing, the parties can then learn the output of the circuit by looking at the color of their vertices at the end of the computation, except when a party chooses (i.e., white, white).
Iv Universality
Despite the fact that the colorchange rule induces a nonreversible process (black coloring cannot be undone) a simple modification of the encoding strategy allows us to implement universal, and hence also reversible, computation.
The idea is to adopt a dual rail strategy, where two vertices are employed to encode a single logical bit. Specifically, as shown in Fig. 9, in this scheme we associate the logical bit 0 to a configuration in which (say) the first vertex is colored in black while the second is kept white, and the logical 1 to the opposite configuration (i.e. the first vertex being left white and the second one being colored black). With such encoding we can now design the gate NOT by simply drawing a graph in which the nodes are exchanged at the output (see Fig. 10). Also a dual rail AND gate can be easily realized. Universal computation is hence achieved by constructing a NAND gate via concatenation of AND with NOT and by observing that the COPY gate for the dual rail encoding is simply obtained by just applying to both the nodes that form a bit the transformation of Fig. 5. Once universal computation has been achieved, we can easily turn it into a reversible one, e.g., by building a Toffoli gate toffoli . This to remark that even if zero forcing is an irreversible process, it can still be used to induce a reversible computational dynamics.
V Conclusions
We have shown that all monotone Boolean functions can be realized by zero forcing in a graph constructed by gluing together the copies of two types of subgraphs/gadgets corresponding to the Boolean gates AND and OR. We have briefly discussed the minimality of such gadgets in terms of vertices and edges.
We have highlighted a back forcing action. Back forcing has an effect on the coloring of gates already used, as a function of what has happened in the “future”, i.e., at a later stage of the computation. Because of the relation between zero forcing and minimum ranks, the model described here is amenable to be studied with linear algebraic tools, potentially suggesting a novel direction in the analysis of monotone Boolean functions.
Finally, we have shown that universal computations can be obtained by zero forcing by simply adopting a dual rail encoding.
An open problem suggested by the paper is to understand the link between zero forcing and the dynamics at the basis of other unconventional models of computation, like, for example, the billiard ball computer – introduced as a model of reversible computing ft –, models involving geometric objects, and dominos de .
Acknowledgements.
This work has been done while DB was with the Blackett Laboratory at Imperial College London, supported by EPSRC grant EP/F043678/1. VG acknowledges support by the FIRBIDEAS project (RBID08B3FM). SS is a Newton International Fellow.References
 (1) A. Aazami, Hardness results and approximation algorithms for some problems on graphs, Ph.D. thesis, University of Waterloo, Dec. 2008.
 (2) N. Alon, R. Boppana, The monotone circuit complexity of Boolean functions, Combinatorica, 7, (1986), 122.
 (3) American Institute of Mathematics (AIM) Minimum RankSpecial Graphs Work Group, AIM Minimum Rank – Special Graphs Work Group (F. Barioli, W. Barrett, S. Butler, S. M. Cioabă, D. Cvetković, S. M. Fallat, C. Godsil, W. Haemers, L. Hogben, R. Mikkelson, S. Narayan, O. Pryporova, I. Sciriha, W. So, D. Stevanović, H. van der Holst, K. Vander Meulen, A. Wangsness), Zero forcing sets and the minimum rank of graphs, Linear Algebra and Its Application 428 (2008), 16281648.
 (4) J. Astola, D. Akopian, O. Vainio, and S. Agaian, New digitserial implementation of stack filters, Discrete Applied Mathematics, 61, pp. 181–197, 1997.
 (5) D. Burgarth, S. Bose, C. Bruder, V. Giovannetti, Local controllability of quantum networks, Phys. Rev. A 79, 060305(R) (2009).
 (6) D. Burgarth and V. Giovannetti, Full control by locally induced relaxation, Phys. Rev. Lett. 99, 100501 (2007).
 (7) E. D. Demaine, M. L. Demaine, R. Uehara, Any monotone boolean function can be realized by interlocked polygons, CCCG 2010, 139142.
 (8) E. Fredkin and T. Toffoli, Conservative logic, International Journal of Theoretical Physics, vol. 21, no. 3, pp. 219–253, 1982.
 (9) J. Leeuwen, Handbook of Theoretical Computer Science, Elsevier Science Publishers, 1990.
 (10) S. Severini, Nondiscriminatory Propagation on Trees, J. Phys. A: Math. Theor. 41 482002, 2008.
 (11) P. Vitanyi, Time, Space, and Energy in Reversible Computing, Proc. 2005 ACM International Conference on Computing Frontiers, Ischia, Italy, 46 May 2005, 1st International Workshop on Reversible Computing.
 (12) T. Toffoli, Reversible computing, Technical Report MIT/LCS/TM151, 1980.