scholarly journals Quantum Computing in the Biomedical Sciences; A Brief Introduction into Concepts and Applications

2019 ◽  
Vol 12 (3) ◽  
pp. 104
Author(s):  
Casper van der Kerk ◽  
Attila Csala ◽  
Aeilko H. Zwinderman
Keyword(s):  
Image Processing ◽  
Quantum Computing ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Biomedical Sciences ◽  
Quantum Bits ◽  
Early Stages ◽  
Made In

Quantum computing is a field that aims to exploit the principles of superposition and entanglement to perform computations. By using quantum bits (qubits) a quantum computer is able to perform certain tasks more efficiently when compared to classical computers. While applied quantum computing is still in its early stages, quantum algorithms on simulated quantum computers have already been applied to certain problems in epidemics modeling and image processing. Furthermore, companies like Google and IBM continue to develop new quantum computers with an increasing number of qubits. While much progress has been made in the recent years, the so called ”quantum supremacy”has not yet been achieved, and quantum computing appears to be still unsuitable for most applications in biomedical sciences.

scholarly journals Application of Quantum Computing to Biochemical Systems: A Look to the Future

2020 ◽  
Vol 8 ◽  
Author(s):  
Hai-Ping Cheng ◽  
Erik Deumens ◽  
James K. Freericks ◽  
Chenglong Li ◽  
Beverly A. Sanders
Keyword(s):  
Quantum Computing ◽  
Physical System ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Active Regions ◽  
Quantum Computers ◽  
The Future ◽  
Biochemical Systems ◽  
Near Term ◽  
Different Levels

Chemistry is considered as one of the more promising applications to science of near-term quantum computing. Recent work in transitioning classical algorithms to a quantum computer has led to great strides in improving quantum algorithms and illustrating their quantum advantage. Because of the limitations of near-term quantum computers, the most effective strategies split the work over classical and quantum computers. There is a proven set of methods in computational chemistry and materials physics that has used this same idea of splitting a complex physical system into parts that are treated at different levels of theory to obtain solutions for the complete physical system for which a brute force solution with a single method is not feasible. These methods are variously known as embedding, multi-scale, and fragment techniques and methods. We review these methods and then propose the embedding approach as a method for describing complex biochemical systems, with the parts not only treated with different levels of theory, but computed with hybrid classical and quantum algorithms. Such strategies are critical if one wants to expand the focus to biochemical molecules that contain active regions that cannot be properly explained with traditional algorithms on classical computers. While we do not solve this problem here, we provide an overview of where the field is going to enable such problems to be tackled in the future.

scholarly journals Quantum Computing Concepts with Deutsch Jozsa Algorithm

2019 ◽  
Vol 3 (1) ◽  
Author(s):  
Poornima Aradyamath ◽  
Naghabhushana N M ◽  
Rohitha Ujjinimatad
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Quantum Computation ◽  
Mathematical Description ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Quantum Fourier Transform ◽  
Basic Concepts ◽  
Classical Computer

In this paper, we briefly review the basic concepts of quantum computation,  entanglement,  quantum cryptography and quantum fourier  transform.   Quantum algorithms like Deutsch Jozsa, Shor’s   factorization and Grover’s data search are developed using fourier  transform  and quantum computation concepts to build quantum computers.  Researchers are finding a way to build quantum computer that works more efficiently than classical computer.  Among the  standard well known  algorithms  in the field of quantum computation  and communication we  describe  mathematically Deutsch Jozsa algorithm  in detail for  2  and 3 qubits.  Calculation of balanced and unbalanced states is shown in the mathematical description of the algorithm.

Bounds on the quantity of entanglement in parallel quantum computing of a single ensemble quantum computer

2014 ◽  
Vol 92 (2) ◽  
pp. 159-162
Author(s):  
M. Ávila Aoki ◽  
Guo Hua Sun ◽  
Shi Hai Dong
Keyword(s):  
Quantum Computing ◽  
Upper Bound ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Point Of View ◽  
The Other ◽  
Quantum Computers ◽  
Other Hand ◽  
Speed Up ◽  
Parallel Mode

Speeding up of the processing of quantum algorithms has been focused on from the point of view of an ensemble quantum computer (EQC) working in a parallel mode. As a consequence of such efforts, additional speed up has been achieved for processing both Shor’s and Grover’s algorithms. On the other hand, in the literature there is scarce concern about the quantity of entanglement contained in EQC approaches, for this reason in the present work we study such a quantity. As a first result, an upper bound on the quantity of entanglement contained in EQC is imposed. As a main result we prove that equally weighted states are not appropriate for EQC working in parallel mode. In order that our results are not exclusively purely theoretical, we exemplify the situation by discussing the entanglement on an ensemble of n1 = 3 diamond quantum computers.

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.

Efficient reversible quantum design of sig-magnitude to two's complement converters

2020 ◽  
Vol 20 (9&10) ◽  
pp. 747-765
Author(s):  
F. Orts ◽  
G. Ortega ◽  
E.M. E.M. Garzon
Keyword(s):  
Quantum Computing ◽  
Scientific Community ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
State Of The Art ◽  
The Other ◽  
Quantum Computers ◽  
Binary Number ◽  
Quantum Cost ◽  
The One

Despite the great interest that the scientific community has in quantum computing, the scarcity and high cost of resources prevent to advance in this field. Specifically, qubits are very expensive to build, causing the few available quantum computers are tremendously limited in their number of qubits and delaying their progress. This work presents new reversible circuits that optimize the necessary resources for the conversion of a sign binary number into two's complement of N digits. The benefits of our work are two: on the one hand, the proposed two's complement converters are fault tolerant circuits and also are more efficient in terms of resources (essentially, quantum cost, number of qubits, and T-count) than the described in the literature. On the other hand, valuable information about available converters and, what is more, quantum adders, is summarized in tables for interested researchers. The converters have been measured using robust metrics and have been compared with the state-of-the-art circuits. The code to build them in a real quantum computer is given.

The Realization of New Computing Model and System Research Related to Quantum Computer

2014 ◽  
Vol 1078 ◽  
pp. 413-416
Author(s):  
Hai Yan Liu
Keyword(s):  
Quantum Computing ◽  
High Performance ◽  
Quantum Physics ◽  
Quantum Computer ◽  
Quantum Computers ◽  
Information Coding ◽  
Computing Model ◽  
Mechanics Model ◽  
Electronic Spin ◽  
Classical Computer

The ultimate goal of quantum calculation is to build high performance practical quantum computers. With quantum mechanics model of computer information coding and computational principle, it is proved in theory to be able to simulate the classical computer is currently completely, and with more classical computer, quantum computation is one of the most popular fields in physics research in recent ten years, has formed a set of quantum physics, mathematics. This paper to electronic spin doped fullerene quantum aided calculation scheme, we through the comprehensive use of logic based network and based on the overall control of the two kinds of quantum computing model, solve the addressing problem of nuclear spin, avoids the technical difficulties of pre-existing. We expect the final realization of the quantum computer will depend on the integrated use of in a variety of quantum computing model and physical realization system, and our primary work shows this feature..

Quantum Algorithms

2021 ◽  
pp. 82-101
Author(s):  
Renata Wong ◽  
Amandeep Singh Bhatia
Keyword(s):  
Quantum Computing ◽  
Fault Tolerance ◽  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Computer Hardware ◽  
Quantum Mechanical ◽  
Computational Power ◽  
Quantum Devices ◽  
The Core

In the last two decades, the interest in quantum computation has increased significantly among research communities. Quantum computing is the field that investigates the computational power and other properties of computers on the basis of the underlying quantum-mechanical principles. The main purpose is to find quantum algorithms that are significantly faster than any existing classical algorithms solving the same problem. While the quantum computers currently freely available to wider public count no more than two dozens of qubits, and most recently developed quantum devices offer some 50-60 qubits, quantum computer hardware is expected to grow in terms of qubit counts, fault tolerance, and resistance to decoherence. The main objective of this chapter is to present an introduction to the core quantum computing algorithms developed thus far for the field of cryptography.

scholarly journals Compare the Similarity between Two Quantum Images

2021 ◽  
Author(s):  
You-hang Liu ◽  
Zai-dong Qi ◽  
Qiang Liu
Keyword(s):  
Image Processing ◽  
Digital Images ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Color Images ◽  
The Real ◽  
Image Processing Algorithms ◽  
Processing Algorithms ◽  
Quantum Images

Abstract Comparing the similarity between digital images is an important subroutine in various image processing algorithms. In this study, we present three quantum algorithms for comparing the similarity between two quantum images. These algorithms apply to binary, grey and color images respectively. Without considering the image preparation, the proposed algorithms achieve exponential acceleration than the existing quantum and classical methods in complexity. At the end of this paper, an experiment based on the real quantum computer of IBMQ and simulations verify the effectiveness of the algorithms.

Hidden symmetry detection on a quantum computer

2007 ◽  
Vol 7 (1&2) ◽  
pp. 83-92
Author(s):  
R. Schutzhold ◽  
W.G. Unruh
Keyword(s):  
Quantum Computer ◽  
Quantum Algorithms ◽  
Quantum Algorithm ◽  
Quantum Computers ◽  
Self Similarity ◽  
Hidden Subgroup Problem ◽  
Hidden Symmetry ◽  
Speed Up ◽  
Subgroup Problem ◽  
Discrete Scale

The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved efficiently by quantum computers, it will be demonstrated by means of a simple example, that the detection of more general hidden (two-point) symmetries {$V\{f(x),f(U[x])\}=0$} by a quantum algorithm can also admit an exponential speed-up. E.g., one member of this class of symmetries {$V\{f(x),f(U[x])\}=0$} is discrete self-similarity (or discrete scale invariance).

Sign in / Sign up

Export Citation Format

Share Document