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:2306.07584 · Physical Review Research

Complexity of fermionic states

Tuomas I. Vanhala, Teemu Ojanen

Published May 16, 2024• 8 citations
arXivHTMLPDF

Abstract

How much information does a fermionic state contain? To address this fundamental question, we define the complexity of a particle-conserving many-fermion state as the entropy of its Fock space probability distribution, minimized over all Fock representations. The complexity characterizes the minimum computational and physical resources required to represent the state and store the information obtained from it by measurements. Alternatively, the complexity can be regarded as a Fock space entanglement measure describing the intrinsic many-particle entanglement in the state. We establish a universal lower bound for the complexity in terms of the single-particle correlation matrix eigenvalues and formulate a finite-size complexity scaling hypothesis. Remarkably, numerical studies on interacting lattice models suggest a general model-independent complexity hierarchy: ground states are exponentially less complex than average excited states, which, in turn, are exponentially less complex than generic states in the Fock space. Our work has fundamental implications on how much information is encoded in fermionic states. Published by the American Physical Society 2024

DOI
10.1103/physrevresearch.6.023178

Related papers

An asymmetry lower bound on fermionic non-Gaussianity

Filiberto Ares, Michele Mazzoni, Sara Murciano +3 more

Fermionic Gaussian states are a fundamental tool in many-body physics, faithfully representing non-interacting quantum systems and allowing for efficient numerical simulations. Given a many-body wave function, it is therefore interesting to ask how much it differs from that of a Gaussian state, as quantified by the notion of non-Gaussianity. In this work, we relate measures of non-Gaussianity with the Shannon entropy of the particle-number distribution, coinciding with the particle-number asymmetry for pure states. We derive a lower bound on the relative entropy of non-Gaussianity in terms of the exponential of the Shannon entropy, and study numerically its tightness for large system sizes. Our bound is non-trivial for large values of the asymmetry and relies on the concentration of the particle-number distribution of (mixed) fermionic Gaussian states. Since the Shannon entropy of the particle-number distribution is often efficient to compute or experimentally measure, our results can be viewed as a practical way to lower bound non-Gaussianity, highlighting a non-trivial interplay with particle-number asymmetry.

quant-pharXiv:2603.16762•Mar 18, 2026•0 citations

Measures of complexity and entanglement in many-fermion systems

Aurel Bulgac, Matthew Kafker, Ibrahim Abdurrahman

There is no unique and widely accepted definition of the complexity measure (CM) of a many-fermion wave function in the presence of interactions. The simplest many-fermion wave function is a Slater determinant. In shell-model or configuration interaction (CI) and other related methods, the state is represented as a superposition of a large number of Slater determinants, which in the case of CI calculations reaches about 20 billion terms [Johnson, arXiv:1809.07869]. Although in practice this number has been used as a CM for decades, it is ill defined: it is not unique, and it depends on the particular type and the number of single-particle wave functions used to construct the Slater determinants. The canonical wave functions and/or natural orbitals [L\"owdin, Adv. Phys. 5, 1 (1956); L\"owdin and Shull, Phys. Rev. 101, 1730 (1956); Bardeen et al., Phys. Rev. 108, 1175 (1957); N. N. Bogoljubov, Il Nuovo Cimento 7, 794 (1958); Valatin, Il Nuovo Cimento 7, 843 (1958); de Gennes, Superconductivity of Metals and Alloys (CRC Press, Boca Raton, FL, 1999); Ring and Schuck, The Nuclear Many-Body Problem, 1st ed. (Springer-Verlag, Berlin, 2004)] and their corresponding occupation probabilities are intrinsic properties of any many-body wave function, irrespective of the representation, and they provide a unique solution to characterize the CM. The non-negative orbital entanglement entropy, which vanishes for a Slater determinant, provides the simplest CM, while a more complete measure of complexity is the entanglement spectrum. We illustrate these aspects in the case of a complex nonequilibrium time-dependent process, induced nuclear fission described within a real-time density functional theory framework extended to superfluid systems, which can describe simultaneously the long-range and the short-range correlations between fermions. The orbital entanglement entropy of the fissioning nucleus illustrates the localization mechanism of the many-body wave function in Fock and/or Hilbert space. The (minimal) number of Slater determinants required to represent such a complex many-body wave function with a well-defined number of particles in the case presented here is about ${10}^{500}$. The realistic case of the highly nonequilibrium nuclear fission process illustrated here is equivalent to a system of $23.328\ifmmode\times\else\texttimes\fi{}{10}^{9}$ interacting quantum spin-1/2 particles, a very large system for the study of quantum entanglement.

arXiv:2203.04843•Physical Review C•Apr 26, 2023•40 citations

STUDIES IN MANY-BODY ENTANGLEMENT OF FERMIONS USING M-BODY DENSITY MATRIX

Irakli Giorgadze

Fermionic Hamiltonians play a critical role in quantum chemistry, one of the most promising use cases for near-term quantum computers. However, since encoding nonlocal fermionic statistics using conventional qubits results in significant computational overhead, fermionic quantum hardware, such as fermion atom arrays, were proposed as a more efficient platform. In this context, we here study the many-body entanglement structure of fermionic $N$-particle states by concentrating on $M$-body reduced density matrices (DMs) across various bipartitions in Fock space. The von Neumann entropy of the reduced DM is a basis independent entanglement measure which generalizes the traditional quantum chemistry concept of the one-particle DM entanglement, which characterizes how a single fermion is entangled with the rest. We carefully examine the upper bounds on the $M$-body entanglement, which are analogous to the volume law of conventional entanglement measures. To this end, we establish a connection between $M$-body reduced DM and the mathematical structure of hypergraphs. Specifically, we show that a special class of hypergraphs, known as $t$-designs, corresponds to maximally entangled fermionic states. We also explore fermionic many-body entanglement in random states. We semianalytically demonstrate that the distribution of reduced DMs associated with random fermionic states corresponds to the trace-fixed Wishart-Laguerre random matrix ensemble. In the limit of large single-particle dimension $D$ and a non-zero filling fraction, random states asymptotically become absolutely maximally entangled. We also analyze many-body entanglement in interacting fermionic systems by using the $M$-body DM. We demonstrate that if a particle number conserving fermionic Hamiltonian contains only up to $M$-body interaction terms, then its $N$-particle ground state cannot be maximally $M$-body entangled. As a key step in the proof, we show that the energy expectation value of a maximally $M$-body mixed state is equal to the spectral mean of the Hamiltonian on the corresponding $N$-particle subspace. We further demonstrate that the many-body entanglement structure of a ground state can place quantitative constraint on the interaction strength of its parent Hamiltonian. We illustrate the theorem and its implications in Hubbard and extended SYK models. Going beyond ground states, we analyze entanglement generation under unitary dynamics from Slater-determinant initial states in these models. We determine early-time growth and estimate entanglement saturation times. Finally, we derive explicit symmetry-refined saturation upper bounds for $M$-body entanglement in the presence of an Abelian symmetry.

•Apr 23, 2026•0 citations

Succinct Fermion Data Structures

Joseph Carolan, Luke Schaeffer

Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic creation-annihilation operators, and the space depends on the number of qubits used. While standard fermion encodings like Jordan-Wigner are space optimal for arbitrary fermionic systems, physical symmetries like particle conservation can reduce the number of physical configurations, allowing improved space complexity. Such space saving is only feasible if the gate overhead is small, suggesting a (quantum) data structures problem, wherein one would like to minimize space used to represent a fermionic state, while still enabling efficient rotations. We define a structure which naturally captures mappings from fermions to systems of qubits. We then instantiate it in two ways, giving rise to two new second-quantized fermion encodings of $F$ fermions in $M$ modes. An information theoretic minimum of $\mathcal{I}:=\lceil\log \binom{M}{F}\rceil$ qubits is required for such systems, a bound we nearly match over the entire parameter regime. (1) Our first construction uses $\mathcal I+o(\mathcal I)$ qubits when $F=o(M)$, and allows rotations generated by creation-annihilation operators in $O(\mathcal I)$ gates and $O(\log M \log \log M)$ depth. (2) Our second construction uses $\mathcal I+O(1)$ qubits when $F=Θ(M)$, and allows rotations generated by creation-annihilation operators in $O(\mathcal I^3)$ gates. In relation to comparable prior work, the first represents a polynomial improvement in both space and gate complexity (against Kirby et al. 2022), and the second represents an exponential improvement in gate complexity at the cost of only a constant number of additional qubits (against Harrison et al. or Shee et al. 2022), in the described parameter regimes.

arXiv:2410.04015•Leibniz international proceedings in informatics•Oct 5, 2024•1 citation

Succinct Fermion Data Structures

Carolan, Joseph, Luke Schaeffer

Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic creation-annihilation operators, and the space depends on the number of qubits used. While standard fermion encodings like Jordan-Wigner are space optimal for arbitrary fermionic systems, physical symmetries like particle conservation can reduce the number of physical configurations, allowing improved space complexity. Such space saving is only feasible if the gate overhead is small, suggesting a (quantum) data structures problem, wherein one would like to minimize space used to represent a fermionic state, while still enabling efficient rotations. We define a structure which naturally captures mappings from fermions to systems of qubits. We then instantiate it in two ways, giving rise to two new second-quantized fermion encodings of F fermions in M modes. An information theoretic minimum of I: = ⌈log₂ binom(M,F)⌉ qubits is required for such systems, a bound we nearly match over the entire parameter regime. 1) Our first construction uses I + o(I) qubits when F = o(M), and allows rotations generated by creation-annihilation operators in O(I) gates and O(log M log log M) depth. 2) Our second construction uses I + O(1) qubits when F = Θ(M), and allows rotations generated by creation-annihilation operators in O(I³) gates. In relation to comparable prior work, the first represents a polynomial improvement in both space and gate complexity (against Kirby et al. 2022), and the second represents an exponential improvement in gate complexity at the cost of only a constant number of additional qubits (against Harrison et al. or Shee et al. 2022), in the described parameter regimes.

•Jan 1, 2025•0 citations

Entanglement entropy in quantum many particle systems and their simulation via ansatz states

Thomas Barthel, Ulrich Schollwöck

In contrast to classical many-particle systems for which the number of degrees of freedom grows linearly with the system size, it grows exponentially for quantum many-particle systems. On the one hand, the resulting complexity of the quantum systems has a high potential for technological advances if it can be exploited directly. For example, in recent years, the fundamentals for the realization of quantum computers and their possible applications have been investigated intensely. On the other hand, the high complexity, especially in strongly correlated regimes, often makes the analytical or numerical analysis of underlying physical phenomena very difficult. This is why some systems of high technological relevance, like the high-temperature superconductors, are still unsatisfactorily understood. A main topic of this thesis is the development of efficient numerical methods for the simulation of strongly correlated quantum lattice models. For one-dimensional systems, the density-matrix renormalization-group (DMRG) is such a very successful method. The physical states of interest are approximated within a certain class of ansatz states. These ansatz states are designed in a way that the number of degrees of freedom are prevented from growing exponentially. With the DMRG method, ground states of interacting one-dimensional systems can often be determined with very high precision. This observation indicates already that ground states actually do not exhaust the available exponential number of degrees of freedom but can be described efficiently with much fewer parameters. The ansatz states used in DMRG are the so-called matrix product states. A very useful criterion for the construction of corresponding appropriate ansatz states for higher-dimensional systems is the quantum nonlocality as for example quantified by the entanglement entropy. The ansatz states should be able to reproduce the scaling properties of the quantum nonlocality in the physical states of interest with as few parameters as possible. The first part of the thesis, therefore, provides analytical and numerical analysis of the scaling of quantum nonlocality with the system size or time in different, physically relevant scenarios. For example, the scaling of Renyi entropies and their dependence on boundary conditions is derived within the 1+1-dimensional conformal field theory. Conjectures and analytical indications concerning the properties of entanglement entropy in critical fermionic and bosonic systems are confirmed numerically with high precision. For integrable models in the thermodynamic limit, general preconditions are derived under which subsystems converge to steady states. These steady states are non-thermal and retain information about the initial state. It is shown that the entanglement entropy in such steady states is extensive. For short times, the entanglement entropy grows typically linearly with time, causing an exponential increase in computation costs for the DMRG method. Consequently, time-dependent DMRG simulations usually have no direct access to the long time regime. The second part of the thesis focuses on the development and improvement of the above-mentioned numerical techniques. The time-dependent DMRG is complemented with an extrapolation technique for the evaluated observables. In this way, the problem of the entropy increase can be circumvented, allowing for a precise determination of spectral functions. The method is demonstrated using the example of the Heisenberg antiferromagnet and results are compared to Bethe-Ansatz data for T=0 and quantum Monte Carlo data for T>0. For the simulation of higher-dimensional systems, projected-entangled pair-states (PEPS) and the multiscale entanglement renormalization ansatz (MERA) turn out to be appropriate wavefunction classes. Initially, they could only be used for spin systems. Within this thesis, variants of those state classes are being suggested for the fermionic case. It is shown how the known algorithms for spin systems can be translated into corresponding algorithms for the fermionic systems. The occurring computation costs increase only by a marginal overhead. First numerical benchmarking tests proceeded successfully. Thus, new techniques are available which can for example be used to examine the two-dimensional Hubbard model. This model is a candidate for the description of high-temperature superconductivity.

•Jan 1, 2009•0 citations
How much information does a fermionic state contain? To address this fundamental question, we define the complexity of a particle-conserving many-fermion state as the entropy of its Fock space probability distribution, minimized over all Fock representations. The complexity characterizes the minimum computational and physical resources required to represent the state and store the information obtained from it by measurements. Alternatively, the complexity can be regarded as a Fock space entanglement measure describing the intrinsic many-particle entanglement in the state. We establish a universal lower bound for the complexity in terms of the single-particle correlation matrix eigenvalues and formulate a finite-size complexity scaling hypothesis. Remarkably, numerical studies on interacting lattice models suggest a general model-independent complexity hierarchy: ground states are exponentially less complex than average excited states, which, in turn, are exponentially less complex than generic states in the Fock space. Our work has fundamental implications on how much information is encoded in fermionic states. Published by the American Physical Society 2024
Fermionic Gaussian states are a fundamental tool in many-body physics, faithfully representing non-interacting quantum systems and allowing for efficient numerical simulations. Given a many-body wave function, it is therefore interesting to ask how much it differs from that of a Gaussian state, as quantified by the notion of non-Gaussianity. In this work, we relate measures of non-Gaussianity with the Shannon entropy of the particle-number distribution, coinciding with the particle-number asymmetry for pure states. We derive a lower bound on the relative entropy of non-Gaussianity in terms of the exponential of the Shannon entropy, and study numerically its tightness for large system sizes. Our bound is non-trivial for large values of the asymmetry and relies on the concentration of the particle-number distribution of (mixed) fermionic Gaussian states. Since the Shannon entropy of the particle-number distribution is often efficient to compute or experimentally measure, our results can be viewed as a practical way to lower bound non-Gaussianity, highlighting a non-trivial interplay with particle-number asymmetry.
There is no unique and widely accepted definition of the complexity measure (CM) of a many-fermion wave function in the presence of interactions. The simplest many-fermion wave function is a Slater determinant. In shell-model or configuration interaction (CI) and other related methods, the state is represented as a superposition of a large number of Slater determinants, which in the case of CI calculations reaches about 20 billion terms [Johnson, arXiv:1809.07869]. Although in practice this number has been used as a CM for decades, it is ill defined: it is not unique, and it depends on the particular type and the number of single-particle wave functions used to construct the Slater determinants. The canonical wave functions and/or natural orbitals [L\"owdin, Adv. Phys. 5, 1 (1956); L\"owdin and Shull, Phys. Rev. 101, 1730 (1956); Bardeen et al., Phys. Rev. 108, 1175 (1957); N. N. Bogoljubov, Il Nuovo Cimento 7, 794 (1958); Valatin, Il Nuovo Cimento 7, 843 (1958); de Gennes, Superconductivity of Metals and Alloys (CRC Press, Boca Raton, FL, 1999); Ring and Schuck, The Nuclear Many-Body Problem, 1st ed. (Springer-Verlag, Berlin, 2004)] and their corresponding occupation probabilities are intrinsic properties of any many-body wave function, irrespective of the representation, and they provide a unique solution to characterize the CM. The non-negative orbital entanglement entropy, which vanishes for a Slater determinant, provides the simplest CM, while a more complete measure of complexity is the entanglement spectrum. We illustrate these aspects in the case of a complex nonequilibrium time-dependent process, induced nuclear fission described within a real-time density functional theory framework extended to superfluid systems, which can describe simultaneously the long-range and the short-range correlations between fermions. The orbital entanglement entropy of the fissioning nucleus illustrates the localization mechanism of the many-body wave function in Fock and/or Hilbert space. The (minimal) number of Slater determinants required to represent such a complex many-body wave function with a well-defined number of particles in the case presented here is about 10500{10}^{500}10500. The realistic case of the highly nonequilibrium nuclear fission process illustrated here is equivalent to a system of $23.328\ifmmode\times\else\texttimes\fi{}{10}^{9}$ interacting quantum spin-1/2 particles, a very large system for the study of quantum entanglement.
Fermionic Hamiltonians play a critical role in quantum chemistry, one of the most promising use cases for near-term quantum computers. However, since encoding nonlocal fermionic statistics using conventional qubits results in significant computational overhead, fermionic quantum hardware, such as fermion atom arrays, were proposed as a more efficient platform. In this context, we here study the many-body entanglement structure of fermionic NNN-particle states by concentrating on MMM-body reduced density matrices (DMs) across various bipartitions in Fock space. The von Neumann entropy of the reduced DM is a basis independent entanglement measure which generalizes the traditional quantum chemistry concept of the one-particle DM entanglement, which characterizes how a single fermion is entangled with the rest. We carefully examine the upper bounds on the MMM-body entanglement, which are analogous to the volume law of conventional entanglement measures. To this end, we establish a connection between MMM-body reduced DM and the mathematical structure of hypergraphs. Specifically, we show that a special class of hypergraphs, known as ttt-designs, corresponds to maximally entangled fermionic states. We also explore fermionic many-body entanglement in random states. We semianalytically demonstrate that the distribution of reduced DMs associated with random fermionic states corresponds to the trace-fixed Wishart-Laguerre random matrix ensemble. In the limit of large single-particle dimension DDD and a non-zero filling fraction, random states asymptotically become absolutely maximally entangled. We also analyze many-body entanglement in interacting fermionic systems by using the MMM-body DM. We demonstrate that if a particle number conserving fermionic Hamiltonian contains only up to MMM-body interaction terms, then its NNN-particle ground state cannot be maximally MMM-body entangled. As a key step in the proof, we show that the energy expectation value of a maximally MMM-body mixed state is equal to the spectral mean of the Hamiltonian on the corresponding NNN-particle subspace. We further demonstrate that the many-body entanglement structure of a ground state can place quantitative constraint on the interaction strength of its parent Hamiltonian. We illustrate the theorem and its implications in Hubbard and extended SYK models. Going beyond ground states, we analyze entanglement generation under unitary dynamics from Slater-determinant initial states in these models. We determine early-time growth and estimate entanglement saturation times. Finally, we derive explicit symmetry-refined saturation upper bounds for MMM-body entanglement in the presence of an Abelian symmetry.
Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic creation-annihilation operators, and the space depends on the number of qubits used. While standard fermion encodings like Jordan-Wigner are space optimal for arbitrary fermionic systems, physical symmetries like particle conservation can reduce the number of physical configurations, allowing improved space complexity. Such space saving is only feasible if the gate overhead is small, suggesting a (quantum) data structures problem, wherein one would like to minimize space used to represent a fermionic state, while still enabling efficient rotations. We define a structure which naturally captures mappings from fermions to systems of qubits. We then instantiate it in two ways, giving rise to two new second-quantized fermion encodings of FFF fermions in MMM modes. An information theoretic minimum of I:=⌈log⁡(MF)⌉\mathcal{I}:=\lceil\log \binom{M}{F}\rceilI:=⌈log(FM​)⌉ qubits is required for such systems, a bound we nearly match over the entire parameter regime. (1) Our first construction uses I+o(I)\mathcal I+o(\mathcal I)I+o(I) qubits when F=o(M)F=o(M)F=o(M), and allows rotations generated by creation-annihilation operators in O(I)O(\mathcal I)O(I) gates and O(log⁡Mlog⁡log⁡M)O(\log M \log \log M)O(logMloglogM) depth. (2) Our second construction uses I+O(1)\mathcal I+O(1)I+O(1) qubits when F=Θ(M)F=Θ(M)F=Θ(M), and allows rotations generated by creation-annihilation operators in O(I3)O(\mathcal I^3)O(I3) gates. In relation to comparable prior work, the first represents a polynomial improvement in both space and gate complexity (against Kirby et al. 2022), and the second represents an exponential improvement in gate complexity at the cost of only a constant number of additional qubits (against Harrison et al. or Shee et al. 2022), in the described parameter regimes.
Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic creation-annihilation operators, and the space depends on the number of qubits used. While standard fermion encodings like Jordan-Wigner are space optimal for arbitrary fermionic systems, physical symmetries like particle conservation can reduce the number of physical configurations, allowing improved space complexity. Such space saving is only feasible if the gate overhead is small, suggesting a (quantum) data structures problem, wherein one would like to minimize space used to represent a fermionic state, while still enabling efficient rotations. We define a structure which naturally captures mappings from fermions to systems of qubits. We then instantiate it in two ways, giving rise to two new second-quantized fermion encodings of F fermions in M modes. An information theoretic minimum of I: = ⌈log₂ binom(M,F)⌉ qubits is required for such systems, a bound we nearly match over the entire parameter regime. 1) Our first construction uses I + o(I) qubits when F = o(M), and allows rotations generated by creation-annihilation operators in O(I) gates and O(log M log log M) depth. 2) Our second construction uses I + O(1) qubits when F = Θ(M), and allows rotations generated by creation-annihilation operators in O(I³) gates. In relation to comparable prior work, the first represents a polynomial improvement in both space and gate complexity (against Kirby et al. 2022), and the second represents an exponential improvement in gate complexity at the cost of only a constant number of additional qubits (against Harrison et al. or Shee et al. 2022), in the described parameter regimes.
In contrast to classical many-particle systems for which the number of degrees of freedom grows linearly with the system size, it grows exponentially for quantum many-particle systems. On the one hand, the resulting complexity of the quantum systems has a high potential for technological advances if it can be exploited directly. For example, in recent years, the fundamentals for the realization of quantum computers and their possible applications have been investigated intensely. On the other hand, the high complexity, especially in strongly correlated regimes, often makes the analytical or numerical analysis of underlying physical phenomena very difficult. This is why some systems of high technological relevance, like the high-temperature superconductors, are still unsatisfactorily understood. A main topic of this thesis is the development of efficient numerical methods for the simulation of strongly correlated quantum lattice models. For one-dimensional systems, the density-matrix renormalization-group (DMRG) is such a very successful method. The physical states of interest are approximated within a certain class of ansatz states. These ansatz states are designed in a way that the number of degrees of freedom are prevented from growing exponentially. With the DMRG method, ground states of interacting one-dimensional systems can often be determined with very high precision. This observation indicates already that ground states actually do not exhaust the available exponential number of degrees of freedom but can be described efficiently with much fewer parameters. The ansatz states used in DMRG are the so-called matrix product states. A very useful criterion for the construction of corresponding appropriate ansatz states for higher-dimensional systems is the quantum nonlocality as for example quantified by the entanglement entropy. The ansatz states should be able to reproduce the scaling properties of the quantum nonlocality in the physical states of interest with as few parameters as possible. The first part of the thesis, therefore, provides analytical and numerical analysis of the scaling of quantum nonlocality with the system size or time in different, physically relevant scenarios. For example, the scaling of Renyi entropies and their dependence on boundary conditions is derived within the 1+1-dimensional conformal field theory. Conjectures and analytical indications concerning the properties of entanglement entropy in critical fermionic and bosonic systems are confirmed numerically with high precision. For integrable models in the thermodynamic limit, general preconditions are derived under which subsystems converge to steady states. These steady states are non-thermal and retain information about the initial state. It is shown that the entanglement entropy in such steady states is extensive. For short times, the entanglement entropy grows typically linearly with time, causing an exponential increase in computation costs for the DMRG method. Consequently, time-dependent DMRG simulations usually have no direct access to the long time regime. The second part of the thesis focuses on the development and improvement of the above-mentioned numerical techniques. The time-dependent DMRG is complemented with an extrapolation technique for the evaluated observables. In this way, the problem of the entropy increase can be circumvented, allowing for a precise determination of spectral functions. The method is demonstrated using the example of the Heisenberg antiferromagnet and results are compared to Bethe-Ansatz data for T=0 and quantum Monte Carlo data for T>0. For the simulation of higher-dimensional systems, projected-entangled pair-states (PEPS) and the multiscale entanglement renormalization ansatz (MERA) turn out to be appropriate wavefunction classes. Initially, they could only be used for spin systems. Within this thesis, variants of those state classes are being suggested for the fermionic case. It is shown how the known algorithms for spin systems can be translated into corresponding algorithms for the fermionic systems. The occurring computation costs increase only by a marginal overhead. First numerical benchmarking tests proceeded successfully. Thus, new techniques are available which can for example be used to examine the two-dimensional Hubbard model. This model is a candidate for the description of high-temperature superconductivity.