The Essence of Quantum Computing

2018 ◽  
Author(s):  
Rajendra K. Bera
Keyword(s):  
Wave Function ◽  
Quantum Mechanics ◽  
Quantum Computing ◽  
Quantum Computation ◽  
Quantum Algorithms ◽  
Underlying Mechanism ◽  
Quantum States ◽  
Quantum Computers ◽  
Efficient Computation

In Part I we laid the foundation on which quantum algorithms are built. In part II we harnessed such exotic aspects of quantum mechanics as superposition, entanglement and collapse of quantum states to show how powerful quantum algorithms can be constructed for efficient computation. In Part III (the concluding part) we discuss two aspects of quantum computation: (1) the problem of correcting errors that inevitably plague physical quantum computers during computations, by algorithmic means; and (2) a possible underlying mechanism for the collapse of the wave function during measurement.

The Essence of Quantum Computing

2018 ◽  
Author(s):  
Rajendra K. Bera
Keyword(s):  
Quantum Computing ◽  
Fourier Series ◽  
Linear Algebra ◽  
Quantum Algorithms ◽  
Quantum States ◽  
Efficient Computation

In Part I we laid the foundation on which quantum algorithms are built. In this part we harness such exotic aspects as superposition, entanglement and collapse of quantum states of that foundation to show how powerful quantum algorithms can be constructed for efficient computation. Appendixes A and B are provided to jog the memory of those who are recently out of touch with linear algebra and Fourier series.

Quantum Computing and Quantum Communication

2018 ◽  
pp. 7715-7730
Author(s):  
Göran Pulkkis ◽  
Kaj J. Grahn
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Quantum Cryptography ◽  
Quantum Algorithms ◽  
Quantum Circuit ◽  
Quantum States ◽  
Future Perspectives ◽  
Quantum Informatics ◽  
Quantum Programming ◽  
Computing Models

This article presents state-of-the-art and future perspectives of quantum computing and communication. Timeline of relevant findings in quantum informatics, such as quantum algorithms, quantum cryptography protocols, and quantum computing models, is summarized. Mathematics of information representation with quantum states is presented. The quantum circuit and adiabatic models of quantum computation are outlined. The functionality, limitations, and security of the quantum key distribution (QKD) protocol is presented. Current implementations of quantum computers and principles of quantum programming are shortly described.

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.

scholarly journals Programming gate-based hardware quantum computers for music

Muzikologija ◽  
2018 ◽  
pp. 21-37
Author(s):  
Alexis Kirke
Keyword(s):  
Quantum Mechanics ◽  
Quantum Computing ◽  
Quantum Computation ◽  
Computer Music ◽  
Quantum Computer ◽  
Quantum Computers ◽  
Future Contribution ◽  
Computer Algorithms ◽  
Quantum Processes ◽  
D Wave

There have been significant attempts previously to use the equations of quantum mechanics for generating sound, and to sonify simulated quantum processes. For new forms of computation to be utilized in computer music, eventually hardware must be utilized. This has rarely happened with quantum computer music. One reason for this is that it is currently not easy to get access to such hardware. A second is that the hardware available requires some understanding of quantum computing theory. This paper moves forward the process by utilizing two hardware quantum computation systems: IBMQASM v1.1 and a D-Wave 2X. It also introduces the ideas behind the gate-based IBM system, in a way hopefully more accessible to computerliterate readers. This is a presentation of the first hybrid quantum computer algorithm, involving two hardware machines. Although neither of these algorithms explicitly utilize the promised quantum speed-ups, they are a vital first step in introducing QC to the musical field. The article also introduces some key quantum computer algorithms and discusses their possible future contribution to computer music.

Quantum Computing and Quantum Communication

2019 ◽  
pp. 1641-1659
Author(s):  
Göran Pulkkis ◽  
Kaj J. Grahn
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Quantum Cryptography ◽  
Quantum Algorithms ◽  
Quantum Circuit ◽  
Quantum States ◽  
Future Perspectives ◽  
Quantum Informatics ◽  
Quantum Programming ◽  
Computing Models

This chapter presents state-of-the-art and future perspectives of quantum computing and communication. Timeline of relevant findings in quantum informatics, such as quantum algorithms, quantum cryptography protocols, and quantum computing models, is summarized. Mathematics of information representation with quantum states is presented. The quantum circuit and adiabatic models of quantum computation are outlined. The functionality, limitations, and security of the quantum key distribution (QKD) protocol is presented. Current implementations of quantum computers and principles of quantum programming are shortly described.

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 Using quantum computing to create efficient algorithms

2021 ◽  
Vol 2056 (1) ◽  
pp. 012059
Author(s):  
I N Balaba ◽  
G S Deryabina ◽  
I A Pinchuk ◽  
I V Sergeev ◽  
S B Zabelina
Keyword(s):  
Quantum Mechanics ◽  
Quantum Computing ◽  
Computational Model ◽  
Exponential Growth ◽  
Quantum Algorithms ◽  
Quantum Systems ◽  
Efficient Algorithms ◽  
Historical Overview ◽  
Computing Model ◽  
Computational Strategy

Abstract The article presents a historical overview of the development of the mathematical idea of a quantum computing model - a new computational strategy based on the postulates of quantum mechanics and having advantages over the traditional computational model based on the Turing machine; clarified the features of the operation of multi-qubit quantum systems, which ensure the creation of efficient algorithms; the principles of quantum computing are outlined and a number of efficient quantum algorithms are described that allow solving the problem of exponential growth of the complexity of certain problems.

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 The Strange (Hi)story of Particles and Waves

2016 ◽  
Vol 71 (3) ◽  
pp. 195-212
Author(s):  
H. Dieter Zeh
Keyword(s):  
Wave Function ◽  
Quantum Mechanics ◽  
Quantum Theory ◽  
Excited States ◽  
Configuration Space ◽  
Historical Context ◽  
Quantum States ◽  
Wave Functions ◽  
General Readership ◽  
Boson Fields

AbstractThis is an attempt of a non-technical but conceptually consistent presentation of quantum theory in a historical context. While the first part is written for a general readership, Section 5 may appear a bit provocative to some quantum physicists. I argue that the single-particle wave functions of quantum mechanics have to be correctly interpreted as field modes that are “occupied once” (i.e. first excited states of the corresponding quantum oscillators in the case of boson fields). Multiple excitations lead to apparent many-particle wave functions, while the quantum states proper are defined by wave function(al)s on the “configuration” space of fundamental fields, or on another, as yet elusive, fundamental local basis.

Sign in / Sign up

Export Citation Format

Share Document