Design of New Quantum/Reversible Ternary Subtractor Circuits

2015 ◽  
Vol 25 (02) ◽  
pp. 1650014 ◽  
Author(s):  
Asma Taheri Monfared ◽  
Majid Haghparast
Keyword(s):  
Quantum Computing ◽  
Significant Role ◽  
Quantum Circuits ◽  
Quantum Computers ◽  
Computing Technology ◽  
Arithmetic Operations ◽  
Toffoli Gate ◽  
Computational Systems

Ternary quantum circuits play a significant role in future quantum computing technology because they have many advantages over binary quantum circuits. Subtraction is considered as being one of the key arithmetic operations; hence, subtractors are very essential for the construction of various computational units of quantum computers and other complex computational systems. In this paper, we have proposed the realization of a quantum reversible ternary half-subtractor circuit using a generalized ternary gate, a ternary Toffoli gate, and a ternary C2NOT gate. Based on the realization of the ternary half-subtractor, we proposed the realization of a ternary full-subtractor.

scholarly journals Quantum arithmetic operations based on quantum fourier transform on signed integers

2020 ◽  
Vol 18 (06) ◽  
pp. 2050035
Author(s):  
Engin Şahin
Keyword(s):  
Fourier Transform ◽  
Quantum Circuits ◽  
Quantum Computers ◽  
Quantum Fourier Transform ◽  
Arithmetic Operations ◽  
Absolute Value ◽  
Addition And Subtraction ◽  
Quantum Arithmetic

The quantum Fourier transform (QFT) brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are examined. The capabilities of QFT-based addition and multiplication are improved with some modifications. The proposed operations are compared with the nearest quantum arithmetic operations. Furthermore, novel QFT-based subtraction, division and exponentiation operations are presented. The proposed arithmetic operations can perform nonmodular operations on all signed numbers without any limitation by using less resources. In addition, novel quantum circuits of two’s complement, absolute value and comparison operations are also presented by using the proposed QFT-based addition and subtraction operations.

scholarly journals Quantum computers are coming! But how to use their potential?

2021 ◽  
Vol 10 (1) ◽  
pp. 22-25
Author(s):  
Robert Wille
Keyword(s):  
Quantum Computing ◽  
Design Automation ◽  
Software Tools ◽  
Quantum Circuits ◽  
Quantum Computers ◽  
Automated Methods

Quantum computers are coming! But how to use their potential? Quantum computing is becoming a reality, but automated methods and software tools for this technology are just beginning. This project aims to develop automatic and efficient methods, e.g. for simulation, compilation, or verification of quantum circuits. DA QC will exploit design automation expertise proven powerful for conventional circuits and systems yet hardly utilised in quantum computing.

scholarly journals Quantum Computing in the NISQ era and beyond

Quantum ◽  
2018 ◽  
Vol 2 ◽  
pp. 79 ◽  
Author(s):  
John Preskill
Keyword(s):  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
Quantum Circuits ◽  
Quantum Gates ◽  
Quantum Computers ◽  
Many Body ◽  
Significant Step ◽  
Near Future

Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away - we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing.

scholarly journals An Extensible Computing Platform for Heavy Quantum Simulation Workloads

2021 ◽  
Author(s):  
Andrés García ◽  
José Ranilla ◽  
Raul Alonso Alvarez ◽  
Luis Meijueiro
Keyword(s):  
Quantum Computing ◽  
High Performance ◽  
Quantum Computer ◽  
General Purpose ◽  
Quantum Circuits ◽  
Quantum Computers ◽  
Computing Platform ◽  
Current State ◽  
Classical Computing ◽  
Computing Simulation

The shortage of quantum computers, and their current state of development, constraints research in many fields that could benefit from quantum computing. Although the work of a quantum computer can be simulated with classical computing, personal computers take so long to run quantum experiments that they are not very useful for the progress of research. This manuscript presents an open quantum computing simulation platform that enables quantum computing researchers to have access to high performance simulations. This platform, called QUTE, relies on a supercomputer powerful enough to simulate general purpose quantum circuits of up to 38 qubits, and even more under particular simulations. This manuscript describes in-depth the characteristics of the QUTE platform and the results achieved in certain classical experiments in this field, which would give readers an accurate idea of the system capabilities.

scholarly journals FPGA Based Hardware Abstraction of Quantum Computing System

2021 ◽  
Author(s):  
Madiha Khalid ◽  
Najam ul Islam MUHAMMAD ◽  
Umar Mujahid Khokhar ◽  
Atif Jafri ◽  
Hongsik Choi
Keyword(s):  
Quantum Computing ◽  
Embedded System ◽  
Computing System ◽  
Quantum Circuit ◽  
Atomic Scale ◽  
Quantum Circuits ◽  
Quantum Computers ◽  
Chip Design ◽  
Computational Resources ◽  
The Cost

Abstract The number of transistors per unit area are increasing every year by virtue of Moore’s law. It is estimated that the current rate of evolution in the field of chip design will reduce the transistor to atomic scale by 2024. At atomic level the quantum mechanical characteristics dominate, affecting the ability of transistors to store information in the form of bits. The quantum computers have been proposed as one way to effectively deal with this predicament. The quantum computing circuits utilize the spinning characteristics of electron to store information. This paper describes a proposition of resource efficient FPGA based quantum circuit abstraction. A non-programmable embedded system capable of storing, introducing a phase shift in the qubit and its measurement is implemented. The main objective of the proposed abstraction is to provide a FPGA based platform comprising of fundamental sub blocks for designing quantum circuits. A primary quantum key distribution algorithm i.e BB84 is implemented on the proposed platform as a proof of concept. The distinguishing feature of the proposed design is the flexibility to enhance the quantum circuit emulation accuracy at the cost of computational resources. The proposed emulation exhibits two principal properties of the quantum computing i.e. parallelism and probabilistic measurement.

scholarly journals Expressibility of the alternating layered ansatz for quantum computation

Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 434
Author(s):  
Kouhei Nakaji ◽  
Naoki Yamamoto
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Critical Issue ◽  
Quantum Circuits ◽  
Quantum Computers ◽  
Intermediate Scale ◽  
State Generation ◽  
Proper Definition ◽  
Definition Of ◽  
Designing Method

The hybrid quantum-classical algorithm is actively examined as a technique applicable even to intermediate-scale quantum computers. To execute this algorithm, the hardware efficient ansatz is often used, thanks to its implementability and expressibility; however, this ansatz has a critical issue in its trainability in the sense that it generically suffers from the so-called gradient vanishing problem. This issue can be resolved by limiting the circuit to the class of shallow alternating layered ansatz. However, even though the high trainability of this ansatz is proved, it is still unclear whether it has rich expressibility in state generation. In this paper, with a proper definition of the expressibility found in the literature, we show that the shallow alternating layered ansatz has almost the same level of expressibility as that of hardware efficient ansatz. Hence the expressibility and the trainability can coexist, giving a new designing method for quantum circuits in the intermediate-scale quantum computing era.

The Essence of Quantum Computing

2018 ◽  
Author(s):  
Rajendra K. Bera
Keyword(s):  
Hilbert Space ◽  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Turing Machines ◽  
Classical Physics ◽  
Core Set ◽  
The World ◽  
Subordinate Role

It now appears that quantum computers are poised to enter the world of computing and establish its dominance, especially, in the cloud. Turing machines (classical computers) tied to the laws of classical physics will not vanish from our lives but begin to play a subordinate role to quantum computers tied to the enigmatic laws of quantum physics that deal with such non-intuitive phenomena as superposition, entanglement, collapse of the wave function, and teleportation, all occurring in Hilbert space. The aim of this 3-part paper is to introduce the readers to a core set of quantum algorithms based on the postulates of quantum mechanics, and reveal the amazing power of quantum computing.

scholarly journals Practical Security of RSA Against NTC-Architecture Quantum Computing Attacks

2021 ◽  
Author(s):  
Kai Li ◽  
Qing-yu Cai
Keyword(s):  
Quantum Computing ◽  
Ion Trap ◽  
Quantum Algorithms ◽  
Coherence Time ◽  
Quantum Computers ◽  
Quantum Time ◽  
Speed Up ◽  
Key Length ◽  
Concurrent Architecture ◽  
Qubit Gate

AbstractQuantum algorithms can greatly speed up computation in solving some classical problems, while the computational power of quantum computers should also be restricted by laws of physics. Due to quantum time-energy uncertainty relation, there is a lower limit of the evolution time for a given quantum operation, and therefore the time complexity must be considered when the number of serial quantum operations is particularly large. When the key length is about at the level of KB (encryption and decryption can be completed in a few minutes by using standard programs), it will take at least 50-100 years for NTC (Neighbor-only, Two-qubit gate, Concurrent) architecture ion-trap quantum computers to execute Shor’s algorithm. For NTC architecture superconducting quantum computers with a code distance 27 for error-correcting, when the key length increased to 16 KB, the cracking time will also increase to 100 years that far exceeds the coherence time. This shows the robustness of the updated RSA against practical quantum computing attacks.

scholarly journals Decoherence dynamics estimation for superconducting gate-model quantum computers

2020 ◽  
Vol 19 (10) ◽  
Author(s):  
Laszlo Gyongyosi
Keyword(s):  
Gaussian Noise ◽  
Quantum Computer ◽  
Computer Architectures ◽  
Quantum Circuits ◽  
Optimal Placement ◽  
Quantum Computers ◽  
Intermediate Scale ◽  
Layout Generation ◽  
Quantum Technology ◽  
Physical Layout

Abstract Superconducting gate-model quantum computer architectures provide an implementable model for practical quantum computations in the NISQ (noisy intermediate scale quantum) technology era. Due to hardware restrictions and decoherence, generating the physical layout of the quantum circuits of a gate-model quantum computer is a challenge. Here, we define a method for layout generation with a decoherence dynamics estimation in superconducting gate-model quantum computers. We propose an algorithm for the optimal placement of the quantum computational blocks of gate-model quantum circuits. We study the effects of capacitance interference on the distribution of the Gaussian noise in the Josephson energy.

scholarly journals Efficient Quantum Circuits for One-Way Quantum Computing

2009 ◽  
Vol 102 (10) ◽  
Author(s):  
Tetsufumi Tanamoto ◽  
Yu-xi Liu ◽  
Xuedong Hu ◽  
Franco Nori
Keyword(s):  
Quantum Computing ◽  
Quantum Circuits
Sign in / Sign up

Export Citation Format

Share Document