Boolean networks, first developed in the late 1960s as a tool for studying complex disordered dynamical systems, consist of nodes governed by Boolean functions whose evolution is entirely deterministic in that the state of the network at a given time fully determines the state of the network at some future time. They are known for exhibiting a high degree of spontaneous order and have since become a fundamental tool for modeling a wide variety of systems. In this article I develop a model for quantum autonomous Boolean networks that exhibits many of the same properties as the classical model while also demonstrating uniquely quantum properties within a rich landscape of behavior.
Boolean networks, first developed in the late 1960s as a tool for studying complex disordered dynamical systems, consist of nodes governed by Boolean functions whose evolution is entirely deterministic in that the state of the network at a given time fully determines the state of the network at some future time. They are known for exhibiting a high degree of spontaneous order and have since become a fundamental tool for modeling a wide variety of systems. In this article I develop a model for quantum autonomous Boolean networks that exhibits many of the same properties as the classical model while also demonstrating uniquely quantum properties within a rich landscape of behavior.
We propose quantum Boolean networks, which can be classified as deterministic reversible asynchronous Boolean networks. This model is based on the previously developed 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 connectivity of the network and the set of operators we allow. For some configurations, this model resembles the behavior of reversible Boolean networks, while for other configurations a more complex dynamic 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.
We propose quantum Boolean networks, which can be classified as deterministic reversible asynchronous Boolean networks. This model is based on the previously developed 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 connectivity of the network and the set of operators we allow. For some configurations, this model resembles the behavior of reversible Boolean networks, while for other configurations a more complex dynamic 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.
We investigate dynamical properties of a quantum generalization of classical reversible Boolean networks. The state of each node is encoded as a single qubit, and classical Boolean logic operations are supplemented by controlled bit-flip and Hadamard operations. We consider synchronous updating schemes in which each qubit is updated at each step based on stored values of the qubits from the previous step. We investigate the periodic or quasiperiodic behavior of quantum networks, and we analyze the propagation of single site perturbations through the quantum networks with input degree one. A nonclassical mechanism for perturbation propagation leads to substantially different evolution of the Hamming distance between the original and perturbed states.
The title of the present dissertation Decoherence in Quantum Network sounds very general and all-inclusive. Indeed it embraces two topics (decoherence and quantum network) from the area of Quantum Mechanics each of which is described in all respects by a huge literature developed in the last three decades [...]. Quantum decoherence, as the name lets it mean, is the mechanism that makes a quantum system loose its coherence properties, and with them the capability of giving rise to interference phenomena or to other interesting quantum effects [...]. The key idea promoted by decoherence is the insight that realistic quantum systems are never isolated, but are immersed in the surrounding environment and interact continuously with it [...]. As an example one may consider a two-level quantum system (i.e. a quantum bit, usually shortened with a terminology from information science to \\qubit" ) in contact with a wide environment. Hence, quantum systems are open systems, and continuously interact or exchange information with an external environment whose degrees of freedom are too numerous to be monitored. The resulting correlation between the system and the environment spoils quantum coherence and brings about the transition from a pure quantum state to a mixture of quantum state resulting a classical state. To describe decoherence different kind of approaches can be used (for example Master equation, random matrix, etc). A quantum network typically consists of a number of quantum objects (e.g., atoms, ions, quantum dots, cavities, etc.), to be referred to hereafter as the sites or the nodes of the network. They can interact and the interactions (or their correlations) will be usually described by the edges of a graph. Quantum networks can address different information processing tasks. For instance a quantum state can be transferred from qubit to qubit down a chain solely due to the interactions, that is according to the laws of quantum physics [...]. Quantum networks offer us new opportunities and phenomena as compared to classical networks. An extension to large scale of the idea of a quantum network could lead to a futurible quantum internet [...]. The study of networks has traditionally been the territory of graph theory [...], also with the advent of their quantum versions. Within simple quantum network model information processing is usually described by assuming perfect control of the underlying graph. However, this is not much realistic since randomness is often present and it leads to decoherence effects [...]. In contrast, the conservation of coherence is essential for any quantum information process [...], hence there is a persistent interest in decoherence effects in quantum networks, which motivate us to study models for describing such noisy effects. We consider a simple model of quantum network, employing qubits (spin-1/2 particles) attached to the nodes of an underlying graph and we study the simplest task, namely information storage (on a single and two qubits), when the graph randomly changes in time. Actually we randomly add edges to an initially disconnected graph according to the Gilbert model characterized by a weighting parameter ex [...] and in an identically and independent way at each time step. We find that by increasing ex the dynamics of relevant quantities like fidelity, entropy or concurrence, gradually transforms from damped to damped oscillatory and finally to purely oscillatory. That leads to the paper [see, Information dissipation in random quantum networks, by U. Farooq and S. Mancini, OSID 21(3), 1450004, 2014]. We also study a system composed by pairs of qubits attached to each node of a linear chain, a model that stems from quantum dot arrays. Here we use the approach of evolution with a stochastic Hamiltonian to describe the noisy effects. We then evaluate the effect of two most common disorders, namely exchange coupling and hyperfine interaction fluctuations, in adiabatic preparation of ground state in such model. We show that the adiabatic ground state preparation is highly robust against these disorders making the chain a good analog simulator. Moreover, we also study the adiabatic information transfer, using singlet-triplet states, across the chain. In contrast to ground state preparation the transfer mechanism is highly affected by disorders. This suggested that for communication tasks across such chains adiabatic evolution is not as effective and quantum quenches would be preferable. That leads to the paper [see, Adiabatic many-body state preparation and information transfer in quantum dot arrays, by U. Farooq, A. Bayat, S. Mancini and S. Bose Phys. Rev. B 91, 134303, 2015]. The present work is organized as follows. In chapter 1, we shall give a survey of the various types of approach which can be employed to analyse the dynamics of open quantum systems that leads to decoherence effects. In chapter 2, we shall give a general description about quantum network and its possible applications. In chapter 3, we shall discuss the problem of quantum state transfer in qubit network and shall give a brief overview of some scheme that enable nearly prefect state transfer. In chapter 4, we shall discuss singlet-triplet networks, that is networks having on each site a pair of (generally entangled) qubit. Then within this framework we propose a model stemming from quantum dot array. There we shall address the problem of ground state preparation and state transfer. Finally we shall describe the inherent entanglement of the ground state of strongly correlated systems can be exploited for both classical and quantum communications. In chapter 5, we shall propose a decoherence model for qubit networks based on edges representing XY interactions randomly added to a disconnected graph accordingly to a suitable probability distribution. In this way we shall describe dissipation of information initially localize in single or two qubits all over the network. In chapter 6 we shall model the noisy effects in the quantum dot array introduced in chapter 4 and investigate their consequences on the preparation of ground state and quantum state transfer mechanism. Finally we shall draw conclusions.
Spin glasses are disordered magnetic systems that have frustration. The most interesting feature of the physical properties of spin glasses is the complex structure of phase space that is caused by the competition between the quenched ferromagnetic and antiferromagnetic interactions of spin pairs. The popularity of spin glasses is two-fold. First of all, the extremely complicated energy landscapes built from the frustration among spin interactions gives spin glasses new properties that have never been seen in other ordered systems. One of these properties is a new transition between the paramagnetic phase and a disordered phase, the spin-glass phase. This new phenomenon triggers scientists' enthusiasm for deeply understanding the physical foundations and mathematical description for disordered systems such as spin glasses. Secondly, because analytical methods can no longer offer enough support for studying disordered systems, scientists use numerical tools like Markov-chain Monte Carlo to simulate the thermodynamics of the systems of interest as well as statistical methods to process big data generated from the simulations. Therefore, the research on such complex systems introduces a new paradigm to statistical physics and also opens a window into an overlapping area between computational physics and information science, which makes an interdisciplinary study necessary and helpful. \n\n\n\n I devote my research to this new interdisciplinary area by seeking new connections in both models and algorithms. This dissertation consists of two themes. The first theme is about the research of spin glasses, including a study on the universality of a diluted spin-glass model and the development of algorithms by introducing new tools from artificial intelligence and extending the current algorithms for more general use. I demonstrate that to detect the phase transition in a spin-glass model we can train convolutional neural networks with a different spin-glass model. Then, use the convolutional neural networks to precisely predict the phase transition of the model. I also show that by training the convolutional neural networks with poisoned data, the results can be very unpredictable. Next, I introduce research in modifying the isoenergetic cluster moves for highly connected topologies in spin glasses. The numerical results show that isoenergetic cluster moves can only be effective for graphs with low connectivities due to the relatively small percolation thresholds in topologies with high connectivities and the trade-off between the cluster size and acceptance rate forced by the detailed balance condition. To conclude the first theme, I study the universality of the two dimensional Ising model with bond dilution. This project is inspired by a debate in the grey area that is not covered by Harris criterion: the universality of a two-dimensional Ising model with disorder can not be theoretically explained. The simulation results for the two-dimensional Ising model with bond dilution show that the critical exponent of the correction to the correlation length does not change with disorder, which supports the strong universality scenario. The second theme of this dissertation is the study of the Boolean satisfiability problem through the use of Ising spin form. The Boolean satisfiability problem is the problem of determining if there exists an assignment of Boolean variables that satisfies a given Boolean formula. Considering that there are rarely global algorithms for the Boolean satisfiability problem and that the NP-complete Ising spin glass is written in Boolean variables as well, I use Monte Carlo simulations to find the optimal solutions for the Boolean satisfiability problem by implementing the Metropolis algorithm combined with the Parallel tempering algorithm. The advantage of this method is that the ergodicity of the thermodynamic procedure makes this algorithm global, which can help search for optimal solutions through the entire configuration space. The numerical results show that this physical algorithm has an obvious advantage over the current state-of-art algorithms on a derivative problem, the Boolean maximum satisfiability problem. Finally, I introduce my research on the Boolean satisfiability problem-based membership filter. Since the physical approach has the ability of globally seeking solutions it can help find uncorrelated solutions for the Boolean satisfiability problem-based membership filter, which is the key to improving efficiency for this new filter. Furthermore, I improve the efficiency of the filter by turning the Boolean satisfiability instance into a not-all-equal form to guarantee that the solutions found by our algorithm, Borealis, are uncorrelated. The numerical results show that the efficiency of Boolean satisfiability-based filter can be significantly improved while keeping the false positive rate low.
Complexity is an intuitively recognized feature of nature, but where does it come from? Is complexity only apparent at the classical level, or can it be found at the underlying quantum level as well? We approach these questions by exploring models consistent with basic quantum theory but which also hold promise for exhibiting complex behaviors -- a set of models we call the quantum elementary cellular automata (QECA). Previously, various quantum cellular automata models have been studied for both their quantum information theoretic properties and their ability to simulate key physics equations like the Schrodinger and Dirac equations. We take the unique approach of analyzing QECA as complexity-generating systems. Doing so requires a more precise notion of what we mean by complex. This is done by proposing nine axes of complexity along which the complexity of any system may be quantified. When applied to QECA, we find evidence of complexity using three of these axes, namely diversity, persistent dynamical macrostates, and connectivity. The studies presented are numerical simulations done without approximation using highly optimized exact diagonalization code which supports a Hilbert space of up to 2^27 dimensions. The code is written entirely in the high-level open source programming language Python, making it easily expandable to future projects requiring exact simulation of quantum systems. A careful description of an algorithm critical to our method as well as our use of high performance computing resources on a cluster supercomputer is given. Powerful quantifiers of entanglement and connectivity such as von Neumann entropy and complex network measures computed on quantum mutual information adjacency matrices provide analysis tools for the simulations. Each network measure is defined then tested on well-characterized entangled states from quantum information theory, like the GHZ and W states and singlet state arrays. The network measures known as network density, clustering coefficient, and disparity are specifically considered. We find these network measures offer unique information regarding the structure of two point correlations in the states produced by QECA dynamics, as compared to each other and as quantified by a principal component analysis. Using such measures, we address the complexity of QECA models at three levels of specificity. First, a broad analysis of tens of thousands of simulations gives an overview of the variety of dynamics available to the models. We quantify the diversity of our simulations as the density of simulations which appear, on average, unlike typical entangled quantum states. Second, a more selective analysis identifies QECA by their complexity dynamics, in the frequency domain. A few QECA which exhibit persistent dynamical macrostates in the form of highly structured entanglement are also described. Entanglement dynamics are quantified by the distribution of changes in bond entropy (the von Neumann entropy of all bipartitionings of the QECA system). Finally, we take a detailed look at the transport properties, defined as the speed and diffusion rate of an initial localized excitation, in a QECA model found earlier to exhibit persistent dynamical macrostates. The transport properties are found to be a function of a model parameter called the phase gate angle. Additionally, for high phase gate angle we find the emergence of a second trajectory from a single initial excitation. Taken together, the analyses in this thesis suggest QECA support elements of complexity in quantum dynamics. Since QECA are consistent with quantum theory, we conclude that complexity is not reserved for only the classical realm. The thesis finishes by suggesting future studies of complexity in quantum cellular automata.