We are observing in this pandemic situation of COVID-19 the world in
very challenging and to solve this complex problem in quick time. Today, we are facing a difficult complex problem such as Coronavirus. This Coronavirus affects human life. Quantum computing is the only support that can give us quick results by processing the Coronavirus compound at high computation speed. Whatever present circuits in VLSI domain, we cannot perform the high-speed computation and not tackle the complex case as present COVID-19. In this article, we have been discussed about quantumcomputing era during the pandemic situation ofCOVID-19. Further, this paper presents fundamental about quantum properties such as superpo-
sition, entanglement, and quantum programming tools such as Qiskit (IBM), pyQuil
(Google), ProjectQ (ETH), Revkit, and RCvewier + . We have presented quantum
circuit and its decomposed circuit of such gates as Toffoli, Fredkin, Peres, and new
fault tolerance. In addition, we proposed algorithm as transforming cascade to the
quantumcircuitwhich is extended for verification based.All these concepts presented here will be very useful to researcher, academician, and industry person to tackle this
pandemic situation of COVID-19.
Quantum computing - A Compilation of ConceptsGokul Alex
Excerpts of the Talk Delivered at the 'Bio-Inspired Computing' Workshop conducted by Department of Computational Biology and Bioinformatics, University of Kerala.
Quantum computing provides an alternative computational model based on quantum mechanics. It utilizes quantum phenomena such as superposition and entanglement to perform computations using quantum logic gates on qubits. This allows quantum computers to potentially solve certain problems exponentially faster than classical computers. However, building large-scale quantum computers remains a challenge. In the meantime, smaller quantum systems are being developed and quantum algorithms are being experimentally tested on these devices. Researchers are also working on methods to efficiently simulate quantum computations on classical computers.
1. The document discusses entanglement generation and state transfer in a Heisenberg spin-1/2 chain under an external magnetic field.
2. It analyzes the fidelity and concurrence of the system over time and temperature using the density matrix and Hamiltonian equations for a 2-qubit system.
3. The results show that maximally entangled states are difficult to achieve but desirable for quantum computation applications like quantum teleportation.
Technological Survey on Quantum ComputingIRJET Journal
This document provides a technological survey of quantum computing. It begins with an abstract that outlines how quantum computing uses principles like superposition and entanglement to extend computational abilities beyond what is possible with classical computers. It then reviews key concepts in quantum computing like qubits, quantum gates, superposition, and entanglement. It discusses the importance of quantum computing for solving complex problems that are intractable for classical computers. Potential applications of quantum computing discussed include healthcare for areas like diagnosis, drug discovery, and optimized treatment plans. In summary, the document surveys fundamental concepts and potential benefits of quantum computing as a new paradigm that can solve problems beyond the capabilities of classical computers.
Pulse Compression Sequence (PCS) are widely used in radar to increase the range resolution. Binary sequence has the limitation that the compression ratio is small. Ternary code is suggested as an alternative. The design of ternary sequence with good Discriminating Factor (DF) and merit factor can be considered as a nonlinear multivariable optimization problem which is difficult to solve. In this paper, we proposed a new method for designing ternary sequence by using Modified Simulated Annealing Algorithm (MSAA). The general features such as global convergence and robustness of the statistical algorithm are revealed.
The Extraordinary World of Quantum ComputingTim Ellison
Originally presented at QCon London - 6 March-2018.
The classical computer on your lap or housed in your data centre manipulates data represented with a binary encoding -- quantum computers are different. They use atomic level mechanics to represent multiple data states simultaneously, leading to a phenomenal exponential increase in the representable state of data, and new solutions to problems that are infeasible using today's classical computers. This session assumes no prior knowledge of quantum technology and presents a introduction to the field of quantum computing, including an introduction to the quantum bit, the types of problem suited to quantum computing, a demo of running algorithms on IBM's quantum machines, and a peek into the future of quantum computers.
Quantum computing uses quantum mechanics phenomena like superposition and entanglement to perform operations on quantum bits (qubits) and solve certain problems much faster than classical computers. One such problem is integer factorization, for which Peter Shor devised an algorithm in 1994 that a quantum computer could solve much more efficiently than classical computers. While quantum computing is still in development, it has the potential to break popular encryption systems like RSA and simulate quantum systems. Practical implementations of quantum computing include ion traps, NMR, optical photons, and solid-state approaches. Quantum computing could enable applications in encryption-breaking, simulation, and cryptography, among other areas.
Quantum computing uses quantum bits (qubits) that can exist in superpositions of states rather than just 1s and 0s. This allows quantum computers to perform exponentially more calculations in parallel than classical computers. Some of the main challenges to building quantum computers are preventing qubit decoherence from environmental interference, developing effective error correction methods, and observing outputs without corrupting data. Quantum computers may one day be able to break current encryption methods and solve optimization problems much faster than classical computers.
In this talk, a quantum approach is taken into account to solve NP-complete problems efficiently. But this approach does a non-linear transformation in terms of channels.
Quantum computing is an emerging new theory of computation based on the principles of quantum mechanics. It is the basis for a fundamentally new information processing model that is garnering increasing attention in the media and from commercial information technology companies. In certain computing tasks, it can theoretically arrive at a solution more efficiently than classical computers. In this session, we explore the basic principles behind quantum computing, including qubit superposition and entanglement -- the basis for quantum parallelism. We explore quantum logic gates as an abstracted representation of underlying hardware and discuss a simple quantum gate circuit that demonstrates parallelism. We also review the current state of the technology and what has been demonstrated compared to what is theoretically predicted. Current trends in the quantum computing industry will be presented along with proposed possible uses in biomedical informatics.
Quantum Computing 101, Part 1 - Hello Quantum WorldAaronTurner9
This is the first part of a blog series on quantum computing, broadly derived from CERN’s Practical introduction to quantum computing video series, Michael Nielson’s Quantum computing for the determined video series, and the following (widely regarded as definitive) references:
• [Hidary] Quantum Computing: An Applied Approach
• [Nielsen & Chuang] Quantum Computing and Quantum Information [a.k.a. “Mike & Ike”]
• [Yanofsky & Mannucci] Quantum Computing for Computer Scientists
My objective is to keep the mathematics to an absolute minimum (albeit not quite zero), in order to engender an intuitive understanding. You can think it as a quantum computing cheat sheet.
Strengths and limitations of quantum computingVinayak Sharma
Quantum computing as a research field has been around for about 30 years. It seems like a way to overcome the challenges that classical (boolean based) computers are facing due to “quantum tunneling” effect. Although, there are various theoretical and practical challenges that are needed to be dealt with if we want quantum computes to perform better that classical computers (i.e achieving “quantum supremacy”). This seminar will aim to shed light on basics of quantum computing and its strengths and weaknesses.
Video Links
Part 1: https://www.youtube.com/watch?v=-WLD_HnUvy0
Part 2: https://www.youtube.com/watch?v=xXzUmpk8ztU
Quantum computers are incredibly powerful machines that take a new approach to processing information. Built on the principles of quantum mechanics, they exploit complex and fascinating laws of nature that are always there, but usually remain hidden from view. By harnessing such natural behavior, quantum computing can run new types of algorithms to process information more holistically. They may one day lead to revolutionary breakthroughs in materials and drug discovery, the optimization of complex manmade systems, and artificial intelligence. We expect them to open doors that we once thought would remain locked indefinitely. Acquaint yourself with the strange and exciting world of quantum computing.
Quantum Computer is a machine that is used for Quantum Computation with the help of using Quantum Physics properties. Where classical computers encode information in binary “bits” that can either 0s or 1s but quantum computer use Qubits. Like the classical computer, the Quantum computer also uses 0 and 1, but qubits have a third state that allows them to represent one or zero at the same time and it’s called “Superposition”. This research paper has presented the Basics of Quantum Computer and The Future of Quantum Computer. So why Quantum Computer can be Future Computer, Because Quantum Computer is faster than any other computer, as an example, IBM’s Computer Deep Blue examined 200 million possible chess moves each second. Quantum Computer would be able to examine 1 trillion possible chess moves per second. It can be 100 million times faster than a classical computer. The computer makes human life easier and also focuses on increasing performance to make technology better. One such way is to reduce the size of the transistor and another way is to use Quantum Computer. The main aim of this paper is to know that how Quantum Computers can become the future computer.
This document provides an overview of quantum computing and cryptography. It introduces key concepts such as qubits, quantum gates, and the postulates of quantum mechanics. It describes Shor's algorithm for integer factorization and the BB-84 quantum cryptography protocol. It outlines the goals and timeline of a project to further research these topics, implement Shor's algorithm, develop a web simulator for BB-84, and compose a report on the findings.
"Part of the research community thinks that it is still early to tackle the development of quantum software engineering techniques. The reason is that how the quantum computers of the future will look like is still unknown. However, there are some facts that we can affirm today: 1) quantum and classical computers will coexist, each dedicated to the tasks at which they are most efficient. 2) quantum computers will be part of the cloud infrastructure and will be accessible through the Internet. 3) complex software systems will be made up of smaller pieces that will collaborate with each other. 4) some of those pieces will be quantum, therefore the systems of the future will be hybrid. 5) the coexistence and interaction between the components of said hybrid systems will be supported by service composition: quantum services.
This talk analyzes the challenges that the integration of quantum services poses to Service Oriented Computing."
This presentation provides an overview of quantum computers including:
- What they are and how they use quantum phenomena like superposition and entanglement to perform operations.
- Common algorithms like Shor's algorithm, Grover's algorithm, and Deutsch-Jozsa algorithm.
- Key concepts like qubits, quantum gates, entanglement, and bra-ket notation.
- Challenges like errors, decoherence, and difficulty verifying results against classical computers.
- Recent advances in building larger quantum computers with more qubits by companies like Intel, Google, and IBM.
Quantum computing, non-determinism, probabilistic systems... and the logic be...Alejandro Díaz-Caro
This document provides an introduction to quantum computing, λ-calculus, and typed λ-calculus. It discusses how these topics relate to intuitionistic logic through the Curry-Howard correspondence. The author is working on algebraic calculi and vectorial typing for non-determinism and probabilistic systems, and how this can be extended from non-determinism to probabilities. An example of Deutsch's algorithm for quantum computing is also presented.
Quantum computation uses quantum bits (qubits) that can exist in superposition and entanglement. Qubits are implemented using quantum systems that have discrete quantum states like energy levels of atoms. In contrast to classical bits that are either 0 or 1, qubits can be in superposition of states allowing quantum computers to perform operations on multiple possibilities simultaneously. Common quantum gates include Hadamard, CNOT, and CCN gates. The Hadamard gate puts qubits into superposition while CNOT and CCN gates introduce entanglement between qubits. Quantum computers have potential to solve certain problems faster than classical computers by exploiting superposition and entanglement.
The impact of quantum computing has been widely recognised in the engineering domain. The age of quantum computing has arrived, and with it comes the ability to easily solve exponential problems. This book is written by me to meet current academic demands. The book is designed to address the most important aspects of the subject of Quantum Computing. The publication of the book "Quantum Computing" is the culmination of numerous years of research and teaching in academia. It is given in a way that is straightforward to comprehend. The undergraduates, and graduate students may all benefit from reading this book. We have given our very best effort to bring you accurate book material.
The book explains the fundamentals of this topic in simple, straightforward language. The most efficient approach to go through this book is to grasp the underlying fundamental as well as mathematical concepts. The chapters are meant to stand on their own. This book is not intended to be theoretical; rather, it will serve to familiarise you with the fundamental of quantum computing, like applications, multiple-qubit systems, quantum state transformations, quantum gates and quantum circuits, tools for quantum computing, bell states, quantum Parallelism, quantum Algorithms: Shor’s Algorithm, Grover’s Algorithm, Quantum Hardware and software, Quantum Cryptography and Security, Quantum Error Rates and Quantum Noise, Quantum Fourier Transform, Quantum Machine Learning and so on.
The model questions and multiple-choice questions that are provided at the end of the book have been chosen to improve readers' understanding, as well as their performance in exams and key employment.
We warmly welcome and would be very appreciative of any comments or recommendations, that will help us enhance the overall quality of the book.
Cost-effective architecture of decoder circuits and futuristic scope in the e...VIT-AP University
The goal of Very Large Scale Integration (VLSI) over the past several decades has been the miniaturisation of chip size, along with increased computing speed and decreased power consumption. Miniaturization of size, high computing speed, and low power consumption does not appear to be able to meet the demand of consumers at this time. Quantum dot cellular automata is a more promising methodology that has the potential to optimise power, speed, and area at the nano-computing scale. In the field of nanocomputing, combinational circuit design has seen a significant amount of research and development effort. This article presents a comprehensive review as well as a proposed design of a decoder that has an accurate clocking mechanism and the best design. In terms of cell count, total area, cell area, area coverage, latency, QCA cost, and quantum cost, the novel 2-to-4 decoder achieves values of 87, 0.10, 0.0281, 28.1, 2.5, 0.625, 0.25, which is better than the prior work. Comparing the 2-to-4 decoder design to a standard design, the improvement is 72.64 %, 80 %, 72.71 %, 28.1 %, 64.28 %, 97,44 and 92.85 % in cell count, total area, cell area, area coverage, latency, QCA cost, and Quantum cost, respectively.
More Related Content
Similar to Concept and Algorithm of Quantum Computing During Pandemic Situation of COVID-19 (20)
Quantum computing uses quantum mechanics phenomena like superposition and entanglement to perform operations on quantum bits (qubits) and solve certain problems much faster than classical computers. One such problem is integer factorization, for which Peter Shor devised an algorithm in 1994 that a quantum computer could solve much more efficiently than classical computers. While quantum computing is still in development, it has the potential to break popular encryption systems like RSA and simulate quantum systems. Practical implementations of quantum computing include ion traps, NMR, optical photons, and solid-state approaches. Quantum computing could enable applications in encryption-breaking, simulation, and cryptography, among other areas.
Quantum computing uses quantum bits (qubits) that can exist in superpositions of states rather than just 1s and 0s. This allows quantum computers to perform exponentially more calculations in parallel than classical computers. Some of the main challenges to building quantum computers are preventing qubit decoherence from environmental interference, developing effective error correction methods, and observing outputs without corrupting data. Quantum computers may one day be able to break current encryption methods and solve optimization problems much faster than classical computers.
In this talk, a quantum approach is taken into account to solve NP-complete problems efficiently. But this approach does a non-linear transformation in terms of channels.
Quantum computing is an emerging new theory of computation based on the principles of quantum mechanics. It is the basis for a fundamentally new information processing model that is garnering increasing attention in the media and from commercial information technology companies. In certain computing tasks, it can theoretically arrive at a solution more efficiently than classical computers. In this session, we explore the basic principles behind quantum computing, including qubit superposition and entanglement -- the basis for quantum parallelism. We explore quantum logic gates as an abstracted representation of underlying hardware and discuss a simple quantum gate circuit that demonstrates parallelism. We also review the current state of the technology and what has been demonstrated compared to what is theoretically predicted. Current trends in the quantum computing industry will be presented along with proposed possible uses in biomedical informatics.
Quantum Computing 101, Part 1 - Hello Quantum WorldAaronTurner9
This is the first part of a blog series on quantum computing, broadly derived from CERN’s Practical introduction to quantum computing video series, Michael Nielson’s Quantum computing for the determined video series, and the following (widely regarded as definitive) references:
• [Hidary] Quantum Computing: An Applied Approach
• [Nielsen & Chuang] Quantum Computing and Quantum Information [a.k.a. “Mike & Ike”]
• [Yanofsky & Mannucci] Quantum Computing for Computer Scientists
My objective is to keep the mathematics to an absolute minimum (albeit not quite zero), in order to engender an intuitive understanding. You can think it as a quantum computing cheat sheet.
Strengths and limitations of quantum computingVinayak Sharma
Quantum computing as a research field has been around for about 30 years. It seems like a way to overcome the challenges that classical (boolean based) computers are facing due to “quantum tunneling” effect. Although, there are various theoretical and practical challenges that are needed to be dealt with if we want quantum computes to perform better that classical computers (i.e achieving “quantum supremacy”). This seminar will aim to shed light on basics of quantum computing and its strengths and weaknesses.
Video Links
Part 1: https://www.youtube.com/watch?v=-WLD_HnUvy0
Part 2: https://www.youtube.com/watch?v=xXzUmpk8ztU
Quantum computers are incredibly powerful machines that take a new approach to processing information. Built on the principles of quantum mechanics, they exploit complex and fascinating laws of nature that are always there, but usually remain hidden from view. By harnessing such natural behavior, quantum computing can run new types of algorithms to process information more holistically. They may one day lead to revolutionary breakthroughs in materials and drug discovery, the optimization of complex manmade systems, and artificial intelligence. We expect them to open doors that we once thought would remain locked indefinitely. Acquaint yourself with the strange and exciting world of quantum computing.
Quantum Computer is a machine that is used for Quantum Computation with the help of using Quantum Physics properties. Where classical computers encode information in binary “bits” that can either 0s or 1s but quantum computer use Qubits. Like the classical computer, the Quantum computer also uses 0 and 1, but qubits have a third state that allows them to represent one or zero at the same time and it’s called “Superposition”. This research paper has presented the Basics of Quantum Computer and The Future of Quantum Computer. So why Quantum Computer can be Future Computer, Because Quantum Computer is faster than any other computer, as an example, IBM’s Computer Deep Blue examined 200 million possible chess moves each second. Quantum Computer would be able to examine 1 trillion possible chess moves per second. It can be 100 million times faster than a classical computer. The computer makes human life easier and also focuses on increasing performance to make technology better. One such way is to reduce the size of the transistor and another way is to use Quantum Computer. The main aim of this paper is to know that how Quantum Computers can become the future computer.
This document provides an overview of quantum computing and cryptography. It introduces key concepts such as qubits, quantum gates, and the postulates of quantum mechanics. It describes Shor's algorithm for integer factorization and the BB-84 quantum cryptography protocol. It outlines the goals and timeline of a project to further research these topics, implement Shor's algorithm, develop a web simulator for BB-84, and compose a report on the findings.
"Part of the research community thinks that it is still early to tackle the development of quantum software engineering techniques. The reason is that how the quantum computers of the future will look like is still unknown. However, there are some facts that we can affirm today: 1) quantum and classical computers will coexist, each dedicated to the tasks at which they are most efficient. 2) quantum computers will be part of the cloud infrastructure and will be accessible through the Internet. 3) complex software systems will be made up of smaller pieces that will collaborate with each other. 4) some of those pieces will be quantum, therefore the systems of the future will be hybrid. 5) the coexistence and interaction between the components of said hybrid systems will be supported by service composition: quantum services.
This talk analyzes the challenges that the integration of quantum services poses to Service Oriented Computing."
This presentation provides an overview of quantum computers including:
- What they are and how they use quantum phenomena like superposition and entanglement to perform operations.
- Common algorithms like Shor's algorithm, Grover's algorithm, and Deutsch-Jozsa algorithm.
- Key concepts like qubits, quantum gates, entanglement, and bra-ket notation.
- Challenges like errors, decoherence, and difficulty verifying results against classical computers.
- Recent advances in building larger quantum computers with more qubits by companies like Intel, Google, and IBM.
Quantum computing, non-determinism, probabilistic systems... and the logic be...Alejandro Díaz-Caro
This document provides an introduction to quantum computing, λ-calculus, and typed λ-calculus. It discusses how these topics relate to intuitionistic logic through the Curry-Howard correspondence. The author is working on algebraic calculi and vectorial typing for non-determinism and probabilistic systems, and how this can be extended from non-determinism to probabilities. An example of Deutsch's algorithm for quantum computing is also presented.
Quantum computation uses quantum bits (qubits) that can exist in superposition and entanglement. Qubits are implemented using quantum systems that have discrete quantum states like energy levels of atoms. In contrast to classical bits that are either 0 or 1, qubits can be in superposition of states allowing quantum computers to perform operations on multiple possibilities simultaneously. Common quantum gates include Hadamard, CNOT, and CCN gates. The Hadamard gate puts qubits into superposition while CNOT and CCN gates introduce entanglement between qubits. Quantum computers have potential to solve certain problems faster than classical computers by exploiting superposition and entanglement.
The impact of quantum computing has been widely recognised in the engineering domain. The age of quantum computing has arrived, and with it comes the ability to easily solve exponential problems. This book is written by me to meet current academic demands. The book is designed to address the most important aspects of the subject of Quantum Computing. The publication of the book "Quantum Computing" is the culmination of numerous years of research and teaching in academia. It is given in a way that is straightforward to comprehend. The undergraduates, and graduate students may all benefit from reading this book. We have given our very best effort to bring you accurate book material.
The book explains the fundamentals of this topic in simple, straightforward language. The most efficient approach to go through this book is to grasp the underlying fundamental as well as mathematical concepts. The chapters are meant to stand on their own. This book is not intended to be theoretical; rather, it will serve to familiarise you with the fundamental of quantum computing, like applications, multiple-qubit systems, quantum state transformations, quantum gates and quantum circuits, tools for quantum computing, bell states, quantum Parallelism, quantum Algorithms: Shor’s Algorithm, Grover’s Algorithm, Quantum Hardware and software, Quantum Cryptography and Security, Quantum Error Rates and Quantum Noise, Quantum Fourier Transform, Quantum Machine Learning and so on.
The model questions and multiple-choice questions that are provided at the end of the book have been chosen to improve readers' understanding, as well as their performance in exams and key employment.
We warmly welcome and would be very appreciative of any comments or recommendations, that will help us enhance the overall quality of the book.
Cost-effective architecture of decoder circuits and futuristic scope in the e...VIT-AP University
The goal of Very Large Scale Integration (VLSI) over the past several decades has been the miniaturisation of chip size, along with increased computing speed and decreased power consumption. Miniaturization of size, high computing speed, and low power consumption does not appear to be able to meet the demand of consumers at this time. Quantum dot cellular automata is a more promising methodology that has the potential to optimise power, speed, and area at the nano-computing scale. In the field of nanocomputing, combinational circuit design has seen a significant amount of research and development effort. This article presents a comprehensive review as well as a proposed design of a decoder that has an accurate clocking mechanism and the best design. In terms of cell count, total area, cell area, area coverage, latency, QCA cost, and quantum cost, the novel 2-to-4 decoder achieves values of 87, 0.10, 0.0281, 28.1, 2.5, 0.625, 0.25, which is better than the prior work. Comparing the 2-to-4 decoder design to a standard design, the improvement is 72.64 %, 80 %, 72.71 %, 28.1 %, 64.28 %, 97,44 and 92.85 % in cell count, total area, cell area, area coverage, latency, QCA cost, and Quantum cost, respectively.
Efficient architecture for arithmetic designs using perpendicular NanoMagneti...VIT-AP University
As the process of scaling down continues at a rapid pace, there is a growing need for an alternative semiconductor device to replace CMOS. One of the alternatives that attracted a lot of attention is called nanomagnetic logic (NML). This is because NML delivers a high device density in addition to a non-volatility of stored information, beyond-CMOS technologies, and device work at room temperature. It is necessary to lower the circuit density and increase the speed of circuits like adders. Using emerging NML logic, we created a full-adder, and ripple carry adder (RCA) with a minimum area. As a result, the invented multilayer-based decimal design makes use of RCA, and full-adder, for innovative 3D topology. We used an NML framework built with perpendicular nanomagnetic (pNML) layers to simulate the characteristics of these devices. With the adder designs that have been offered the latency values are relatively low while performing exhaustive testing. Using pNML technology, a decimal adder has been constructed for the first time in the literature. In addition, simulations are carried out with the help of the Modelsim simulator. During the process of nanomagnetic designing consideration is given to both of these aspects as latency and area. To create an NML circuit, the tool MagCAD is employed. Results are better using the pNML environment-based full adder, RCA and decimal adder.
An in-depth study of the electrical characterization of supercapacitors for r...VIT-AP University
The Energy Storage System (ESS) is geared toward sophisticated systems with increased operating time for a variety of real-time applications such as an electric vehicle, a WSN (Wireless Sensor Network), a Capa bus, and so
on. Its primary focus is on supplying these kinds of systems with additional capacity in recent development, and
this will continue to be its primary focus. Because of their exceptionally high specific power, rapid charging, and
low ESR (Effective Series Resistance), electric double-layer (EDLC) capacitors or supercapacitors are encouraged
for use because they can be integrated more easily with battery technology that can be used in electric vehicles
and other electronic devices. The supercapacitor calls for a precise and accurate characterization in order to
facilitate the development of improved applications and more effective energy storage devices and technologies.
In this article, we studied various supercapacitor electrode components, electrolytic solutions, analogous circuit
models, electrical energy storage properties, and some real-time supercapacitor applications in the automotive,
manufacturing, construction, and consumer electronics industries. In addition, we have discussed on hybrid
material that was just recently developed with the goal of enhancing the conductivity and effectiveness of supercapacitors. Aside from this, we have discussed about the behaviour of supercapacitors in terms of how their behaviour is dependent on current and voltage with detailed analysis.
Content Addressable Memory Design in 3D pNML for Energy-Aware Sustainable Com...VIT-AP University
As the semiconductor industry strives for downsizing and high speed, it is confronted with
increasing scaling uncertainty as devices decrease to the nanoscale. Nano-magnetic logic (NML) is an alternative approach to synthesize the digital logic circuits with high-density and lowpower
consumption. We introduced an optimal design of content addressable memory (CAM)
memory based on perpendicular nano-magnetic logic (pNML). The main aim of this implementation
is to synthesize CAM memory in terms of latency and other design parameters. The implementation of the design is a multilayer approach, which is optimal. The synthesis approach
and optimization are perfectly scalable across layout construction of designs. Here a new logic gate in pNML technology is designed which is mainly used for matching of two input numbers. According to insight, both memory unit and a matching unit in the pNML are introduced in the state-of-the-artwork for the ¯rst time to synthesize design in high-speed pNML application. MAGCAD tool is used for the design of all the proposed pNML layouts.
Performance Evaluation & Design Methodologies for Automated 32 Bit CRC Checki...VIT-AP University
For design methodology of CRC or cyclic redundancy check is very used technique for error checking and shows the transmission reliability we are using the HDLC block. HDLC block is very useful in data communication these block operated in data link layer. For design methodology of CRC is to generate the CRC polynomial using XOR’s gate and shift register these polynomial are implement on software Xilinx Plan Ahead 13.1 and verify for simulation result for random testing of CRC bit on receiver side same result are obtained to show that it is more reliable.
Sensor Energy Optimization Using Fuzzy Logic in Wireless Sensor NetworkingVIT-AP University
Wireless sensor networks is challenging in that it requires an enormous breadth of knowledge from an enormous variety of disciplines. A lot of study has been done to minimize the energy used in routing and number of protocols has been developed. These protocols can be classified as - Hierarchical, data centric, location based and Network flow protocols. In this paper, we are particularly focusing on hierarchical protocols. In such types of protocols, the energy efficient clusters are formed with a hierarchy of cluster heads. Each cluster has its representative cluster head which is responsible for collecting and aggregating the data from its respective cluster and then transmitting this data to the Base Station either directly or through the hierarchy of other cluster heads. Fuzzy logic has been successfully applied in various areas including communication and has shown promising results. However, the potentials of fuzzy logic in wireless sensor networks still need to be explored. Optimization of wireless sensor networks involve various tradeoffs, for example, lower transmission power vs. longer transmission duration, multi-hop vs. direct communication, computation vs. communication etc. Fuzzy logic is well suited for application having conflicting requirements. Moreover, in WSN, as the energy metrics vary widely with the type of sensor node implementation platform, using fuzzy logic has the advantage of being easily adaptable to such changes.
Approach to design a high performance fault-tolerant reversible ALUVIT-AP University
In the digital circuit design, the primary factors are low power and a high packing density. The reversible logic circuit in quantum-dot cellular
automata (QCA) framework is hoped to be effective in addressing the factor of power consumption at nanoscale regime. Fault tolerant circuits are suited of interruption of errors at the outputs. This manuscript focuses the design of ALU in QCA-based and propose new parity preserving gate. It has been introduced that new reversible gate, namely, universal parity preserving gate (UPPG), to
optimise the ALU circuits. An algorithm and lemmas are shown in designing ALU. The ALU generates a number of arithmetic and logical function with using only less architectural complexity. Most importantly circuit design
focuses on optimising the gate count and quantum cost. In addition to optimisation, the workability of UPPG gate is tested by QCA and the simulation result obtained ensures the correctness of the design.
Novel conservative reversible error control circuits based on molecular QCAVIT-AP University
Quantum-dot cellular automata are a prominent part of the nanoscale regime. They
use a quantum cellular based architecture which enables rapid information process with high
device density. This paper targets the two kinds of novel error control circuits such as Hamming
code, parity generator and checker. To design the HG-PP (HG = Hamming gate, PP = parity
preserving), NG-PP (NG = new gate) are proposed for optimising the circuits. Based on the
proposed gates and a few existing gates, the Hamming code and parity generator and checker
circuits are constructed. The proposed gates have been framed and verified in QCA. The
simulation outcomes signify that their framed circuits are faultless. In addition to verification,
physical reversible is done. The reversible major metrics such as gate count, quantum cost, unit
delay, and garbage outputs, uses best optimisation results compared to counterparts. They can be utilised as a low power error control circuit applied in future communication systems.
A modular approach for testable conservative reversible multiplexer circuit f...VIT-AP University
Quantum technology has an attractive application nowadays for its minimizing the energy dissipation, which is a prominent
part of any system-level design. In this article, the significant module of a multiplexer, an extended to n:1 is framed with
prominent application in the control unit of the processor. The proposed multiplexer modules are framed by the algorithm,
which is extended perspective based. Further, quantum cost and gate count are less to ensure the efficient quantum computing
framed. In addition, the QCA computing framework is an attempt to synthesize the optimal primitives in conservative
reversible multiplexer in nano-electronic confine application. The developed lemmas is framed to prove the optimal parameters
in the reversible circuit. Compared with existing state-of-art-works, the proposed modular multiplexer, the gate count,
quantum cost and unit delay are optimal.
Analysis on Fault Mapping of Reversible Gates with Extended Hardware Descript...VIT-AP University
Quantum-dot cellular automata is a modern computing paradigm, conceived in feature of nanometer
scale with high integration density, and significant low power. For the QCA technology, making these
high-density design means an increase in the complexity which in turn leads to growth in the number of faults. The defect model presented in this paper categorized into two types, which include single missing and additional cell considering for QCA fault. Proposed gates have been designed in the
QCA and verified. The proposed Fredkin gate design has been compared with an existing design,
and 43% and 70% improvement in cell count and area respectively are revealed. Also, the Toffoli
design in QCA which achieve some parameters such as cell complexity of 39, and the average fault tolerance of 53.5%. The polarization value for both single cells missing an addition cell missing has been studied to explain the logic signal strength effect physically. A QCA framework for the 3-input
Ex-OR, 2:1 multiplexer, Fredkin, and Toffoli gate for the fault problem in which reliability analysis based on Hardware description language for QCA devices (HDLQ) is discussed and verified on the fault pattern look-up table.
A Novel and Efficient Design for Squaring Units by Quantum-Dot Cellular AutomataVIT-AP University
Quantum cell automata (QCA) are the best possible alternative to the
conventional CMOS technology due to its low power consumption, less area and high-speed operation. This paper describes synthesizable QCA implementation of squaring. Vedic sutras used for squaring are defined over algorithm construction. Based on the concept of the Vedic sutra, this paper has carried out 2-bit square and
4-bit square, projective to affine logic gates construction. Importantly for miniaturization
of devices, the QCA based square is the operation on which the area of
circuits relies on. This means that significantly lower QCA parameters can be used in
the square than in other competitive square circuits such as Wallace, Dadda, serial parallel,
and Baugh-Wooley.
A Redundant Adder Architecture in Ternary Quantum-Dot Cellular AutomataVIT-AP University
Now researchers are moving toward emerging technologies to replace the
conventional CMOS technology. Quantum-dot cellular automata (QCA) are one of
them for high-performance computing circuits. Ternary QCA is one of the finest
research areas in this domain for replacement of binary logic. In this paper, we
proposed a new redundant adder architecture using Ternary QCA technology. Our proposed architecture has 233 numbers of cells with an area of 0.35 μm2. All the proposed ternary logic layouts are implemented in TQCA designer tool.
Implementation of Non-restoring Reversible Divider Using a Quantum-Dot Cellul...VIT-AP University
The document describes the design and implementation of a non-restoring reversible divider circuit using quantum-dot cellular automata (QCA). Key points:
1) A non-restoring divider circuit was designed using Feynman and Haghparast gates in a reversible logic approach to minimize quantum cost and garbage outputs.
2) The divider circuit was synthesized and implemented in QCADesigner, achieving a cell complexity of 269 and area of 0.54 μm2.
3) The proposed reversible divider design was shown to have lower quantum cost, fewer garbage outputs, and gates than previous non-reversible divider designs.
An Explicit Cell-Based Nesting Robust Architecture and Analysis of Full AdderVIT-AP University
Moving towards micrometre scale to nanometre scale device shrinks down emerging nanometre technology such as quantum-dot cellular automata as a nesting
success. The introduced architecture is robust where the explicit design of full adder
and full subtraction uses for Ex-OR design. A new architecture of Ex-OR based on one majority gate is proposed, which its most optimized architecture and its placement of cells from the novel design. The analysis based on simulation showed that the
introduced Ex-OR and full adder makes only 11 and 46 cells count, respectively. In
proposed Ex-OR design, first output is received with no any latency which can be a
suitable design for implementation of the high-speed full adder design. In addition,
power estimation results are obtained after simulation of proposed designs in QCAPro
tool. Therefore, the novel designs improve the energy dissipation parameters such as mean leakage energy dissipation, mean switching energy dissipation and total energy dissipation 75, 11.28 and 82.19% in comparison with the most robust design in existing.
A Novel Parity Preserving Reversible Binary-to-BCD Code Converter with Testab...VIT-AP University
The reversible logic circuit is popular due to its quantum gates involved
where quantum gates are reversible and noted down feature of no information loss.
In this paper, parity preserving reversible binary-to-BCD code converter is
designed, and effect of reversible metrics is analyzed such as gate count, ancilla
input, garbage output, and quantum cost. This design can build blocks of basic
existing parity preserving reversible gates. The building blocks of the code converter
reversible circuit constructed on Toffoli gate based as well as elemental gate
based such as CNOT, C-V, and C-V+ gates. In addition, qubit transition analysis of
the quantum circuit in the regime of quantum computing has been presented. The heuristic approach has been developed in quantum circuit construction and the
optimized quantum cost for the circuit of binary-to-BCD code converter. Logic functions validate the development of quantum circuit. Moving the testability aim
are figured in the quantum logic circuit testing such as single missing gate and single missing control point fault.
Novel Robust Design for Reversible Code Converters and Binary Incrementer wit...VIT-AP University
This work, we employ computing around quantum-dot automata to
construct the architecture of the reversible code converters and binary incrementer. The code converter and binary incrementer are made up of Feynman gate and Peres
gate, respectively. We have presented the robust design of Ex-OR in QCA, which is used for the construction of code converters and binary incrementer. The layouts of proposed circuits were made using the primary elements such as majority gate, inverter, and binary wire. A novel binary-to-gray converter design offers 59% cell count reduction and 36% area reduction in primitives improvement from the
benchmark designs. Being pipeline of PG gate to construct the 1-bit, 2-bit, and 3-bit
binary incrementer, we can use this robust layout in the QCA implementation of binary incrementer. By the comparative result, it is visualized that the binary incrementer such as 1-bit, 2-bit, and 3-bit achieved 60.82, 60.72, and 64.79% improvement regarding cell count from the counterpart.
DESIGN OF MEDIAN FILTER IN QUANTUM-DOT CELLULAR AUTOMATA FOR IMAGE PROCESSING...VIT-AP University
This document summarizes a research paper that proposes a new design for a median filter using quantum-dot cellular automata (QCA). It uses a majority logic algorithm and one-hot encoding. For an input matrix of 9 numbers represented as 4-bit values, each column is processed independently by majority gates to determine the median value in 0.5 clock cycles. The proposed architecture scales to larger bit sizes while maintaining a constant delay of 0.5 clock cycles. Simulation results show the 1-bit median filter design occupies 0.05 μm2 and the proposed approach achieves better speed performance compared to other parameters as the bit size increases.
Low Power LC-Quadrature VCO with Superior Phase Noise Performance in 0.13 μmR...VIT-AP University
The presented work intends to encounter the challenge of optimizing frequency tracking
in the C-band WLAN spectrum, with a tuning range and phase noise (PN)
performance. A Quadrature Voltage Controlled Oscillator (QVCO) design in 130 nm
CMOS technology has been presented to cover the most sought WLAN/WiFi spectrum
of modern wireless systems, employing the current reuse technique and an
on-chip inductor implementation. To provide better compensation of LC losses at
reduced power dissipation, a cross-coupled structure combining NMOS and PMOS
has been used.We have run an extensive simulation using the industry-standard ADS
(Keysight technology) platform. The simulation study attributed to the superior phase
noise performance of − 160 dBc/Hz at 1 MHz (near f max) at a power dissipation
of 6.52 mW from 1.2 V supply. With the moderate voltage tuning range, the entire
desired frequency span of 5.400–5.495 GHz was obtained with a fairly high resolution
of 2.375 MHz/1 mV, which allows serving a larger crowd for this spectrum. A
fairly moderate VCO gain along with the obtained phase noise and power dissipation
provides a well-established Figure of Merit (FOM) of − 187 dB. Finally, a comparison
study in terms of power dissipation, phase noise, tuning range, voltage tuning,
and Kvco is performed to demonstrate that the provided work is considerably more
significant than traditional efforts.
FORCED STACK SLEEP TRANSISTOR (FORTRAN): A NEW LEAKAGE CURRENT REDUCTION APPR...VIT-AP University
Reduction in leakage current has become a significant concern in nanotechnology-based low-power, low-voltage, and high-performance VLSI applications. This research article discusses a new low-power circuit design the approach of FORTRAN (FORced stack sleep TRANsistor), which decreases the leakage power efficiency in the CMOS-based circuit outline in VLSI domain. FORTRAN approach reduces leakage current in both active as well as standby modes of operation. Furthermore, it is not time intensive when the circuit goes from active mode to standby mode and vice-versa. To validate the proposed design approach, experiments are conducted in the Tanner EDA tool of mentor graphics bundle on projected circuit designs for the full adder, a chain of 4-inverters, and 4-bit multiplier designs utilizing 180nm, 130nm, and 90nm TSMC technology node. The outcomes obtained show the result of a 95-98% vital reduction in leakage power as well as a 15-20% reduction in dynamic power with a minor increase in delay. The result outcomes are compared for accuracy with the notable design approaches that are accessible for both active and standby modes of operation.
As an AI intern at Edunet Foundation, I developed and worked on a predictive model for weather forecasting. The project involved designing and implementing machine learning algorithms to analyze meteorological data and generate accurate predictions. My role encompassed data preprocessing, model selection, and performance evaluation to ensure optimal forecasting accuracy.
THE RISK ASSESSMENT AND TREATMENT APPROACH IN ORDER TO PROVIDE LAN SECURITY B...ijfcstjournal
Local Area Networks(LAN) at present become an important instrument for organizing of process and
information communication in an organization. They provides important purposes such as association of
large amount of data, hardware and software resources and expanding of optimum communications.
Becase these network do work with valuable information, the problem of security providing is an important
issue in organization. So, the stablishment of an information security management system(ISMS) in
organization is significant. In this paper, we introduce ISMS and its implementation in LAN scop. The
assets of LAN and threats and vulnerabilities of these assets are identified, the risks are evaluated and
techniques to reduce them and at result security establishment of the network is expressed.
Kevin Corke Spouse Revealed A Deep Dive Into His Private Life.pdfMedicoz Clinic
Kevin Corke, a respected American journalist known for his work with Fox News, has always kept his personal life away from the spotlight. Despite his public presence, details about his spouse remain mostly private. Fans have long speculated about his marital status, but Corke chooses to maintain a clear boundary between his professional and personal life. While he occasionally shares glimpses of his family on social media, he has not publicly disclosed his wife’s identity. This deep dive into his private life reveals a man who values discretion, keeping his loved ones shielded from media attention.
This presentation provides a detailed overview of air filter testing equipment, including its types, working principles, and industrial applications. Learn about key performance indicators such as filtration efficiency, pressure drop, and particulate holding capacity. The slides highlight standard testing methods (e.g., ISO 16890, EN 1822, ASHRAE 52.2), equipment configurations (such as aerosol generators, particle counters, and test ducts), and the role of automation and data logging in modern systems. Ideal for engineers, quality assurance professionals, and researchers involved in HVAC, automotive, cleanroom, or industrial filtration systems.
Department of Environment (DOE) Mix Design with Fly Ash.MdManikurRahman
Concrete Mix Design with Fly Ash by DOE Method. The Department of Environmental (DOE) approach to fly ash-based concrete mix design is covered in this study.
The Department of Environment (DOE) method of mix design is a British method originally developed in the UK in the 1970s. It is widely used for concrete mix design, including mixes that incorporate supplementary cementitious materials (SCMs) such as fly ash.
When using fly ash in concrete, the DOE method can be adapted to account for its properties and effects on workability, strength, and durability. Here's a step-by-step overview of how the DOE method is applied with fly ash.
Expansive soils (ES) have a long history of being difficult to work with in geotechnical engineering. Numerous studies have examined how bagasse ash (BA) and lime affect the unconfined compressive strength (UCS) of ES. Due to the complexities of this composite material, determining the UCS of stabilized ES using traditional methods such as empirical approaches and experimental methods is challenging. The use of artificial neural networks (ANN) for forecasting the UCS of stabilized soil has, however, been the subject of a few studies. This paper presents the results of using rigorous modelling techniques like ANN and multi-variable regression model (MVR) to examine the UCS of BA and a blend of BA-lime (BA + lime) stabilized ES. Laboratory tests were conducted for all dosages of BA and BA-lime admixed ES. 79 samples of data were gathered with various combinations of the experimental variables prepared and used in the construction of ANN and MVR models. The input variables for two models are seven parameters: BA percentage, lime percentage, liquid limit (LL), plastic limit (PL), shrinkage limit (SL), maximum dry density (MDD), and optimum moisture content (OMC), with the output variable being 28-day UCS. The ANN model prediction performance was compared to that of the MVR model. The models were evaluated and contrasted on the training dataset (70% data) and the testing dataset (30% residual data) using the coefficient of determination (R2), Mean Absolute Error (MAE), and Root Mean Square Error (RMSE) criteria. The findings indicate that the ANN model can predict the UCS of stabilized ES with high accuracy. The relevance of various input factors was estimated via sensitivity analysis utilizing various methodologies. For both the training and testing data sets, the proposed model has an elevated R2 of 0.9999. It has a minimal MAE and RMSE value of 0.0042 and 0.0217 for training data and 0.0038 and 0.0104 for testing data. As a result, the generated model excels the MVR model in terms of UCS prediction.
MODULE 5 BUILDING PLANNING AND DESIGN SY BTECH ACOUSTICS SYSTEM IN BUILDINGDr. BASWESHWAR JIRWANKAR
: Introduction to Acoustics & Green Building -
Absorption of sound, various materials, Sabine’s formula, optimum reverberation time, conditions for good acoustics Sound insulation:
Acceptable noise levels, noise prevention at its source, transmission of noise, Noise control-general considerations
Green Building: Concept, Principles, Materials, Characteristics, Applications
Module4: Ventilation
Definition, necessity of ventilation, functional requirements, various system & selection criteria.
Air conditioning: Purpose, classification, principles, various systems
Thermal Insulation: General concept, Principles, Materials, Methods, Computation of Heat loss & heat gain in Buildings
Peak ground acceleration (PGA) is a critical parameter in ground-motion investigations, in particular in earthquake-prone areas such as Iran. In the current study, a new method based on particle swarm optimization (PSO) is developed to obtain an efficient attenuation relationship for the vertical PGA component within the northern Iranian plateau. The main purpose of this study is to propose suitable attenuation relationships for calculating the PGA for the Alborz, Tabriz and Kopet Dag faults in the vertical direction. To this aim, the available catalogs of the study area are investigated, and finally about 240 earthquake records (with a moment magnitude of 4.1 to 6.4) are chosen to develop the model. Afterward, the PSO algorithm is used to estimate model parameters, i.e., unknown coefficients of the model (attenuation relationship). Different statistical criteria showed the acceptable performance of the proposed relationships in the estimation of vertical PGA components in comparison to the previously developed relationships for the northern plateau of Iran. Developed attenuation relationships in the current study are independent of shear wave velocity. This issue is the advantage of proposed relationships for utilizing in the situations where there are not sufficient shear wave velocity data.
Build an IoT-based Weather Monitoring System Using Arduino?CircuitDigest
Build an IoT weather station with Arduino UNO R4 WiFi! Monitor temperature, humidity, air quality, and rainfall in real-time using local web server, no cloud needed.
Read more : https://circuitdigest.com/microcontroller-projects/how-to-build-an-iot-based-weather-monitoring-system-using-arduino
Ideal for smart farming, home automation, and environmental monitoring.
Perfect for Arduino enthusiasts, students, and IoT developers seeking hands-on weather station projects.
Optimize Indoor Air Quality with Our Latest HVAC Air Filter Equipment Catalogue
Discover our complete range of high-performance HVAC air filtration solutions in this comprehensive catalogue. Designed for industrial, commercial, and residential applications, our equipment ensures superior air quality, energy efficiency, and compliance with international standards.
📘 What You'll Find Inside:
Detailed product specifications
High-efficiency particulate and gas phase filters
Custom filtration solutions
Application-specific recommendations
Maintenance and installation guidelines
Whether you're an HVAC engineer, facilities manager, or procurement specialist, this catalogue provides everything you need to select the right air filtration system for your needs.
🛠️ Cleaner Air Starts Here — Explore Our Finalized Catalogue Now!
2. 524 N. Pathak et al.
like quantum computing. Quantum computing is an area that can handle a pandemic
situation of COVID-19 [2]. To study this small compound of coronavirus, we will
need a supercomputer or powerful computer that process the complex function with
very high speed [3]. This powerful supercomputer will study the protein structures.
As we are getting into this pandemic situation, we have to solve the COVID-19
problem by using an interdisciplinary approach and the latest technology [3]. As
we know that COVID-19 is a problem, it is an exponential it could be even more
complex in future [4]. To solve this exponential problem, we have to use a quantum
computer to solve the exponential problem in high computation speed [5].
A new paradigm of quantum computing during pandemic situation of COVID-19
has been presented with these main contributions.
• We present the basic concepts that can solve COIVD-19 problem in the era of
quantum computing.
• We discuss quantum computing two superpower states using it we can solve an
exponential problem like COVID-19
• We demonstrate the programming of quantum computers such as Qiskit (IBM),
pyQuil (Google), and ProjectQ (ETH),
• We demonstrate the programmable features of quantum circuit design and analysis
tool as Revkit, RCViewer+.
• We present the basic quantum gates into decomposition gates using programmable
quantum gates
• We propose an algorithm as transforming cascade to the quantum circuit. The
presented algorithm is verified by cascading of F2G and PG gates.
46.2 The Basic Aspect of Quantum Computing
We are observing that in this pandemic situation, we are resorting to the digital
computer that is working on the binary digits. We also have another computation
potential like quantum computer which is working on the Qubit [5]. As we come to
the qubit era world, we see that quantum computing is the best solution to solve the
exponential problem like COVID-19. If we see the computational power inside the
qubit which is the fast computing for huge data [6]. Qubit is the unit which gives
information in the quantum computing world.
46.2.1 Quantum Computing Principle States
Classical computers are work in binary digits such as 0 and 1. We can do these easy
problems with classical computers; but if there is a complex problem that is COVID-
19, we have to resort to quantum electronics era. As we see there is a COVID-19
virus in our nature, this is exponential problems. Quantum computing is the era
to tackle this exponential problem easily. As we go to some fundamental in the
3. 46 Concept and Algorithm of Quantum Computing … 525
quantum computing, we observe that quantum computing has two superpower states
as entanglement and superposition [7].
46.2.1.1 Superposition
In quantum computing, superposition is a property that tells multiple states at the
same time that can be anywhere and can be combined.
46.2.1.2 Entanglement
Entanglement is a property in the quantum computing world that makes the correla-
tion between quantum particles. Entanglement and superposition are two properties
in the quantum computing world that can perform the vast number of calculation
as fast as well as simultaneously [8]. We can analyze its COVID-19 compound in
the fast-way by using entanglement and superposition properties. If we look at the
classical digital computers, it is only on the binary digits like 1 and 0. If we see
the advantage of quantum computing, it is also processing by binary 1 and 0 and
superposition of 1 and 0. In classical computing, we cannot process the complex
tasks, but we can solve it by moving it to quantum computing era. If we look as
novel COVID-19, it is a complex compound here some different things are mixed in
it not like normal, so we can use the entanglement and superposition properties of
quantum computing to compute and analyze fast [9].
46.2.2 Qubit
Quantum computing does not binary digit which is a new unit like a qubit. In quantum
computing, there is no such state like 1 or 0 as in classical computers, here the
superposition of those classical states [10]. In a more formal way, qubit can exist as
1 and 0 or simultaneously as combined 1 and 0 with vector coefficient delegacy the
probability for each other. If we see in physical science, qubit can be projected by
the spin of the electron may be +1/2 and −1/2 based on orientation. Qubit has two
states like 1 and 0, which are associated with two number of eigenstates of the spin
of an electron as the below equations.
|0 = |↓, |1 = |↑, |0 + |1 = |↓ + |↑
4. 526 N. Pathak et al.
46.2.3 Concept of Thermodynamic in Quantum Computing
There is no information loss in the system then this concept of thermodynamic or
closed system utilize in quantum computing. A property always holds in quantum
gates is the information not erase. [11] If we see in a practical way in the digital
computer system, lots of information erase and heat dissipate inside. Whatever the
basic gates are in the digital computers like AND, NAND, NOR, Ex-OR, and OR,
it has the property that the information is always erased and the heat dissipate. All
the digital logic gates are information erase and heat generated. A famous scientist
Bennett has pointed that in quantum circuits are capable of information lossless.
All the quantum circuits can compute both forward and backwards direction and
hold all the inputs and output information based on the reversibility features [11].
When the forward computation is complete, our inputs information is restored in
the backwards computation. The property of reversible systems has forwards and
backward computation without erasing any information.
46.2.4 Quantum Computing Gates
Some prerequisite is there to synthesize a quantum circuit that we have covered
in this section. Quantum computing and reversible computing are interconnected;
in quantum circuits, all the gates must be reversible. The reversible gate has the
property does not lose the information based on the bijective mapping between
input and output. In the quantum electronics era, a qubit is a basic measurement
of information, whereas in conventional computer, basic unit of information is bits
like ‘1’ and ‘0.’ Some of the basic logic gates are presented in Fig. 46.1. To process
the qubit, we need some quantum circuits using some quantum gates like Toffoli
gate, Fredkin gate, and double Feynman gate. The existing reversible gates such
as Feynman double gate (F2G), Fredkin gate (FRG), Toffoli gate (TG), Feynman
gate (FG), and Peres gate (PG) have attracted the researcher’s attention during last
four decades for the synthesis and optimization of various kind of circuits [12, 13].
Fig. 46.1 Classical
computer gates
AND NAND
Ex-OR Ex-NOR
OR NOR
INVERTER
5. 46 Concept and Algorithm of Quantum Computing … 527
Table 46.1 Existing quantum gates
.v A,B,C
.i A,B,C
.o A,B,C
BEGIN
T3 A,B,C
END
Toffoli.tfc
.v A,B,C
.i A,B,C
.o A,B,C
BEGIN
T3 A,B,C
T2 A,C
END
PG.tfc
.v A,B,C
.i A,B,C
.o A,B,C
BEGIN
T2 C,B
T3 A,B,C
T2 C,B
END
FRG.tfc
.v A,B,C
.i A,B,C
.o A,B,C
BEGIN
T2 A,B
T2 A,C
END
F2G.tfc
1 2
1 2 3 4 5
1 2 3 4
1 2 3 4 5
QC=5
QC=4
QC=5
QC=2
Decomposition not possible
Reversible tfc
code realization
of quantum
circuit
Reversible circuit Quantum circuit
F2G
TG
PG
FRG
Table 46.1 shows reversible logic gates codes (use for quantum circuit construction),
reversible circuit, and quantum circuit.
46.2.5 Programming of Quantum Computers
To design any quantum circuit, we need basic reversible gates, programming, and
tool to design point of view. There are the latest tools and devices such as Qiskit
(IBM), pyQuil (Google), ProjectQ (ETH), Revkit, and RCViewer + to design and
compute qubits in quantum computers [14–18].
46.2.5.1 ProjectQ
ProjectQ is an open-source tool started at ETH Zurich that we can use in synthesizing
quantum circuit in quantum computing era. We synthesize quantum circuit through
quantum programs in Python.
6. 528 N. Pathak et al.
46.2.5.2 Qiskit
Qiskit is an open-source tool used in synthesizing the quantum circuit, observing
the circuit, simulating a circuit, unitary backend. Further, it is used as the quantum
circuit error analysis. In this tool, many libraries are available such as standard
gates, Boolean logic circuits gates, many generalized gates, many arithmetic circuits,
adders, comparator, and data encoding circuits. This tool provides with the design
and manipulation of quantum programming and environment like IBM Q in the
system. This tool was developed by IBM research and the initially released date on
March 7, 2017.
46.2.5.3 pyQuil
In this pyQuil, we do quantum programming using the python platform. This pyQuil
has three main tasks. The first tasks as from PyQuil we generate some program
which is used for quantum gates and its operations. Second tasks are quil compiler in
the quantum virtual machine is used for compiling and simulating quil programs in
python. In the third tasks, we can execute a quil program that is like a real quantum
processor as the use of quantum cloud services.
46.2.5.4 Revkit
Revkit is a tool in which we can design a quantum circuit and extract the quantum
parameters as ancilla input, garbage outputs, number of transistors, number of qubits
like one or two, and quantum cost.
Revkit tool design flow for the reversible circuit is summarized as:
(a) To synthesize the reversible circuits, GUI needs to be created in the Revkit-1.3
tool.
(b) The function (*.pla) provide the truth table of the reversible gate. In the embed-
ding, the box is interfaced the *.pla to exact synthesis box. The exact synthesis
box is the next GUI step. The optimal value of circuits cost is achieved by exact
synthesis.
(c) To achieve the reversible circuit and parameter, the circuit viewer and result
boxes are utilized in GUI in Revkit tool.
The complete flow to make this graphical user interface (GUI) is shown in
Fig. 46.2.
46.2.5.5 RCViewer+
RCViewer+ is a tool used in designing reversible circuits and parameters extraction.
Advantage of this tool is that if we have .tfc file then by using .tfc file, we can
7. 46 Concept and Algorithm of Quantum Computing … 529
a b
c
Fig. 46.2 GUI for quantum circuit construction based on Revkit-1.3 tool
decompose the quantum circuit into C-V, C-V+ gates and also phase, H and CNOT
gates as shown in Fig. 46.3. There is an optimization facility in RCViewer+ as
shown in Fig. 46.4. In the optimization process, we combine some quantum gates
and optimal circuit form. The benefit of an optimal circuit is that its performance
parameters are good like quantum cost. The benefit of less quantum cost is that it
will have few count of quantum gates in quantum circuits, and it will less delay from
input to output, and the performance of a circuit will be higher. We have also found
out the number of level in the quantum circuit as shown in Fig. 46.5. Through this
level, we have visualized how many quantum gates involved in the quantum circuit.
A simple procedure of parameters extraction is shown in Fig. 46.6.
Fig. 46.3 Decomposing of Toffoli circuits by RCViewer+
8. 530 N. Pathak et al.
Fig. 46.4 Optimize circuit example by RCViewer+
Fig. 46.5 Manipulation of number of levels by RCViewer+
46.3 Related Work
The structure of novel COVID-19 is nanoscale as shown in Fig. 46.7. We learned
in the literature that IBM has designed a quantum processor using superconductor
material for a qubit [19]. There is a Josephson junction in the quantum processor
because they are very close (100 nm) like the COVID19 virus as shown in Fig. 46.8.
This Josephson junction has a ground state and excited state that looks like the
9. 46 Concept and Algorithm of Quantum Computing … 531
Fig. 46.6 Extraction of parameters by RCViewer+
Fig. 46.7 Novel COVID-19
[19] a nanostructured,
b single-molecule structure
(a)
(b)
10. 532 N. Pathak et al.
Fig. 46.8 Quantum
processor using
superconductor material for
a qubit [19]
quantum computer and holds the different states such as entanglement, interference,
and superposition [20].
Looking at this pandemic situation of COVID-19 that we are getting the strong
motivation to introduce fundamentals of quantum computing and gives everyone to
understand this quantum technology [21–23].
46.4 The Proposed Algorithm Transforming Cascade
to Quantum Circuit
In this section, we have presented a method of cascading the multiple quantum
gates and draw its equivalent quantum circuit based on this proposed algorithm.
This algorithm is named as transforming cascade gates to the quantum circuit. The
detailed description of the transforming-cascaded reversible gate-based circuits into
respective quantum equivalent circuits has summarized in these process as.
Process 1. Prepare individual gate *.tfc code for the quantum gates associated in the
cascaded level of gate. This .tfc code is a quantum programming code which is used
for quantum circuit construction.
Process 2. We assign an alphabetical numbers to all the gates in the quantum circuit
to every nodes. One thing to keep in mind here is that whatever alphabetical number
on the output node, we have to put same as well on inputs.
11. 46 Concept and Algorithm of Quantum Computing … 533
Fig. 46.9 Transforming cascade F2G and PG gates to quantum circuit
Process 3. All the nodes we have to see on the combined gate-level architecture will
be prepared *.tfc code by seeing assigned alphabet numbers.
Process 4. The combined.tfc code for the cascaded gate-level circuit is obtained
using Rcviewer + tool, ready for decomposition, optimization, and quantum cost
calculation.
Figure 46.9 describes how the cascaded gates are combined after that we get the
quantum circuit. First, we go to the individual gates by generating the .pla code. In this
transforming cascade to quantum circuit algorithm, first of all, we need the .pla code
of the individual reversible gates. After that, we will level or assign some alphabets
to all inputs and outputs by going to the cascaded gates as F2G and PG combined
in Fig. 46.9. As the example in Fig. 46.9 two gates, F2G and PG are combined.
In the cascade gate, we do not change the sequence of alphabets to anyone while
assigning for inputs to outputs. After assigning this level to all the cascaded gates,
we need to generate the .pla file of the cascaded gates. Now we will input this
.pla file in GUI as mentioned in Fig. 46.2, after that, we have to go to simulation
after completing the GUI in Revkit. After this GUI completes, we will extract its
parameters as ancilla input, garbage outputs, number of transistors, number of qubits
like one or two, and quantum cost [24, 25]. This is the complete flow that we can
analyze quantum circuit performance based on parameters such as ancilla input,
garbageoutputs,numberoftransistors,numberofqubitslikeoneortwo,andquantum
cost. To be a good designer, we have to optimize all these parameters minimum.
Optimal parameters have benefit quantum circuits performance will be high and fast
computation. Optimizing these parameters has a good research topic in the quantum
computing era. This transforming algorithm is very useful for quantum circuit’s
construction based on cascade gates. This is an obstacle in research that there is no
12. 534 N. Pathak et al.
Fig. 46.10 Complete
quantum circuit of F2G and
PG
F2G PG
any algorithm for quantum circuit’s construction based on cascade gates; but through
this algorithm, we can design quantum circuits based on cascade gates in an effective
way. The complete quantum circuit of cascade F2G and PG is presented in Fig. 46.10.
46.5 Conclusion
There are some constraints in VLSI MOS devices like short channel effect and body
effect. At present pandemic, COVID-19 situation problem is exponential nature.
Now we have to use emerging technology such as quantum computing that can
solve this exponential nature problem effectively. In this article, we focus on the
COVID-19 exponential problem which has complex. Looking at this pandemic situ-
ation, quantum technology has a capable technology than can solve the complex
problem based on two properties such as superposition and entanglement. COVID-
19 compound structure analysis is required quantum circuit that effectively compute
and analyze. There is no method to bring the cascade gates to the quantum circuit in
state-of-the-artwork.Accordingly,wehavetopresentanewalgorithmthattransforms
complex circuit into a quantum circuit and becomes our work easy. In this article
effective algorithm as transforming cascade gates to the quantum, the circuit has been
introduced successfully. Further, the proposed algorithm discussed has verified by
the cascade of F2G and PG and meet the quantum circuits. In future, this algorithm
is very powerful in terms of transforming cascade gates to the quantum circuit, and
it will helpful for a designer who wants to synthesize any complex quantum circuits
based on cascade gates.
References
1. Nakagawa, K., Lokugamage, K.G., Makino, S.: Viral and cellular mRNA translation in
coronavirus-infected cells. Adv. Virus Res. Acad. Press 96, 165–192 (2016)
2. Online resources at. https://www.techrepublic.com/article/covid-19-quantum-computing-
could-someday-find-cures-for-coronaviruses-and-other-diseases/
3. Boopathi, S., Poma, A.B., Kolandaivel, P.: Novel 2019 coronavirus structure, mechanism of
action, antiviral drug promises and rule out against its treatment. J. Biomol. Struct. Dyn. 1–10
(2020)
4. Vijay, C.S., Gupta, V.: Quantum computing. Resonance 5(9), 69–81 (2000)
13. 46 Concept and Algorithm of Quantum Computing … 535
5. National Academies of Sciences, Engineering, and Medicine.: Quantum computing: progress
and prospects. National Academies Press (2019)
6. Humble, T.S., Thapliyal, H., Munoz-Coreas, E., Mohiyaddin, F.A., Bennink, R.S.: Quantum
computing circuits and devices. IEEE Design Test 36(3), 69–94 (2019)
7. Misra, N. K., Wairya, S., Singh, V. K.: Approach to design a high performance fault-tolerant
reversible ALU. Int. J. Circ. Archit. Des. 2(1), 83–103 (2016)
8. Bozzo-Rey, M., Longbottom, J., Müller, H.A.: Quantum computing: challenges and opportu-
nities. In: Proceedings of the 29th Annual International Conference on Computer Science and
Software Engineering, pp. 393–394 (2019)
9. Smith, K.N., Thornton, M. A.: Entangled state preparation for non-binary quantum computing.
In: IEEE International Conference on Rebooting Computing (ICRC), pp. 1–9 (2019)
10. Bennett, C.H.: Notes on the history of reversible computation. ibm J. Res. Dev 32(1), 16–23
(1988)
11. Feynman, R.: Feynman lectures on gravitation. CRC Press (2018)
12. Maslov, D., Dueck, G.W., Miller, D.M.: Synthesis of fredkin-toffoli reversible networks. IEEE
Transactions on Very Large Scale Integration (VLSI) Systems, 13(6), 765–769 (2005)
13. Cross, A.: The IBM Q experience and QISKit open-source quantum computing software. APS
2018, L58–003 (2018)
14. Radzihovsky, M., Espinosa, Z.: netQuil: A quantum playground for distributed quantum
computing simulations. Bull. Am. Phys. Soc. 65 (2020)
15. Steiger, D.S., Häner, T., Troyer, M.: ProjectQ: an open source software framework for quantum
computing. Quantum 2, 49 (2018)
16. Soeken, M., Frehse, S., Wille, R., Drechsler, R., RevKit, R.: A toolkit for reversible circuit
design. J. Multiple Valued Log. Soft Comput. 18(1), 55–65 (2012)
17. Arabzadeh, M., Saeedi, M.: RCViewer+: a viewer/analyzer for reversible and quantum circuits
(2018)
18. Gil, D., Green, W.M.: 1.4 The future of computing: Bits+Neurons+Qubits. In: 2020 IEEE
International Solid-State Circuits Conference-(ISSCC), pp. 30–39 (2020)
19. Gil, D., Mantas J., Sutor, R., Kesterson-Townes, L., Flöther, F., Schnabel, C.: Coming soon to
your business-quantum computing. Tech. Rep. 24. https://www.ibm.com/thought-leadership/
institute-business-value/report/quantumstrategy. (2018)
20. Barabasi, S., Barrera, J., Bhalani, P., Dalvi, P., Dimiecik, R., Leider, A., Tappert, C.C.: Student
user experience with the IBM Qiskit quantum computing interface. In: Future of Information
and Communication Conference, Springer, Cham pp. 547–563, (2019)
21. Tappert, C.C., Frank, R.I., Barabasi, I., Leider, A.M., Evans, D., Westfall, L.: Experience
teaching quantum computing. Assoc. Supporting Comput. Users Educ. (2019)
22. Chan, J., Guan, W., Sun, S., Wang, A.Z., Wu, S.L., Zhou, C., Di Meglio, A.: Application of
quantum machine learning to high energy physics analysis at lhc using ibm quantum computer
simulators and ibm quantum computer hardware. PoS, LeptonPhoton2019, 49 (2019)
23. Misra, N.K., Sen, B., Wairya, S.: Towards designing efficient reversible binary code converters
and a dual-rail checker for emerging nanocircuits. J. Comput. Electron. 16(2), 442–458 (2017)
24. Misra, N.K., Sen, B., Wairya, S., Bhoi, B.: Testable novel parity-preserving reversible gate
and low-cost quantum decoder design in 1D molecular-QCA. J. Circ. Syst. Comput. 26(09),
1750145 (2017)
25. Misra,N.K.,Wairya,S.,Singh,V.K.:Aninventivedesignof4*4bitreversibleNSgate.In:IEEE
International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014),
pp. 1–6 (2014)