Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Annales Universitatis Mariae Curie-Sklodowska sectio AI – Informatica

Simulations of quantum systems evolution with quantum-octave package

Piotr Gawron, Jarosław Adam Miszczak

Published Jan 4, 2015• 2 citations
Publisher

Abstract

Article presents package of functions for GNU Octave computer algebra system. Those functions were designed to perform simple but not necessary efficient simulations of quantum systems, especially quantum computers. The most important feature of this package is the ability to perform calculations with mixed states.We describe application of quantum-octave package for simulation of Grovers algorithm, which is one of the most important quantum algorithms. We also list other possible calculations, which can be performed with this package.

DOI
10.17951/ai.2004.2.1.47-56

Related papers

Simulating quantum circuits with GNU Octave and Python

Makhamisa Senekane, Lerato Mohapi, Francesco Petruccione

Quantum algorithms are known to be more powerful than their classical counterparts, in the sense that they offer huge speed-ups as opposed to their classical counterparts. Physical realization of quantum algorithms results in the building of quantum circuits, which are in turn used to build a quantum computer. Unfortunately, a full-scale quantum computer is yet to be realized, hence why quantum algorithms are currently modelled on classical computers. In this work, we report the simulation of quantum circuits using GNU Octave and Python Programming languages. Additionally, performance of these languages on simulating such circuits is compared. Quantum circuits simulated are: the circuit for preparing a two-qubit entanglement (Einstein-Podolsky-Rosen (EPR) state), the one for preparing a three-qubit entanglement (Greenberger-Horne-Zeilinger (GHZ) state), swap circuit and Quantum Fourier Transform (QFT).

IEEE AFRICON•Sep 1, 2013•1 citation

Extending scientific computing system with structural quantum programming capabilities

P. Gawron, J. Klamka, Jarosław Adam Miszczak +1 more

Abstract. We present the basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming languages and we use quantum pseudo-code based on QCL quantum programming language to describe them. We also present the implementation of introduced structures in GNU Octave language for scientific computing. Procedures used in the implementation are available as a package quantum-octave providing library of functions, which facilitates the simulation of quantum computing. This package allows also to incorporate high-level programming concepts into the simulation in GNU Octave and Matlab. As such it connects features unique for higl-level quantum programming languages, with the full palette of efficient computational routines commonly available in modern scientific computing systems. To present the major features of the described package we provide the implementation of selected quantum algorithms. We also show how quantum errors can be taken into account during the simulation of quantum algorithms using quantum-octave package. This is possible thanks to the ability to operate on density matrices implemented in quantum-octave. Key words: quantum information, quantum programming, models of quantum computation. 1.

•Jan 1, 2009•14 citations

Extending scientific computing system with structural quantum programming capabilities

Piotr Gawron, J. Klamka, J. Miszczak +1 more

We present a basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming languages and we use quantum pseudo-code based on QCL quantum programming language to describe them. We also present the implementation of introduced structures in GNU Octave language for scientific computing. Procedures used in the implementation are available as a package quantum-octave, providing a library of functions, which facilitates the simulation of quantum computing. This package allows also to incorporate high-level programming concepts into the simulation in GNU Octave and Matlab. As such it connects features unique for high-level quantum programming languages, with the full palette of efficient computational routines commonly available in modern scientific computing systems. To present the major features of the described package we provide the implementation of selected quantum algorithms. We also show how quantum errors can be taken into account during the simulation of quantum algorithms using quantum-octave package. This is possible thanks to the ability to operate on density matrices.

arXiv:1006.1549•Bulletin of the Polish Academy of Sciences Technical Sciences•Jan 1, 2010•5 citations

Simulation on quantum authentication

Miroslav Dobšíček

This paper divides into two main parts. The first one discusses authentication of quantum messages. The protocol proposed in [1] for one qubit message-length case is especially considered. The protocol uses a shared EPR pair as a secret key. In the second part, it is shown how such a protocol can be simulated using the Quantum-Octave package. Quantum-Octave is a set of functions for a Matlab-like numerical environment allowing calculations with general density matrices.

Physics of Particles and Nuclei Letters•Mar 1, 2007•0 citations

NUMERICAL SIMULATIONS OF MIXED STATE QUANTUM COMPUTATION

Piotr Gawron, Jarosław Adam Miszczak

We describe the [Formula: see text] package of functions useful for simulations of quantum algorithms and protocols. The presented package allows one to perform simulations with mixed states. We present numerical implementation of important quantum mechanical operations — partial trace and partial transpose. Those operations are used as building blocks of algorithms for analysis of entanglement and quantum error correction codes. A simulation of Shor's algorithm is presented as an example of package capabilities.

arXiv:quant-ph/0406211•International Journal of Quantum Information•Dec 16, 2004•9 citations

Using computer algebra in quantum computation and quantum games

David A. Bolívar

Research in contemporary physics is emphasizing the development and evolution of computer systems to facilitate the calculations. Quantum computing is a branch of modern physics is believed promising results for the future, Thanks to the ability of qubits to store more information than a bit. The work of this paper focuses on the simulation of certain quantum algorithms such as the prisoner's dilemma in its quantum version using the MATHEMATICA® software and implementing stochastic version of the software MAPLE ® and the Grover search algorithm that simulates finding a needle in a haystack.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 13, 2011•0 citations
Article presents package of functions for GNU Octave computer algebra system. Those functions were designed to perform simple but not necessary efficient simulations of quantum systems, especially quantum computers. The most important feature of this package is the ability to perform calculations with mixed states.We describe application of quantum-octave package for simulation of Grovers algorithm, which is one of the most important quantum algorithms. We also list other possible calculations, which can be performed with this package.
Quantum algorithms are known to be more powerful than their classical counterparts, in the sense that they offer huge speed-ups as opposed to their classical counterparts. Physical realization of quantum algorithms results in the building of quantum circuits, which are in turn used to build a quantum computer. Unfortunately, a full-scale quantum computer is yet to be realized, hence why quantum algorithms are currently modelled on classical computers. In this work, we report the simulation of quantum circuits using GNU Octave and Python Programming languages. Additionally, performance of these languages on simulating such circuits is compared. Quantum circuits simulated are: the circuit for preparing a two-qubit entanglement (Einstein-Podolsky-Rosen (EPR) state), the one for preparing a three-qubit entanglement (Greenberger-Horne-Zeilinger (GHZ) state), swap circuit and Quantum Fourier Transform (QFT).
Abstract. We present the basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming languages and we use quantum pseudo-code based on QCL quantum programming language to describe them. We also present the implementation of introduced structures in GNU Octave language for scientific computing. Procedures used in the implementation are available as a package quantum-octave providing library of functions, which facilitates the simulation of quantum computing. This package allows also to incorporate high-level programming concepts into the simulation in GNU Octave and Matlab. As such it connects features unique for higl-level quantum programming languages, with the full palette of efficient computational routines commonly available in modern scientific computing systems. To present the major features of the described package we provide the implementation of selected quantum algorithms. We also show how quantum errors can be taken into account during the simulation of quantum algorithms using quantum-octave package. This is possible thanks to the ability to operate on density matrices implemented in quantum-octave. Key words: quantum information, quantum programming, models of quantum computation. 1.
We present a basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming languages and we use quantum pseudo-code based on QCL quantum programming language to describe them. We also present the implementation of introduced structures in GNU Octave language for scientific computing. Procedures used in the implementation are available as a package quantum-octave, providing a library of functions, which facilitates the simulation of quantum computing. This package allows also to incorporate high-level programming concepts into the simulation in GNU Octave and Matlab. As such it connects features unique for high-level quantum programming languages, with the full palette of efficient computational routines commonly available in modern scientific computing systems. To present the major features of the described package we provide the implementation of selected quantum algorithms. We also show how quantum errors can be taken into account during the simulation of quantum algorithms using quantum-octave package. This is possible thanks to the ability to operate on density matrices.
We describe the [Formula: see text] package of functions useful for simulations of quantum algorithms and protocols. The presented package allows one to perform simulations with mixed states. We present numerical implementation of important quantum mechanical operations — partial trace and partial transpose. Those operations are used as building blocks of algorithms for analysis of entanglement and quantum error correction codes. A simulation of Shor's algorithm is presented as an example of package capabilities.
Research in contemporary physics is emphasizing the development and evolution of computer systems to facilitate the calculations. Quantum computing is a branch of modern physics is believed promising results for the future, Thanks to the ability of qubits to store more information than a bit. The work of this paper focuses on the simulation of certain quantum algorithms such as the prisoner's dilemma in its quantum version using the MATHEMATICA® software and implementing stochastic version of the software MAPLE ® and the Grover search algorithm that simulates finding a needle in a haystack.