We present a general method for analysing novel computational substrates to determine which of their parameters can be manipulated to exhibit the complete set of 2-input boolean logical operations. We demonstrate this approach with an NMR-based case study, showing which NMR parameters can be used to perform boolean logic.
As part of our longer term research objective of using the complex structure and dynamics of matter to perform non classical in materio computation, we show how to use NMR to perform classical computation. We describe three different approaches of using NMR to implement a single universal logic gate, and a circuit of these gates combined in parallel and in sequence that implement other logic gates, including various optimisations, and, in one case, a half-adder circuit. We then show how the three approaches are just specific instances of a more general approach set in a rich parameter space, and discuss how this parameter space might be exploited for more sophisticated computations. Key words: NMR, in materio computing, universal gates, trajectories 1
A new approach to synthesis of quantum logic circuits has been presented in this paper. This approach produces better results than the previous approaches based on classical reversible logic and can be easier tuned to any particular quantum technology such as nuclear magnetic resonance (NMR). The approach is based on the following principles: (1) design of (complex) gates using approach that links evolutionary, combinatorial and human interaction approaches, (2) design of circuits with these gates using evolutionary and search methods, (3) macro-generation of complex gates to lower level quantum primitives, (4) applying technology-related optimizing tautological transforms that take realistic quantum layout constraints, (5) calculating realistic costs related to quantum realization, (6) synthesis of incompletely specified functions. 1.
Quantum-enhanced Boolean logic represents a novel computational paradigm leveraging the unique properties of quantum mechanics, specifically superposition and entanglement, to achieve exponential speedups in computation. This paper proposes a design for a new Boolean logic system intrinsically linked to quantum circuits, aiming to exploit these phenomena for parallel processing and enhanced efficiency. We delve into the core mechanism of this system, exploring how quantum entanglement can be strategically employed to represent and manipulate Boolean logic operations. The exploration of this concept aims to push the boundaries of computational capabilities, offering a potential shift in the landscape of algorithmic design. The paper details the theoretical underpinnings, architectural considerations, and potential challenges associated with this approach.
Abstract Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different designs, where the logical outputs are encoded either at fixed energy and spatial positioning of the quantum states, or at different energies. We use these results to construct quantum Boolean adders involving a minimal number of quantum states with the two designs. We also establish a matrix algebra giving an analogy between classical Boolean logic gates and quantum ones, and assess the possibilities of both designs for more complex gates.
We implement several non-binary logic systems using the spin dynamics of nuclear spins in nuclear magnetic resonance (NMR). The NMR system is a suitable test system because of its high degree of experimental control; findings from NMR implementations are relevant for other computational platforms exploiting particles with spin, such as electrons or photons. While we do not expect the NMR system to become a practical computational device, it is uniquely useful to explore strengths and weaknesses of unconventional computational approaches, such as non-binary logic.
Logic gates with three input bits and three output bits have a privileged position within fundamental computer science: they are a sufficient building block for constructing arbitrary reversible boolean networks and therefore are the key to reversible digital computers. Such computers can, in principle, operate without heat production. As there exist as many as 8! = 40,320 different 3-bit reversible truth tables, the question arises as to which ones to choose as building blocks. Because these gates form a group with respect to the operation "cascading" , we can apply group theoretical tools, in order to make such a choice.