Quantum Computing

  title={Quantum Computing},
  author={Mika Hirvensalo},
  booktitle={Natural Computing Series},
  • M. Hirvensalo
  • Published in Natural Computing Series 2004
  • Computer Science

Quantum algorithms: A survey of some recent results

  • M. Rötteler
  • Computer Science, Physics
    Informatik - Forschung und Entwicklung
  • 2006
An overview of the known quantum algorithms and briefly describe the underlying ideas are given, which have been proved to be a prolific source of algorithms in which a polynomial speed-up as compared to classical algorithms can be achieved.

Quantum Data Compression

The topic of the report is Quantum Data Compression, a central problem to storage and transmission of data, and an overview of Classical Coding Theory and the main concepts of Quantum Coding theory is presented.

Guest Column

The class BQP of problems solvable in polynomial time on quantum Turing machines, focusing attention on relations with the corresponding deterministic and probabilistic classes P and BPP, respectively, is introduced.

Quantum t-design

The Classical notions of Computation are rapidly entering Quantum Computation. People try to find Quantum counterparts for Classical concepts. In this essay, we will discuss about classical t-design,

Comparison of Selection Strategies for Evolutionary Quantum Circuit Design

This paper analyzes different selection strategies, which are applied to the Deutsch-Jozsa problem and the 1-SAT problem using the GP system and shows the effects of adding randomness to the selection mechanism of a (1,10) selection strategy.

QuFlow: Visualizing Parameter Flow in Quantum Circuits for Understanding Quantum Computation

QuFlow is presented, an interactive visualization tool for teaching the fundamentals of quantum computation, which can be used to build a quantum circuit, then QuFlow will simulate the quantum circuit in a classical computer.

Irreversibility and Universality in Quantum Computation

At the end of the XIX century, classical physics was in a position to solve a very large number of problems [33]: Maxwell's equations and classical statistical mechanics were able to provide a good

A pr 2 00 5 A functional quantum programming language

QML integrates reversible and irreversible quantum computations in one language, using first order strict linear logic to make weakenings explicit, and preserves superpositions and entanglement – which is essential for quantum parallelism.


We define a quantum operation as a special type of endomorphism between spaces of matrices. Representations of endomorphisms are considered and an isomorphism between higher dimensional matrices and

Photonic Realization of a Quantum Finite Automaton

A physical implementation of a quantum finite automaton recognizing a well known family of periodic languages and exploiting the polarization degree of freedom of single photons and their manipulation through linear optical elements is described.


Membrane Computing: An Introduction

This chapter discusses Membrane Computing, What It Is and What It is Not, and attempts to get back to reality with open problems and Universality results.