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.

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):  
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.

scholarly journals QJava: A Monadic Java Library for Quantum Programming

2015 ◽  
Vol 22 (1) ◽  
pp. 242
Author(s):  
Juliana Kaizer Vizzotto ◽  
Bruno Crestani Calegaro
Keyword(s):  
Quantum Computing ◽  
Computer Science ◽  
Programming Languages ◽  
Programming Language ◽  
Quantum Algorithms ◽  
Quantum Circuit ◽  
Semantic Models ◽  
Quantum Programming ◽  
High Level ◽  
Java Library

To help the understanding and development of quantum algorithms there is an effort focused on the investigation of new semantic models and programming languages for quantum computing. Researchers in computer science have the challenge of deve loping programming languages to support the creation, analysis, modeling and simulation of high level quantum algorithms. Based on previous works that use monads inside the programming language Haskell to elegantly explain the odd characteristics of quantum computation (like superposition and entanglement), in this work we present a monadic Java library for quantum programming. We use the extension of the programming language Java called BGGA Closure, that allow the manipulation of anonymous functions (closures) inside Java. We exemplify the use of the library with an implementation of the Toffoli quantum circuit.

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 Quantum Generative Adversarial Networks for learning and loading random distributions

2019 ◽  
Vol 5 (1) ◽  
Author(s):  
Christa Zoufal ◽  
Aurélien Lucchi ◽  
Stefan Woerner
Keyword(s):  
Quantum State ◽  
Quantum Channel ◽  
Quantum Algorithms ◽  
Probability Distributions ◽  
Quantum Algorithm ◽  
Quantum Circuit ◽  
Quantum Simulation ◽  
Quantum States ◽  
Generative Adversarial Networks ◽  
Adversarial Networks

AbstractQuantum algorithms have the potential to outperform their classical counterparts in a variety of tasks. The realization of the advantage often requires the ability to load classical data efficiently into quantum states. However, the best known methods require $${\mathcal{O}}\left({2}^{n}\right)$$O2n gates to load an exact representation of a generic data structure into an $$n$$n-qubit state. This scaling can easily predominate the complexity of a quantum algorithm and, thereby, impair potential quantum advantage. Our work presents a hybrid quantum-classical algorithm for efficient, approximate quantum state loading. More precisely, we use quantum Generative Adversarial Networks (qGANs) to facilitate efficient learning and loading of generic probability distributions - implicitly given by data samples - into quantum states. Through the interplay of a quantum channel, such as a variational quantum circuit, and a classical neural network, the qGAN can learn a representation of the probability distribution underlying the data samples and load it into a quantum state. The loading requires $${\mathcal{O}}\left(poly\left(n\right)\right)$$Opolyn gates and can thus enable the use of potentially advantageous quantum algorithms, such as Quantum Amplitude Estimation. We implement the qGAN distribution learning and loading method with Qiskit and test it using a quantum simulation as well as actual quantum processors provided by the IBM Q Experience. Furthermore, we employ quantum simulation to demonstrate the use of the trained quantum channel in a quantum finance application.

Towards a quantum programming language

2004 ◽  
Vol 14 (4) ◽  
pp. 527-586 ◽  
Author(s):  
PETER SELINGER
Keyword(s):  
Programming Language ◽  
Quantum Algorithms ◽  
Denotational Semantics ◽  
Quantum Circuit ◽  
Structured Data ◽  
Data Types ◽  
Simple Quantum ◽  
Recursive Procedures ◽  
Quantum Programming ◽  
High Level

We propose the design of a programming language for quantum computing. Traditionally, quantum algorithms are frequently expressed at the hardware level, for instance in terms of the quantum circuit model or quantum Turing machines. These approaches do not encourage structured programming or abstractions such as data types. In this paper, we describe the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types. The language is functional in nature, statically typed, free of run-time errors, and has an interesting denotational semantics in terms of complete partial orders of superoperators.

scholarly journals Modular quantum computing and quantum-like devices

2021 ◽  
pp. 2150020
Author(s):  
R. Vilela Mendes
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Quantum Algorithms ◽  
The Other ◽  
Classical Systems ◽  
Evolution Parameter ◽  
Space Coordinate ◽  
The One ◽  
Classical Computer

The two essential ideas in this paper are, on the one hand, that a considerable amount of the power of quantum computation may be obtained by adding to a classical computer a few specialized quantum modules and on the other hand, that such modules may be constructed out of classical systems obeying quantum-like equations where a space coordinate is the evolution parameter (thus playing the role of time in the quantum algorithms).

scholarly journals OpenQL: A Portable Quantum Programming Framework for Quantum Accelerators

2022 ◽  
Vol 18 (1) ◽  
pp. 1-24
Author(s):  
N. Khammassi ◽  
I. Ashraf ◽  
J. V. Someren ◽  
R. Nane ◽  
A. M. Krol ◽  
...  
Keyword(s):  
Programming Language ◽  
Quantum Algorithms ◽  
Quantum Circuit ◽  
Quantum Operations ◽  
Programming Framework ◽  
Quantum Processor ◽  
Control Electronics ◽  
Quantum Programming ◽  
High Level ◽  
Programming Interface

With the potential of quantum algorithms to solve intractable classical problems, quantum computing is rapidly evolving, and more algorithms are being developed and optimized. Expressing these quantum algorithms using a high-level language and making them executable on a quantum processor while abstracting away hardware details is a challenging task. First, a quantum programming language should provide an intuitive programming interface to describe those algorithms. Then a compiler has to transform the program into a quantum circuit, optimize it, and map it to the target quantum processor respecting the hardware constraints such as the supported quantum operations, the qubit connectivity, and the control electronics limitations. In this article, we propose a quantum programming framework named OpenQL, which includes a high-level quantum programming language and its associated quantum compiler. We present the programming interface of OpenQL, we describe the different layers of the compiler and how we can provide portability over different qubit technologies. Our experiments show that OpenQL allows the execution of the same high-level algorithm on two different qubit technologies, namely superconducting qubits and Si-Spin qubits. Besides the executable code, OpenQL also produces an intermediate quantum assembly code, which is technology independent and can be simulated using the QX simulator.

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.

Sign in / Sign up

Export Citation Format

Share Document