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

arXiv:2208.02608 · Quantum Information Processing

Quantum Register Algebra: the mathematical language for quantum computing

Jaroslav Hrdina, Dietmar Hildenbrand, Aleš Návrat, C. Steinmetz, Rafael Santos de Oliveira Alves, Carlile Lavor, Petr Vašík, Ivan Eryganov

Published Aug 31, 2023• 8 citations
arXivHTMLPDF
DOI
10.1007/s11128-023-04086-y

Related papers

Linear Algebra

Johnny Hooyberghs

Linear algebra is a branch of mathematics that discusses linear equations using vector spaces. Linear algebra is used heavily in quantum computing and can be considered as the main language for quantum computing. Just like trigonometry and complex numbers, which were introduced to you in previous appendixes, linear algebra is equally as important and can be helpful to fully understand the world of quantum computing.

Apress eBooks•Dec 8, 2021•0 citations

Quantum Computer：5. Quantum Programming Languages

Ichiro Hasuo A, Naohiko Hoshino

情報処理•Jun 15, 2014•0 citations

$$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations

Luca Paolini, Margherita Zorzi

Lecture notes in computer science•Jan 1, 2017•13 citations

Q#, a quantum computation package for the .NET platform

Ahmed S. Tolba, Magdi Z. Rashad, Mohamed A. El-dosuky

Quantum computing is a promising approach of computation that is based on equations from Quantum Mechanics. A simulator for quantum algorithms must be capable of performing heavy mathematical matrix transforms. The design of the simulator itself takes one of three forms: Quantum Turing Machine, Network Model or circuit model of connected gates or, Quantum Programming Language, yet, some simulators are hybrid. We studied previous simulators and then we adopt features from three simulators of different implementation languages, different paradigms, and for different platforms. They are Quantum Computing Language (QCL), QUASI, and Quantum Optics Toolbox for Matlab 5. Our simulator for quantum algorithms takes the form of a package or a programming library for Quantum computing, with a case study showing the ability of using it in the circuit model. The .NET is a promising platform for computing. VB.NET is an easy, high productive programming language with the full power and functionality provided by the .NET framework. It is highly readable, writeable, and flexible language, compared to another language such as C#.NET in many aspects. We adopted VB.NET although its shortage in built-in mathematical complex and matrix operations, compared to Matlab. For implementation, we first built a mathematical core of matrix operations. Then, we built a quantum core which contains: basic qubits and register operations, basic 1D, 2D, and 3D quantum gates, and multi-view visualization of the quantum state, then a window for demos to show you how to use and get the most of the package.

arXiv:1302.5133•Feb 20, 2013•2 citations

Quantum Leaps Through The Mathematical Language Of Next Generation Computing

Dr. C. Radhiya Devi, P Umadevi, Dr. C. Mohana Priya

Quantum computing represents one of the most significant paradigms shifts in the history of computation, promising to solve classes of problems that remain intractable for classical machines. Unlike classical computing, which is built on Boolean algebra and binary logic, quantum computing is fundamentally a mathematical discipline rooted in linear algebra, complex vector spaces, and probability theory. This article examines the mathematical structures that underpin quantum computation, including qubits, superposition, entanglement, unitary transformations, and quantum gates, and explores how these structures enable algorithms such as Shor\\\'s and Grover\\\'s to outperform their classical counterparts. The discussion further extends to quantum error correction, the challenges of decoherence, and the interdisciplinary convergence of mathematics and computer science that is shaping next-generation computing architectures. The article concludes with a reflection on open mathematical problems and the future trajectory of quantum information science.

•Jan 1, 2026•0 citations

Quantum Computing Based on Quantum Bit Algebra QBA

Jaroslav Hrdina, Radek Tichý

Lecture notes in computer science•Jan 1, 2021•0 citations
qPCF\mathsf {qPCF}qPCF : A Language for Quantum Circuit Computations
Quantum computing is a promising approach of computation that is based on equations from Quantum Mechanics. A simulator for quantum algorithms must be capable of performing heavy mathematical matrix transforms. The design of the simulator itself takes one of three forms: Quantum Turing Machine, Network Model or circuit model of connected gates or, Quantum Programming Language, yet, some simulators are hybrid. We studied previous simulators and then we adopt features from three simulators of different implementation languages, different paradigms, and for different platforms. They are Quantum Computing Language (QCL), QUASI, and Quantum Optics Toolbox for Matlab 5. Our simulator for quantum algorithms takes the form of a package or a programming library for Quantum computing, with a case study showing the ability of using it in the circuit model. The .NET is a promising platform for computing. VB.NET is an easy, high productive programming language with the full power and functionality provided by the .NET framework. It is highly readable, writeable, and flexible language, compared to another language such as C#.NET in many aspects. We adopted VB.NET although its shortage in built-in mathematical complex and matrix operations, compared to Matlab. For implementation, we first built a mathematical core of matrix operations. Then, we built a quantum core which contains: basic qubits and register operations, basic 1D, 2D, and 3D quantum gates, and multi-view visualization of the quantum state, then a window for demos to show you how to use and get the most of the package.
Quantum computing represents one of the most significant paradigms shifts in the history of computation, promising to solve classes of problems that remain intractable for classical machines. Unlike classical computing, which is built on Boolean algebra and binary logic, quantum computing is fundamentally a mathematical discipline rooted in linear algebra, complex vector spaces, and probability theory. This article examines the mathematical structures that underpin quantum computation, including qubits, superposition, entanglement, unitary transformations, and quantum gates, and explores how these structures enable algorithms such as Shor\\\'s and Grover\\\'s to outperform their classical counterparts. The discussion further extends to quantum error correction, the challenges of decoherence, and the interdisciplinary convergence of mathematics and computer science that is shaping next-generation computing architectures. The article concludes with a reflection on open mathematical problems and the future trajectory of quantum information science.