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

A faster combinatorial algorithm to calculate partial trace in quantum mechanics

Pranay Barkataki, M. S. Ramkarthik

Published Sep 19, 2017• 0 citations
OpenAlex

Related papers

Fast algorithms for quantum physics

Toshiaki Iitaka, 敏晃 飯高

•Oct 1, 1998•0 citations

Faster Randomized Partial Trace Estimation

Tyler Chen, Robert S. Chen, Kevin Li +3 more

Abstract. We develop randomized matrix-free algorithms for estimating partial traces, a generalization of the trace arising in quantum physics and chemistry. Our algorithm improves on the typicality-based approach used in [T. Chen and Y-C. Cheng, J. Chem. Phys., 157 (2022), 064106] by deflating important subspaces (e.g., corresponding to the low-energy eigenstates) explicitly. This results in a significant variance reduction, leading to several order-of-magnitude speedups over the previous state of the art. We then apply our algorithm to the study of the thermodynamics of several Heisenberg spin systems, particularly the entanglement spectrum and ergotropy.

arXiv:2310.12364•SIAM Journal on Scientific Computing•Nov 4, 2024•2 citations

A set theoretical approach for the partial tracing operation in quantum mechanics

Pranay Barkataki, M. S. Ramkarthik

Partial trace is a very important mathematical operation in quantum mechanics. It is not only helpful in studying the subsystems of a composite quantum system but also used in computing a vast majority of quantum entanglement measures. Calculating partial trace becomes computationally very intensive with increasing number of qubits as the Hilbert space dimension increases exponentially. In this paper, we discuss about our new method of partial tracing which is based on set theory and it is more efficient. The proposed method of partial tracing overcomes all the limitations of the other well-known methods such as being computationally intensive and being limited to low dimensional Hilbert spaces. We give a detailed theoretical description of our method and also provide an explicit example of the computation. The merits of the new method and other key ideas are discussed.

arXiv:1709.06346•International Journal of Quantum Information•Sep 1, 2018•1 citation

Some combinatorial problems in quantum computation

Shanzhen Gao

Journal of Guizhou Education Institute•Jan 1, 2003•0 citations

Computing partial traces and reduced density matrices

Jonas Maziero

Taking partial traces (PTrs) for computing reduced density matrices, or related functions, is a ubiquitous procedure in the quantum mechanics of composite systems. In this paper, we present a thorough description of this function and analyze the number of elementary operations (ops) needed, under some possible alternative implementations, to compute it on a classical computer. As we note, it is worthwhile doing some analytical developments in order to avoid making null multiplications and sums, what can considerably reduce the ops. For instance, for a bipartite system [Formula: see text] with dimensions [Formula: see text] and [Formula: see text] and for [Formula: see text], while a direct use of PTr definition applied to [Formula: see text] requires [Formula: see text] ops, its optimized implementation entails [Formula: see text] ops. In the sequence, we regard the computation of PTrs for general multipartite systems and describe Fortran code provided to implement it numerically. We also consider the calculation of reduced density matrices via Bloch’s parametrization with generalized Gell Mann’s matrices.

arXiv:1601.07458•International Journal of Modern Physics C•Aug 2, 2016•28 citations

Emergence of the Partial Trace from Classical Probability Theory

Andrés Macho Ortiz, Francisco Javier Fraile Peláez, José Capmany

The partial trace is commonly introduced in quantum mechanics as an algebraic operation used to define reduced states of composite systems. However, the probabilistic origin of this operation goes systematically unnoticed in the literature. Here, we show that the partial trace emerges naturally from the requirement of consistency between the Born rule for measurement probabilities and the classical marginalization of probability mass functions. Starting from the classical marginalization rule relating joint and marginal probability distributions, we impose that the reduced density operator of a subsystem must reproduce the local measurement statistics derived from the global state. We show that this requirement directly leads to the standard expression of the partial trace. From this perspective, the reduced density operator appears not as an ad hoc algebraic construction, but as a natural consequence of the probabilistic structure of quantum mechanics.

quant-pharXiv:2603.24290•Mar 26, 2026•0 citations
Abstract. We develop randomized matrix-free algorithms for estimating partial traces, a generalization of the trace arising in quantum physics and chemistry. Our algorithm improves on the typicality-based approach used in [T. Chen and Y-C. Cheng, J. Chem. Phys., 157 (2022), 064106] by deflating important subspaces (e.g., corresponding to the low-energy eigenstates) explicitly. This results in a significant variance reduction, leading to several order-of-magnitude speedups over the previous state of the art. We then apply our algorithm to the study of the thermodynamics of several Heisenberg spin systems, particularly the entanglement spectrum and ergotropy.
Partial trace is a very important mathematical operation in quantum mechanics. It is not only helpful in studying the subsystems of a composite quantum system but also used in computing a vast majority of quantum entanglement measures. Calculating partial trace becomes computationally very intensive with increasing number of qubits as the Hilbert space dimension increases exponentially. In this paper, we discuss about our new method of partial tracing which is based on set theory and it is more efficient. The proposed method of partial tracing overcomes all the limitations of the other well-known methods such as being computationally intensive and being limited to low dimensional Hilbert spaces. We give a detailed theoretical description of our method and also provide an explicit example of the computation. The merits of the new method and other key ideas are discussed.
Taking partial traces (PTrs) for computing reduced density matrices, or related functions, is a ubiquitous procedure in the quantum mechanics of composite systems. In this paper, we present a thorough description of this function and analyze the number of elementary operations (ops) needed, under some possible alternative implementations, to compute it on a classical computer. As we note, it is worthwhile doing some analytical developments in order to avoid making null multiplications and sums, what can considerably reduce the ops. For instance, for a bipartite system [Formula: see text] with dimensions [Formula: see text] and [Formula: see text] and for [Formula: see text], while a direct use of PTr definition applied to [Formula: see text] requires [Formula: see text] ops, its optimized implementation entails [Formula: see text] ops. In the sequence, we regard the computation of PTrs for general multipartite systems and describe Fortran code provided to implement it numerically. We also consider the calculation of reduced density matrices via Bloch’s parametrization with generalized Gell Mann’s matrices.
The partial trace is commonly introduced in quantum mechanics as an algebraic operation used to define reduced states of composite systems. However, the probabilistic origin of this operation goes systematically unnoticed in the literature. Here, we show that the partial trace emerges naturally from the requirement of consistency between the Born rule for measurement probabilities and the classical marginalization of probability mass functions. Starting from the classical marginalization rule relating joint and marginal probability distributions, we impose that the reduced density operator of a subsystem must reproduce the local measurement statistics derived from the global state. We show that this requirement directly leads to the standard expression of the partial trace. From this perspective, the reduced density operator appears not as an ad hoc algebraic construction, but as a natural consequence of the probabilistic structure of quantum mechanics.