
Circuit pedantry
Boolean and quantum circuits have commonalities and differences. To form...
read it

Investigating the Power of Circuits with MOD_6 Gates
We consider the power of Boolean circuits with MOD_6 gates. First, we in...
read it

Reverse Derivative Ascent: A Categorical Approach to Learning Boolean Circuits
We introduce Reverse Derivative Ascent: a categorical analogue of gradie...
read it

The Space of Functions Computed By Deep Layered Machines
We study the space of Boolean functions computed by random layered machi...
read it

Circuits: An abstract viewpoint
Our primary purpose is to isolate the abstract, mathematical properties ...
read it

Reduced Dependency Spaces for Existential Parameterised Boolean Equation Systems
A parameterised Boolean equation system (PBES) is a set of equations tha...
read it

On The Reasons Behind Decisions
Recent work has shown that some common machine learning classifiers can ...
read it
Mapping finite state machines to zkSNARKS Using Category Theory
We provide a categorical procedure to turn graphs corresponding to state spaces of finite state machines into boolean circuits, leveraging on the fact that boolean circuits can be easily turned into zkSNARKS. Our circuits verify that a given sequence of edges and nodes is indeed a path in the graph they represent. We then generalize to circuits verifying paths in arbitrary graphs. We prove that all of our correspondences are pseudofunctorial, and behave nicely with respect to each other.
READ FULL TEXT
Comments
There are no comments yet.