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

Springer eBooks

Simulating Quantum Software with Density Matrices: Reading Feynman on Fast-Forward

Iaakov Exman

Published Jan 1, 2024• 0 citations
Publisher

Abstract

Abstract Richard P. Feynman’s 1982 paper “Simulating Physics with Computers” is often recognized as a pioneer of quantum computing. However, careful reading between the lines finds further meaningful content. This work reinterprets the pioneering paper, as a precursor of Quantum Software. Feynman’s proposal to represent the simulated system by a Density Matrix opens the way toward a mathematical Quantum Software systems theory. Density Matrix modularization leads to software modules as high-level abstractions unifying conceptual software units and matrix basis kets, stimulating new software-related questions and novel quantum solutions. Software modules are building blocks for any imaginable Quantum Software computations in practice, such as software system evolution, measurement, compositionality, and future potential applications.

DOI
10.1007/978-3-031-64136-7_2

Related papers

Quantum Software Models: Software Density Matrix is a Perfect Direct Sum of Module Matrices

Iaakov Exman, Alexey V. Nechaev

Quantum Software Models is a theoretical framework to systematically design and analyze any software system -be it quantum, classical or hybrid -representing it by a design Density Matrix.Recently, we have demonstrated a top-down approach, to decompose a whole software system Density Matrix into modules, using basis vector projectors of the Matrix.However, it would be even more natural to have a systematic bottom-up procedure, to compose a whole software system Density Matrix, given a set of well-designed software module matrices, taken as sub-systems.This is exactly the paper's purpose.The result obtained: the whole software system Density Matrix is a perfect Direct Sum of module density matrices.This result yields clear software design benefits: it is bidirectional, one can traverse the software system hierarchy top-down or bottom-up, in particular, gradually building up the whole system from verified correct modules, assured by spectral decoupling techniques.The claim is formally validated and is illustrated by software system studies.

Proceedings/Proceedings of the ... International Conference on Software Engineering and Knowledge Engineering•Jul 1, 2022•3 citations

Quantum Software Encompasses Classical Software: Density Matrix from the Laplacian

Iaakov Exman

It is widely understood that quantum computing — quantum gates upon qubits — is the general case, encompassing computing by classical means, viz. Boolean logic upon classical bits. It also seems reasonable that Quantum Software should encompass Classical Software. However, to accept such a statement regarding software, the feeling that it seems reasonable is not enough. One needs clear-cut definitions and formal conclusions. This is exactly the purpose of this paper. Previously, we have represented Classical Software by the Laplacian Matrix. More recently, we have shown that Quantum Software is faithfully represented by Density Matrices. It turns out that a Laplacian Matrix normalized by the Laplacian Trace easily obtains a Density Matrix. This opens the horizons for Quantum Software operations — such as unitary and reversible evolution — not naturally available with the classical Laplacian. This paper provides the necessary definitions and conclusions, illustrating the more general Quantum operations with a relevant case study, playing the double role of both classical and quantum software.

International Journal of Software Engineering and Knowledge Engineering•Jul 27, 2024•1 citation

Quantum Simulations

Antti Regelin

Quantum simulation involves using a quantum system to study another quantum system. The proposal to simulate quantum physics using quantum mechanical devices, as outlined by Richard Feynman in 1982, stems from classical computers' challenges in simulating quantum systems. The pursuit of simulating complex quantum systems has led to the intersection of quantum mechanics and quantum computing. This offers new opportunities to understand and manipulate the quantum world. Central to describing quantum dynamics is the Hamiltonian operator $\hat{H}$, which governs the time evolution of physical systems and serves as the mathematical foundation for quantum simulations. This thesis explores the methodologies and advancements in simulating Hamiltonian operators on quantum computers, focusing on decomposing these operators into quantum gates and the efficiency gains over classical computational approaches. Initially, the thesis explains the fundamental theory and basics of quantum computing. Further it dives into the foundations of the Hamiltonian operator within quantum mechanics, highlighting its role in describing the dynamics of quantum systems. The complexity and high-dimensional nature of Hamiltonian matrices necessitate using quantum computers to simulate quantum phenomena accurately and efficiently. The process of simulating the Hamiltonian operator on a quantum computer involves a detailed examination of the strategies for decomposing the operator into a sequence of quantum gates. This decomposition is crucial for translating the abstract mathematical description of quantum systems into the physical operations of a quantum computer. By utilizing the principles of quantum mechanics, such as superposition and entanglement, quantum gates manipulate qubits to mimic the evolution of quantum states as the Hamiltonian operator dictates. Latter portions of the thesis are dedicated to comparing the efficiency of quantum simulations against traditional classical simulations and inspecting efficient quantum simulations. Quantum computers offer a polynomial or an exponential speedup for certain classes of problems, such as those involving highly entangled quantum states or requiring the simulation of complex quantum dynamics. This advantage is due to the quantum computer's ability to naturally represent and process quantum information - a task for which classical computers require exponential resources as the system size increases. The efficiency of simulating the Hamiltonian operator on a quantum computer is further enhanced through optimization techniques and algorithmic improvements. These include error mitigation strategies and the development of quantum algorithms tailored to specific types of Hamiltonian operators. The thesis presents a comprehensive analysis of these methods, demonstrating how they make quantum simulations more practical and accessible for scientific research and technological development. In conclusion this thesis is a literature review that examines the transformative potential of quantum simulations. By efficiently simulating the Hamiltonian operator on quantum computers researchers can explore quantum phenomena with precision, paving the way for breakthroughs in quantum physics, materials science, and beyond. The advancements in quantum computing technology and algorithmic approaches discussed here highlight the current capabilities and future explorations in the quantum realm.

•Sep 9, 2026•0 citations

Quantum Software Models: Quantum Modules Tomography and Recovery Theorem

Iaakov Exman, Ariel Zvulunov

Quantum Tomography partially measures and then recovers the remaining density matrix quantum state, in order to verify that a certain device -processor or detector -indeed outputs the intended quantum state.However, single matrix element measurements rapidly increase in number with the density matrix dimension and are error-prone.This work proposes a novel quantum software viewpoint on quantum tomography.Instead of individual matrix elements, measurements and density matrix recovery are performed on higher-abstraction modules, i.e. semantically meaningful groups of matrix elements.Quantum Modules Tomography potentially reduce the necessary number of explicit measurements, while still allowing recovery of the whole density matrix.A Recovery Theorem is formulated and proved: density matrix diagonal measurements suffice to recover the whole system density matrix, in terms of modules.The recovery procedure is illustrated by a few case studies.

Proceedings/Proceedings of the ... International Conference on Software Engineering and Knowledge Engineering•Jul 1, 2023•2 citations

Chapter 6: Hamiltonian simulation

Giacomo Nannicini

Hamiltonian simulation is the problem for which quantum computers were initially proposed by Richard Feynman [75], and it is a crucial problem for applications in physics: it corresponds to the simulation of the evolution of a quantum mechanical system over time. Although this book aims to be physics-free, it is useful to give at least the mathematical foundations of this problem, because Hamiltonian simulation is a central component of many quantum algorithms. We do not discuss the precise physical meaning of these concepts, and aim to provide just enough vocabulary to read the quantum computing literature without too much confusion.

Society for Industrial and Applied Mathematics eBooks•Dec 17, 2025•0 citations

Towards Quantum Software for Quantum Simulation

Maja Franz, Lukas Schmidbauer, Joshua Ammermann +2 more

Quantum simulation is a leading candidate for demonstrating practical quantum advantage over classical computation, as it is believed to provide exponentially more compute power than any classical system. It offers new means of studying the behaviour of complex physical systems, for which conventionally software-intensive simulation codes based on numerical high-performance computing are used. Instead, quantum simulations map properties and characteristics of subject systems, for instance chemical molecules, onto quantum devices that then mimic the system under study. Currently, the use of these techniques is largely limited to fundamental science, as the overall approach remains tailored for specific problems: We lack infrastructure and modelling abstractions that are provided by the software engineering community for other computational domains. In this paper, we identify critical gaps in the quantum simulation software stack-particularly the absence of general-purpose frameworks for model specification, Hamiltonian construction, and hardware-aware mappings. We advocate for a modular model-driven engineering (MDE) approach that supports different types of quantum simulation (digital and analogue), and facilitates automation, performance evaluation, and reusability. Through an example from high-energy physics, we outline a vision for a quantum simulation framework capable of supporting scalable, cross-platform simulation workflows.

quant-pharXiv:2511.13520•IEEE/ACM International Workshop on Quantum Software Engineering (Q-SE)•Nov 18, 2025•0 citations
Abstract Richard P. Feynman’s 1982 paper “Simulating Physics with Computers” is often recognized as a pioneer of quantum computing. However, careful reading between the lines finds further meaningful content. This work reinterprets the pioneering paper, as a precursor of Quantum Software. Feynman’s proposal to represent the simulated system by a Density Matrix opens the way toward a mathematical Quantum Software systems theory. Density Matrix modularization leads to software modules as high-level abstractions unifying conceptual software units and matrix basis kets, stimulating new software-related questions and novel quantum solutions. Software modules are building blocks for any imaginable Quantum Software computations in practice, such as software system evolution, measurement, compositionality, and future potential applications.
Quantum Software Models is a theoretical framework to systematically design and analyze any software system -be it quantum, classical or hybrid -representing it by a design Density Matrix.Recently, we have demonstrated a top-down approach, to decompose a whole software system Density Matrix into modules, using basis vector projectors of the Matrix.However, it would be even more natural to have a systematic bottom-up procedure, to compose a whole software system Density Matrix, given a set of well-designed software module matrices, taken as sub-systems.This is exactly the paper's purpose.The result obtained: the whole software system Density Matrix is a perfect Direct Sum of module density matrices.This result yields clear software design benefits: it is bidirectional, one can traverse the software system hierarchy top-down or bottom-up, in particular, gradually building up the whole system from verified correct modules, assured by spectral decoupling techniques.The claim is formally validated and is illustrated by software system studies.
It is widely understood that quantum computing — quantum gates upon qubits — is the general case, encompassing computing by classical means, viz. Boolean logic upon classical bits. It also seems reasonable that Quantum Software should encompass Classical Software. However, to accept such a statement regarding software, the feeling that it seems reasonable is not enough. One needs clear-cut definitions and formal conclusions. This is exactly the purpose of this paper. Previously, we have represented Classical Software by the Laplacian Matrix. More recently, we have shown that Quantum Software is faithfully represented by Density Matrices. It turns out that a Laplacian Matrix normalized by the Laplacian Trace easily obtains a Density Matrix. This opens the horizons for Quantum Software operations — such as unitary and reversible evolution — not naturally available with the classical Laplacian. This paper provides the necessary definitions and conclusions, illustrating the more general Quantum operations with a relevant case study, playing the double role of both classical and quantum software.
Quantum simulation involves using a quantum system to study another quantum system. The proposal to simulate quantum physics using quantum mechanical devices, as outlined by Richard Feynman in 1982, stems from classical computers' challenges in simulating quantum systems. The pursuit of simulating complex quantum systems has led to the intersection of quantum mechanics and quantum computing. This offers new opportunities to understand and manipulate the quantum world. Central to describing quantum dynamics is the Hamiltonian operator H^\hat{H}H^, which governs the time evolution of physical systems and serves as the mathematical foundation for quantum simulations. This thesis explores the methodologies and advancements in simulating Hamiltonian operators on quantum computers, focusing on decomposing these operators into quantum gates and the efficiency gains over classical computational approaches. Initially, the thesis explains the fundamental theory and basics of quantum computing. Further it dives into the foundations of the Hamiltonian operator within quantum mechanics, highlighting its role in describing the dynamics of quantum systems. The complexity and high-dimensional nature of Hamiltonian matrices necessitate using quantum computers to simulate quantum phenomena accurately and efficiently. The process of simulating the Hamiltonian operator on a quantum computer involves a detailed examination of the strategies for decomposing the operator into a sequence of quantum gates. This decomposition is crucial for translating the abstract mathematical description of quantum systems into the physical operations of a quantum computer. By utilizing the principles of quantum mechanics, such as superposition and entanglement, quantum gates manipulate qubits to mimic the evolution of quantum states as the Hamiltonian operator dictates. Latter portions of the thesis are dedicated to comparing the efficiency of quantum simulations against traditional classical simulations and inspecting efficient quantum simulations. Quantum computers offer a polynomial or an exponential speedup for certain classes of problems, such as those involving highly entangled quantum states or requiring the simulation of complex quantum dynamics. This advantage is due to the quantum computer's ability to naturally represent and process quantum information - a task for which classical computers require exponential resources as the system size increases. The efficiency of simulating the Hamiltonian operator on a quantum computer is further enhanced through optimization techniques and algorithmic improvements. These include error mitigation strategies and the development of quantum algorithms tailored to specific types of Hamiltonian operators. The thesis presents a comprehensive analysis of these methods, demonstrating how they make quantum simulations more practical and accessible for scientific research and technological development. In conclusion this thesis is a literature review that examines the transformative potential of quantum simulations. By efficiently simulating the Hamiltonian operator on quantum computers researchers can explore quantum phenomena with precision, paving the way for breakthroughs in quantum physics, materials science, and beyond. The advancements in quantum computing technology and algorithmic approaches discussed here highlight the current capabilities and future explorations in the quantum realm.
Quantum Tomography partially measures and then recovers the remaining density matrix quantum state, in order to verify that a certain device -processor or detector -indeed outputs the intended quantum state.However, single matrix element measurements rapidly increase in number with the density matrix dimension and are error-prone.This work proposes a novel quantum software viewpoint on quantum tomography.Instead of individual matrix elements, measurements and density matrix recovery are performed on higher-abstraction modules, i.e. semantically meaningful groups of matrix elements.Quantum Modules Tomography potentially reduce the necessary number of explicit measurements, while still allowing recovery of the whole density matrix.A Recovery Theorem is formulated and proved: density matrix diagonal measurements suffice to recover the whole system density matrix, in terms of modules.The recovery procedure is illustrated by a few case studies.
Hamiltonian simulation is the problem for which quantum computers were initially proposed by Richard Feynman [75], and it is a crucial problem for applications in physics: it corresponds to the simulation of the evolution of a quantum mechanical system over time. Although this book aims to be physics-free, it is useful to give at least the mathematical foundations of this problem, because Hamiltonian simulation is a central component of many quantum algorithms. We do not discuss the precise physical meaning of these concepts, and aim to provide just enough vocabulary to read the quantum computing literature without too much confusion.
Quantum simulation is a leading candidate for demonstrating practical quantum advantage over classical computation, as it is believed to provide exponentially more compute power than any classical system. It offers new means of studying the behaviour of complex physical systems, for which conventionally software-intensive simulation codes based on numerical high-performance computing are used. Instead, quantum simulations map properties and characteristics of subject systems, for instance chemical molecules, onto quantum devices that then mimic the system under study. Currently, the use of these techniques is largely limited to fundamental science, as the overall approach remains tailored for specific problems: We lack infrastructure and modelling abstractions that are provided by the software engineering community for other computational domains. In this paper, we identify critical gaps in the quantum simulation software stack-particularly the absence of general-purpose frameworks for model specification, Hamiltonian construction, and hardware-aware mappings. We advocate for a modular model-driven engineering (MDE) approach that supports different types of quantum simulation (digital and analogue), and facilitates automation, performance evaluation, and reusability. Through an example from high-energy physics, we outline a vision for a quantum simulation framework capable of supporting scalable, cross-platform simulation workflows.