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

Physics of Particles and Nuclei Letters

Simulation of n-qubit quantum systems: A computer-algebraic approach

Thomas Radtke, S. Fritzsche, A. Surzhykov

Published Mar 1, 2007• 2 citations
Publisher

Abstract

During the last decade, the field of quantum computation has attracted a lot of interest and motivated many theoretical and experimental studies of n -qubit quantum systems. But apart from the promise of more efficient quantum algorithms, these investigations also revealed a number of obstacles which still have to be overcome in practice. In this context, the use of simulation programs has proved to be an appropriate method. In order to facilitate the simulation of n -qubit quantum systems, we present the Feynman software program to provide the necessary tools to define and to deal with quantum registers as well as the operators acting on them. Using an interactive design within the framework of the computer algebra system Maple, we hope that the Feynman software program will be useful not only for teaching the basic elements of quantum computing but also for studying their physical realization in the future.

DOI
10.1134/s154747710702001x

Related papers

Simulating Quantum Computations on Classical Machines: A Survey

Kieran P. Young, Marcus Scese, Ali Ebnenasir

We present a comprehensive study of quantum simulation methods and quantum simulators for classical computers. We first study an exhaustive set of 150+ simulators and quantum libraries. Then, we short-list the simulators that are actively maintained and enable simulation of quantum algorithms for more than 10 qubits. As a result, we realize that most efficient and actively maintained simulators have been developed after 2010. We also provide a taxonomy of the most important simulation methods, namely Schrodinger-based, Feynman path integrals, Heisenberg-based, and hybrid methods. We observe that most simulators fall in the category of Schrodinger-based approaches. However, there are a few efficient simulators belonging to other categories. We also make note that quantum frameworks form their own class of software tools that provide more flexibility for algorithm designers with a choice of simulators/simulation method. Another contribution of this study includes the use and classification of optimization methods used in a variety of simulators. We observe that some state-of-the-art simulators utilize a combination of software and hardware optimization techniques to scale up the simulation of quantum circuits. We summarize this study by providing a roadmap for future research that can further enhance the use of quantum simulators in education and research.

arXiv:2311.16505•Nov 28, 2023•4 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

There is no simulation of n-qubit operations by a single Hamiltonian with 2-spin interaction

Torsten Aßelmeyer-Maluga, Matthias Kolbe, Helge Rosé

Today's devices for quantum computing are still far from implementing useful and powerful quantum algorithms. Decoherence and the wish to resist the effects of errors in a system of quantum bits incurs a lot of overhead in the number of gates and qubits. From a theoretical perspective, controlled quantum simulation raises the hope to simulate the unitary quantum operationes generated by a Hamiltonian with 3-body interaction with a suitably designed element that is constructed of only 2-body interactions. That replacement would happen without any additional gates, and its possibility would be due to the ambiguity of the unit element of the Lie group connected with the algebra of traceless hermitian matrices. We show that this hope is void, and give a general proof for this for any order of interaction.

arXiv:quant-ph/0508029•Aug 3, 2005•0 citations

Using quantum computers for quantum simulation

Katherine L. Brown, William J. Munro, Viv M. Kendon

Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described by models which we cannot solve with sufficient accuracy, neither analytically nor numerically with classical computers. Using a quantum computer to simulate such quantum systems has been viewed as a key application of quantum computation from the very beginning of the field in the 1980s. Moreover, useful results beyond the reach of classical computation are expected to be accessible with fewer than a hundred qubits, making quantum simulation potentially one of the earliest practical applications of quantum computers. In this paper we survey the theoretical and experimental development of quantum simulation using quantum computers, from the first ideas to the intense research efforts currently underway.

•Oct 27, 2015•79 citations

Didactic tools for teaching quantum informatics

Piotr Gawron, Jarosław Adam Miszczak

Development of quantum informatics as a new field of computer science poses new challenges to teachers and students of computer science. Among others, very dynamic branches of quantum informatics are quantum programming languages and simulation of quantum systems.This article presents the program of the lecture: Quantum systems of informatics that is proposed to students of last semesters of computer science at Faculty of Automatic Control, Electronics and Computer Science of Silesian University of TechnologyThe objective of this lecture is to familiarize students with notions and elements of quantum informatics. Lecture will introduce basic mathematical concepts needed to operate a quantum mechanics apparatus and elements of information theory.Many tools useful in education of quantum informatics are presented. Most of them are based on Quantum Computer Language. They are the authors' original work.In the last section the examples of programs of laboratory classes, during which described software is used, are presented.

Annales Universitatis Mariae Curie-Sklodowska sectio AI – Informatica•Jan 1, 2004•3 citations

Using Quantum Computers for Quantum Simulation

Katherine L. Brown, William J. Munro, Vivien M. Kendon

Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described by models which we cannot solve with sufficient accuracy, neither analytically nor numerically with classical computers. Using a quantum computer to simulate such quantum systems has been viewed as a key application of quantum computation from the very beginning of the field in the 1980s. Moreover, useful results beyond the reach of classical computation are expected to be accessible with fewer than a hundred qubits, making quantum simulation potentially one of the earliest practical applications of quantum computers. In this paper we survey the theoretical and experimental development of quantum simulation using quantum computers, from the first ideas to the intense research efforts currently underway.

arXiv:1004.5528•Entropy•Nov 15, 2010•129 citations
During the last decade, the field of quantum computation has attracted a lot of interest and motivated many theoretical and experimental studies of n -qubit quantum systems. But apart from the promise of more efficient quantum algorithms, these investigations also revealed a number of obstacles which still have to be overcome in practice. In this context, the use of simulation programs has proved to be an appropriate method. In order to facilitate the simulation of n -qubit quantum systems, we present the Feynman software program to provide the necessary tools to define and to deal with quantum registers as well as the operators acting on them. Using an interactive design within the framework of the computer algebra system Maple, we hope that the Feynman software program will be useful not only for teaching the basic elements of quantum computing but also for studying their physical realization in the future.
We present a comprehensive study of quantum simulation methods and quantum simulators for classical computers. We first study an exhaustive set of 150+ simulators and quantum libraries. Then, we short-list the simulators that are actively maintained and enable simulation of quantum algorithms for more than 10 qubits. As a result, we realize that most efficient and actively maintained simulators have been developed after 2010. We also provide a taxonomy of the most important simulation methods, namely Schrodinger-based, Feynman path integrals, Heisenberg-based, and hybrid methods. We observe that most simulators fall in the category of Schrodinger-based approaches. However, there are a few efficient simulators belonging to other categories. We also make note that quantum frameworks form their own class of software tools that provide more flexibility for algorithm designers with a choice of simulators/simulation method. Another contribution of this study includes the use and classification of optimization methods used in a variety of simulators. We observe that some state-of-the-art simulators utilize a combination of software and hardware optimization techniques to scale up the simulation of quantum circuits. We summarize this study by providing a roadmap for future research that can further enhance the use of quantum simulators in education and research.
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.
Today's devices for quantum computing are still far from implementing useful and powerful quantum algorithms. Decoherence and the wish to resist the effects of errors in a system of quantum bits incurs a lot of overhead in the number of gates and qubits. From a theoretical perspective, controlled quantum simulation raises the hope to simulate the unitary quantum operationes generated by a Hamiltonian with 3-body interaction with a suitably designed element that is constructed of only 2-body interactions. That replacement would happen without any additional gates, and its possibility would be due to the ambiguity of the unit element of the Lie group connected with the algebra of traceless hermitian matrices. We show that this hope is void, and give a general proof for this for any order of interaction.
Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described by models which we cannot solve with sufficient accuracy, neither analytically nor numerically with classical computers. Using a quantum computer to simulate such quantum systems has been viewed as a key application of quantum computation from the very beginning of the field in the 1980s. Moreover, useful results beyond the reach of classical computation are expected to be accessible with fewer than a hundred qubits, making quantum simulation potentially one of the earliest practical applications of quantum computers. In this paper we survey the theoretical and experimental development of quantum simulation using quantum computers, from the first ideas to the intense research efforts currently underway.
Development of quantum informatics as a new field of computer science poses new challenges to teachers and students of computer science. Among others, very dynamic branches of quantum informatics are quantum programming languages and simulation of quantum systems.This article presents the program of the lecture: Quantum systems of informatics that is proposed to students of last semesters of computer science at Faculty of Automatic Control, Electronics and Computer Science of Silesian University of TechnologyThe objective of this lecture is to familiarize students with notions and elements of quantum informatics. Lecture will introduce basic mathematical concepts needed to operate a quantum mechanics apparatus and elements of information theory.Many tools useful in education of quantum informatics are presented. Most of them are based on Quantum Computer Language. They are the authors' original work.In the last section the examples of programs of laboratory classes, during which described software is used, are presented.
Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described by models which we cannot solve with sufficient accuracy, neither analytically nor numerically with classical computers. Using a quantum computer to simulate such quantum systems has been viewed as a key application of quantum computation from the very beginning of the field in the 1980s. Moreover, useful results beyond the reach of classical computation are expected to be accessible with fewer than a hundred qubits, making quantum simulation potentially one of the earliest practical applications of quantum computers. In this paper we survey the theoretical and experimental development of quantum simulation using quantum computers, from the first ideas to the intense research efforts currently underway.