Search results

This paper aims to propose the reversible Feynman and double Feynman gates using quantum-dot cellular automata (QCA) nanotechnology with minimum QCA cells and latency which minimizes the circuit area with the more energy efficiency.

The core aim of the QCA nanotechnology is to build the high-speed, energy efficient and as much smaller devices as possible. This brings a challenge for the designers to construct the designs that fulfill the requirements as demanded. This paper proposed a new exclusive-OR (XOR) gate which is then used to implement the logical operations of the reversible Feynman and double Feynman gates using QCA nanotechnology.

QCA designer-E has been used for the QCA designs and the simulation results. The proposed QCA designs have less latency, occupy less area and have lesser cell count as compared to the existing ones.

The latencies of the proposed gates are 0.25 which are improved by 50% as compared to the best available design as reported in the literature. The cell count in the proposed XOR gate is 11, while it is 14 in Feynman gate and 27 in double Feynman gate. The cell count for the proposed designs is minimum as compared to the best available designs.

In this research work, brief quantum-dot cellular automata (QCA) concepts are discussed through arithmetic and logic units. This work is most useful for nanoelectronic applications, VLSI industry mainly depends on this type of fault-tolerant QCA based arithmetic logic unit (ALU) design. The ALU design is mainly depending on set instructions and rules; these are maintained through low-power ultra-functional tricks only possible with QCA-based reversible arithmetic and logic unit for nanoelectronics. The main objective of this investigation is to design an ultra-low power and ultra-high-speed ALU design with QCA technology. The following QCA method has been implemented through reversible logic.

QCA logic is the main and critical condition for realizing NANO-scale design that delivers considerably fast integrate module, effective performable computation and is less energy efficiency at the nano-scale (QCA). Processors need an ALU in order to process and calculate data. Fault-resistant ALU in QCA technology utilizing reverse logic is the primary objective of this study. There are now two sections, i.e. reversible ALU (RAU), logical (LAU) and arithmetical (RAU).

A reversible 2 × 1 multiplexer based on the Fredkin gate (FRG) was developed to allow users to choose between arithmetic and logical operations. QCA full adders are also implemented to improve arithmetic operations' performance. The ALU is built using reversible logic gates that are fault-tolerant.

In contrast to earlier research, the suggested reversible multilayered ALU with reversible QCA operation is imported. The 8- and 16-bit ALU, as well as logical unit functioning, is designed through fewer gates, constant inputs and outputs. This implementation is designed on the Mentor Graphics QCA tool and verifies all functionalities.

The purpose of this paper is to introduce an approach for m‐valued classical and non‐classical (reversible and quantum) optical computing. The developed approach utilizes new multiplexer‐based optical devices and circuits within switch logic to perform the required optical computing. The implementation of the new optical devices and circuits in the optical regular logic synthesis using new lattice and systolic architectures is introduced, and the extensions to quantum optical computing are also presented.

The new linear optical circuits and systems utilize coherent light beams to perform the functionality of the basic logic multiplexer. The 2‐to‐1 multiplexer is a basic building block in switch logic, where in switch logic a logic circuit is implemented as a combination of switches rather than a combination of logic gates as in the gate logic, which proves to be less‐costly in synthesizing wide variety of logic circuits and systems. The extensions to quantum optical computing using photon spins and the collision of Manakov solitons are also presented.

New circuits for the optical realizations of m‐valued classical and reversible logic functions are introduced. Optical computing extensions to linear quantum computing using photon spins and nonlinear quantum computing using Manakov solitons are also presented. Three new multiplexer‐based linear optical devices are introduced that utilize the properties of frequency, polarization and incident angle that are associated with any light‐matter interaction. The hierarchical implementation of the new optical primitives is used to synthesize regular optical reversible circuits such as the m‐valued regular optical reversible lattice and systolic circuits. The concept of parallel optical processing of an array of input laser beams using the new multiplexer‐based optical devices is also introduced. The design of regular quantum optical systems using regular quantum lattice and systolic circuits is introduced. New graph‐based quantum optical representations using various types of quantum decision trees are also presented to efficiently represent quantum optical circuits and systems.

The introduced methods for classical and non‐classical (reversible and quantum) optical regular circuits and systems are new and interesting for the design of several future technologies that require optimal design specifications such as super‐high speed, minimum power consumption and minimum size such as in quantum computing and nanotechnology.

This study aims to assess the use of variational quantum imaginary time evolution for solving partial differential equations using real-amplitude ansätze with full circular entangling layers. A graphical mapping technique for encoding impulse functions is also proposed.

The Smoluchowski equation, including the Derjaguin–Landau–Verwey–Overbeek potential energy, is solved to simulate colloidal deposition on a planar wall. The performance of different types of entangling layers and over-parameterization is evaluated.

Colloidal transport can be modelled adequately with variational quantum simulations. Full circular entangling layers with real-amplitude ansätze lead to higher-fidelity solutions. In most cases, the proposed graphical mapping technique requires only a single bit-flip with a parametric gate. Over-parameterization is necessary to satisfy certain physical boundary conditions, and higher-order time-stepping reduces norm errors.

Variational quantum simulation can solve partial differential equations using near-term quantum devices. The proposed graphical mapping technique could potentially aid quantum simulations for certain applications.

This study shows a concrete application of variational quantum simulation methods in solving practically relevant partial differential equations. It also provides insight into the performance of different types of entangling layers and over-parameterization. The proposed graphical mapping technique could be valuable for quantum simulation implementations. The findings contribute to the growing body of research on using variational quantum simulations for solving partial differential equations.

The goal is to find a systemic information assembling mechanism, which would describe not only a human being's way of organizing the accepted information but also the general information regularities of this process, applied to different information objects.

Mathematical formalism of Informational Macrodynamics is employed for system modeling of the object's regularities and the main systemic mechanisms. The developed systemic assembling mechanism joins a chaotic oscillation of incoming information frequencies, initiating a chaotic resonance, into a cooperative attractor. A chain of sequentially built attractors generates a collective information dynamic network (IN), whose hierarchy models the multiple information contributions. An information structure of the IN node's attractors is memorized by the key‐lock connections of resonance frequencies.

The results indicate that formalized functions of the assembling cooperative information mechanisms represent a general attribute of a system.

A wide area of applications includes behavior analysis, cognition, artificial intelligence, data organization and management, social systems, and education.

The considered results bring together the formal systemic model of the regularities of collective macrodynamics and the mathematical evaluation of a complex individual's behavior in a collective environment.

Megatrends are historical nexuses which gather and focus both obvious and subtle sub‐trends as a contribution to the history of future ideas. A substantive candidate of the twenty‐first century is “convergence”. That pursuit of “the unity of all knowledge” involves the integration, synthesis and confluence of different and often opposing intellectual concepts; and of seminal research developments and academic disciplines. Three major components and sets of authors are identified and examined: the technology of theology; the increasing interconnectedness of social, political and economic forces; and the interfacing of scientific, humanistic and spiritual domains.

The current paper is a brief review of the emerging field of quantum-like modelling in game theory. This paper aims to explore several quantum games, which are superior compared to their classical counterparts, which means either they give rise to superior Nash equilibria or they make the game fairer. For example, quantum Prisoners Dilemma generates Pareto superior outcomes as compared to defection outcome in the famous classical case. Again, a quantum-like version of cards game can make the game fairer, increasing the chance of winning of players who are disadvantaged in the classical case. This paper explores all the virtues of simple quantum games, also highlighting some findings of the authors as regards Prisoners Dilemma game.

As this is a general review paper, the authors have not demonstrated any specific mathematical method, rather explored the well-known quantum probability framework, used for designing quantum games. They have a short appendix which explores basic structure of Hilbert space representation of human decision-making.

Along with the review of the extant literature, the authors have also highlighted some new findings for quantum Prisoners Dilemma game. Specifically, they have shown in the earlier studies (which are referred to here) that a pure quantum entanglement set up is not needed for designing better games, even a weaker condition, which is classical entanglement is sufficient for producing Pareto improved outcomes.

Theoretical research, with findings and implications for future game designs, it has been argued that it is not always needed to have true quantum entanglement for superior Nash Equilibria.

The main purpose here is to raise awareness mainly in the social science community about the possible applications of quantum-like game theory paradigm. The findings related to Prisoners Dilemma game are, however, original.