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:1708.05937 · Journal of Physics A Mathematical and Theoretical

Renormalization of total sets of states into generalized bases with a resolution of the identity

Apostol Vourdas

Published Jun 23, 2017• 2 citations
arXivHTMLPDF

Abstract

Abstract A total set of states for which we have no resolution of the identity (a ‘pre-basis’), is considered in a finite dimensional Hilbert space. A dressing formalism renormalizes them into density matrices which resolve the identity, and makes them a ‘generalized basis’, which is practically useful. The dresssing mechanism is inspired by Shapley’s methodology in cooperative game theory, and it uses Möbius transforms. There is non-independence and redundancy in these generalized bases, which is quantified with a Shannon type of entropy. Due to this redundancy, calculations based on generalized bases are sensitive to physical changes and robust in the presence of noise. For example, the representation of an arbitrary vector in such generalized bases, is robust when noise is inserted in the coefficients. Also in a physical system with a ground state which changes abruptly at some value of the coupling constant, the proposed methodology detects such changes, even when noise is added to the parameters in the Hamiltonian of the system.

DOI
10.1088/1751-8121/aa7b6a

Related papers

Random projectors with continuous resolutions of the identity in a finite-dimensional Hilbert space

Apostol Vourdas

Abstract Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses Möbius transforms and adapts Shapley’s methodology in cooperative game theory, into the context of set theory. These ideas are subsequently generalized into the context of finite-dimensional Hilbert spaces. Using random projectors into the subspaces spanned by states from a total set, we construct an infinite number of continuous resolutions of the identity, that involve Hermitian positive semi-definite operators. The simplest one is the diagonal continuous resolution of the identity, and it is used to expand an arbitrary vector in terms of a continuum of components. It is also used to define the function on the ‘probabilistic quadrant’ , which is analogous to the Wigner function for the harmonic oscillator, on the phase-space plane. Systems with finite-dimensional Hilbert space (which are naturally described with discrete variables) are described here with continuous probabilistic variables.

arXiv:1912.06421•Journal of Physics A Mathematical and Theoretical•Sep 27, 2019•0 citations

Entanglement and the density matrix renormalization group in the generalized Landau paradigm

Laurens Lootens, Clement Delcamp, Frank Verstraete

The fields of entanglement theory and tensor networks have recently emerged as central tools for characterizing quantum phases of matter. Here we determine the entanglement structure of ground states of gapped symmetric quantum lattice models and use this to obtain the most efficient tensor network representation of those ground states. We do this by showing that degeneracies in the entanglement spectrum arise through a duality transformation of the original model to the unique dual model where the entire dual symmetry is spontaneously broken. Physically, this duality transformation amounts to a-potentially twisted-gauging of the unbroken symmetry in the original ground state. In general, the dual symmetries of the resulting models are generalized non-invertible symmetries that cannot be described by groups. This result has strong implications for the complexity of simulating many-body systems using variational tensor network methods. For every phase in the phase diagram, the dual representation of the ground state that completely breaks the symmetry minimizes both the entanglement entropy and the required number of variational parameters. We demonstrate the applicability of this idea by developing a generalized density matrix renormalization group algorithm that works on constrained Hilbert spaces and quantify the computational gains obtained over traditional tensor network methods in a perturbed Heisenberg model. Our work testifies to the usefulness of generalized non-invertible symmetries and their formal category theoretic description for the practical simulation of strongly correlated systems.

arXiv:2408.06334•Nature Physics•Aug 15, 2025•28 citations

Change of the Pancharatnam phase under unitary transformation and application to a model three-level Γ-type system specified by a pair of dipole-coupled excited states

Istok P. Mendaš, Duska B Popovic

The interdependence of total, dynamic and geometric (Pancharatnam) phases of the state vector of a quantum system that are determined in different representations is considered. One finds that the phases calculated using two different bases of the Hilbert space, which are related by a time-dependent unitary transformation, are not invariant under this transformation; rather they are connected by non-trivial and well-defined relations. We determine the general relationships between the phases in different representations and then apply and verify these transformations in the case of the physically interesting model of the three-level Γ-type system specified by a pair of dipole-coupled excited states.

Physica Scripta•Dec 20, 2011•0 citations

Density Matrix Renormalization Group in the Heisenberg Picture

Michael J. Hartmann, Javier Prior, Stephen R. L. Clark +1 more

In some cases the state of a quantum system with a large number of subsystems can be approximated efficiently by the density-matrix renormalization group, which makes use of redundancies in the description of the state. Here we show that the achievable efficiency can be much better when performing density-matrix renormalization group calculations in the Heisenberg picture, as only the observable of interest but not the entire state is considered. In some nontrivial cases, this approach can even be exact for finite bond dimensions.

arXiv:0808.0666•Physical Review Letters•Feb 2, 2009•85 citations

Application of a renormalization algorithm in Hilbert space to the study of many-body quantum systems

Tarek Khalil, J. Richert

We implement an algorithm which is aimed to reduce the number of basis states spanning the Hilbert space of quantum many-body systems. We test the efficiency of the procedure by working out and analyzing the spectral properties of strongly correlated and frustrated quantum spin systems. The role and importance of symmetries are investigated

arXiv:quant-ph/0606056•Jun 7, 2006•2 citations

Efficient representation of Gaussian fermionic pure states in noncomputational bases

Babak Tarighi, Reyhaneh Khasseh, M. A. Rajabpour

This paper introduces an innovative approach for representing Gaussian fermionic states, pivotal in quantum spin systems and fermionic models, within a range of alternative quantum bases. We focus on transitioning these states from the conventional computational ${\ensuremath{\sigma}}^{z}$ basis to more complex bases, such as $(\ensuremath{\phi},\frac{\ensuremath{\pi}}{2},\ensuremath{\alpha})$, which are essential for accurately calculating critical quantities like formation probabilities and Shannon entropy. Our methodology can be advantageous in quantum quench studies and quantum tomography, where alternative basis representations significantly enhance optimization processes. We present an algorithm that not only simplifies the basis transformation, but also reduces computational complexity, making it feasible to calculate amplitudes of large systems efficiently. Our key contribution is a technique that translates amplitude calculations into the Pfaffian computation of submatrices from an antisymmetric matrix, a process facilitated by understanding domain wall relationships across different bases. As an application, we will determine the formation probabilities for various bases and configurations within the critical transverse field Ising chain, considering both periodic and open boundary conditions. We aim to categorize the configurations and bases by examining the universal constant term that characterizes the scaling of the logarithm of the formation probability in the periodic system, as well as the coefficient of the logarithmic term in the case of open systems. In the open system scenario, this coefficient is influenced by the central charge and the conformal weight of the boundary condition-changing operator. This work is set to expand the toolkit available for researchers in quantum information theory and many-body physics, providing a more efficient and elegant solution for exploring Gaussian fermionic states in nonstandard quantum bases.

arXiv:2403.03289•Physical Review A•Jun 14, 2024•5 citations
Abstract A total set of states for which we have no resolution of the identity (a ‘pre-basis’), is considered in a finite dimensional Hilbert space. A dressing formalism renormalizes them into density matrices which resolve the identity, and makes them a ‘generalized basis’, which is practically useful. The dresssing mechanism is inspired by Shapley’s methodology in cooperative game theory, and it uses Möbius transforms. There is non-independence and redundancy in these generalized bases, which is quantified with a Shannon type of entropy. Due to this redundancy, calculations based on generalized bases are sensitive to physical changes and robust in the presence of noise. For example, the representation of an arbitrary vector in such generalized bases, is robust when noise is inserted in the coefficients. Also in a physical system with a ground state which changes abruptly at some value of the coupling constant, the proposed methodology detects such changes, even when noise is added to the parameters in the Hamiltonian of the system.
Abstract Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses Möbius transforms and adapts Shapley’s methodology in cooperative game theory, into the context of set theory. These ideas are subsequently generalized into the context of finite-dimensional Hilbert spaces. Using random projectors into the subspaces spanned by states from a total set, we construct an infinite number of continuous resolutions of the identity, that involve Hermitian positive semi-definite operators. The simplest one is the diagonal continuous resolution of the identity, and it is used to expand an arbitrary vector in terms of a continuum of components. It is also used to define the function on the ‘probabilistic quadrant’ , which is analogous to the Wigner function for the harmonic oscillator, on the phase-space plane. Systems with finite-dimensional Hilbert space (which are naturally described with discrete variables) are described here with continuous probabilistic variables.
The fields of entanglement theory and tensor networks have recently emerged as central tools for characterizing quantum phases of matter. Here we determine the entanglement structure of ground states of gapped symmetric quantum lattice models and use this to obtain the most efficient tensor network representation of those ground states. We do this by showing that degeneracies in the entanglement spectrum arise through a duality transformation of the original model to the unique dual model where the entire dual symmetry is spontaneously broken. Physically, this duality transformation amounts to a-potentially twisted-gauging of the unbroken symmetry in the original ground state. In general, the dual symmetries of the resulting models are generalized non-invertible symmetries that cannot be described by groups. This result has strong implications for the complexity of simulating many-body systems using variational tensor network methods. For every phase in the phase diagram, the dual representation of the ground state that completely breaks the symmetry minimizes both the entanglement entropy and the required number of variational parameters. We demonstrate the applicability of this idea by developing a generalized density matrix renormalization group algorithm that works on constrained Hilbert spaces and quantify the computational gains obtained over traditional tensor network methods in a perturbed Heisenberg model. Our work testifies to the usefulness of generalized non-invertible symmetries and their formal category theoretic description for the practical simulation of strongly correlated systems.
The interdependence of total, dynamic and geometric (Pancharatnam) phases of the state vector of a quantum system that are determined in different representations is considered. One finds that the phases calculated using two different bases of the Hilbert space, which are related by a time-dependent unitary transformation, are not invariant under this transformation; rather they are connected by non-trivial and well-defined relations. We determine the general relationships between the phases in different representations and then apply and verify these transformations in the case of the physically interesting model of the three-level Γ-type system specified by a pair of dipole-coupled excited states.
In some cases the state of a quantum system with a large number of subsystems can be approximated efficiently by the density-matrix renormalization group, which makes use of redundancies in the description of the state. Here we show that the achievable efficiency can be much better when performing density-matrix renormalization group calculations in the Heisenberg picture, as only the observable of interest but not the entire state is considered. In some nontrivial cases, this approach can even be exact for finite bond dimensions.
This paper introduces an innovative approach for representing Gaussian fermionic states, pivotal in quantum spin systems and fermionic models, within a range of alternative quantum bases. We focus on transitioning these states from the conventional computational ${\ensuremath{\sigma}}^{z}$ basis to more complex bases, such as $(\ensuremath{\phi},\frac{\ensuremath{\pi}}{2},\ensuremath{\alpha})$, which are essential for accurately calculating critical quantities like formation probabilities and Shannon entropy. Our methodology can be advantageous in quantum quench studies and quantum tomography, where alternative basis representations significantly enhance optimization processes. We present an algorithm that not only simplifies the basis transformation, but also reduces computational complexity, making it feasible to calculate amplitudes of large systems efficiently. Our key contribution is a technique that translates amplitude calculations into the Pfaffian computation of submatrices from an antisymmetric matrix, a process facilitated by understanding domain wall relationships across different bases. As an application, we will determine the formation probabilities for various bases and configurations within the critical transverse field Ising chain, considering both periodic and open boundary conditions. We aim to categorize the configurations and bases by examining the universal constant term that characterizes the scaling of the logarithm of the formation probability in the periodic system, as well as the coefficient of the logarithmic term in the case of open systems. In the open system scenario, this coefficient is influenced by the central charge and the conformal weight of the boundary condition-changing operator. This work is set to expand the toolkit available for researchers in quantum information theory and many-body physics, providing a more efficient and elegant solution for exploring Gaussian fermionic states in nonstandard quantum bases.