The circuit model of quantum computation and its simulation with mathematica

Authors:
Vladimir P. Gerdt;Alexander N. Prokopenya
Affiliations:
Laboratory of Information Technologies, Joint Institute for Nuclear Research, Dubna, Moscow region, Russia;Collegium Mazovia in Siedlce, Siedlce, Poland
Venue:
MMCP'11 Proceedings of the 2011 international conference on Mathematical Modeling and Computational Science
Year:
2011

Citing 9
Cited 1

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
The Mathematica book (4th edition)

The Mathematica book (4th edition)
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Quantum computation and quantum information

Quantum computation and quantum information
Quantum Computer Science: An Introduction

Quantum Computer Science: An Introduction
A Mathematica Package for Simulation of Quantum Computation

CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Riemann's hypothesis and tests for primality

Journal of Computer and System Sciences
Some algorithms for calculating unitary matrices for quantum circuits

Programming and Computing Software
Applied Quantum Cryptography

Applied Quantum Cryptography

Simulation of quantum error correction by means of QuantumCircuit package

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider an application of the Mathematica package QuantumCircuit to simulation of quantum circuits implementing two of the best known quantum algorithms, namely, the Grover search algorithm and the Shor algorithm for order finding. The algorithms are discussed in detail and concrete examples of their application are demonstrated. The main features of the package QuantumCircuit which can be used for the simulation of an arbitrary quantum algorithm are briefly described.