Logic circuits from zero forcing

  title={Logic circuits from zero forcing},
  author={Daniel Burgarth and Vittorio Giovannetti and Leslie Hogben and Simone Severini and Michael Young},
  journal={Natural Computing},
  pages={485 - 490}
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… 
On the Zero Forcing Number of Trees
Let G be a graph such that the color of its vertices is white or black. A dynamic vertex coloring for G is defined as follows. One starts with a certain set of black vertices. Then, at each time
On the universality of the quantum approximate optimization algorithm
The complete proof of the claim that for one-dimensional local cost Hamiltonians, composed of nearest neighbor ZZ terms, this set-up is quantum computationally universal, i.e., all unitaries can be reached up to arbitrary precision is given.
The zero forcing polynomial of a graph
Graphs with Extremal Connected Forcing Numbers
The results extend existing characterizations of graphs with zero forcing numbers 2 and n-2 and use combinatorial and graph theoretic techniques, in contrast to the linear algebraic approach used to obtain the latter.
Total Forcing Sets and Zero Forcing Sets in Trees
It is proved that if T is a tree of order n ≥ 3 with maximum degree Δ and with n1 leaves, then n1≤Ft(T)≤1Δ((Δ-1)N+1) {n_1} \le F_t( T) , and the infinite family of trees achieving equality is characterized.
The forcing number of graphs with given girth
Abstract In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an initial subset S of colored vertices, with all remaining vertices being non-colored. At each
A computational comparison of compact MILP formulations for the zero forcing number
Characterizations of the Connected Forcing Number of a Graph
The connected forcing process -- a restriction of zero forcing in which the initially colored set of vertices induces a connected subgraph -- is introduced and it is shown that the connected forcing number -- the cardinality of the smallest initially colored vertex set which forces the entire graph to be colored -- is a sharp upper bound to the maximum nullity, path cover number, and leaf number of the graph.
Ground-state spin logic
This work examines the embedding of Boolean logic gates into the ground-state subspace of such spin systems using an approach based on group theory and symmetries, and describes parameterized families of diagonal Hamiltonians and symmetry operations which preserve theGround- state subspace encoding the truth tables of Boolean formulas.


From Truth Tables to Programming Languages: Progress in the Design of Reversible Circuits
  • R. Drechsler, R. Wille
  • Computer Science
    2011 41st IEEE International Symposium on Multiple-Valued Logic
  • 2011
The progress in the development of design methods for reversible circuits is reviewed -- with a particular focus on the synthesis steps, and the general idea of common synthesis approaches is described.
The monotone circuit complexity of boolean functions
The arguments of Razborov are modified to obtain exponential lower bounds for circuits, and the best lower bound for an NP function ofn variables is exp (Ω(n1/4 · (logn)1/2)), improving a recent result of exp ( Ω( n1/8-ε)) due to Andreev.
Conservative logic
Conservative logic shows that it is ideally possible to build sequential circuits with zero internal power dissipation and proves that universal computing capabilities are compatible with the reversibility and conservation constraints.
Nondiscriminatory propagation on trees
We consider a discrete-time dynamical process on graphs, firstly introduced in connection with a protocol for controlling large networks of spin 1/2 quantum mechanical particles [Burgarth and
Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
The main result says that controllability in the quantum sense, expressed by the Lie algebra rank condition, and controllable in the sense of linear systems, express by the controllabilities matrix rank condition are equivalent conditions.
Synthesis and optimization of reversible circuits—a survey
This survey reviews algorithmic paradigms—search based, cycle based, transformation based, and BDD based—as well as specific algorithms for reversible synthesis, both exact and heuristic, and outlines key open challenges in synthesis of reversible and quantum logic.
New digit-serial implementations of stack filters
Local controllability of quantum networks
We give a sufficient criterion that guarantees that a many-body quantum system can be controlled by properly manipulating the (local) Hamiltonian of one of its subsystems. The method can be applied
Reversible Computing
According to a physical interpretation, the central result of this paper is that i¢ is ideally possible to build sequential c/rcuits with zero internal power dissipation.
Hardness results and approximation algorithms for some problems on graphs
This thesis studies some graph covering problems with a non-local covering rule that allows a “remote” node to be covered by repeatedly applying the covering rule, and designs and analyzes an approximation algorithm with a performance guarantee of O( √ n) on planar graphs.