We propose quantum Boolean networks, which can be classified as deterministic reversible asynchronous Boolean networks. This model is based on the concept of quantum Boolean functions. A quantum Boolean network is a Boolean network where the functions associated with the nodes are quantum Boolean functions. We study some properties of this novel model and, using a quantum simulator, we study how the dynamics change in function of the connectivity of the network and the set of operators we allow. For some configurations, the behavior of this model resembles that of reversible Boolean networks (RevBN), while for other configurations a more complex dynamics can emerge. For example, cycles larger than 2N were observed. Additionally, using a scheme akin to one used previously with random Boolean networks, we computed the average entropy and complexity of the networks. As opposed to classic random Boolean networks, where “complex” dynamics are restricted mainly to a connectivity close to a phase transition, quantum Boolean networks can exhibit stable, complex, and unstable dynamics independently of their connectivity.

Issue Section:
General Conference
random Boolean networks, reversible Boolean networks, quantum computing
This content is only available as a PDF.
© 2021 Massachusetts Institute of Technology Published under a Creative Commons Attribution 4.0 International (CC BY 4.0) license
2021
Massachusetts Institute of Technology
This is an open-access article distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. For a full description of the license, please visit https://creativecommons.org/licenses/by/4.0/legalcode.
Issue Section:
General Conference