Building on recent advances in quantum algorithms which measure and reuse qubits and in efficient classical simulation leveraging projective measurements, we extend these frameworks to real-time dynamics of quantum many-body systems undergoing discrete-time and continuous-time Hamiltonian evolution, and find improvements that significantly reduce sampling overhead. The approach exploits causal light-cone structure by interleaving time and space evolution and applying projective measurements as soon as local subsystems reach the target physical time, suppressing entanglement growth. Comparing to time-evolving block decimation, the method reaches longer times per sample for the same resources. We also gain the ability to study dynamics of entanglement that would be occurring on quantum hardware when following similar protocols, such as the holographic quantum dynamics simulation framework. We show how to efficiently obtain local observables as well as equal-time and time-dependent correlation functions. Our findings show how optimizations for quantum hardware can benefit classical tensor network simulations and how such classical methods can yield insights into the utility of quantum simulations.
Building on recent advances in quantum algorithms which measure and reuse qubits and in efficient classical simulation leveraging projective measurements, we extend these frameworks to real-time dynamics of quantum many-body systems undergoing discrete-time and continuous-time Hamiltonian evolution, and find improvements that significantly reduce sampling overhead. The approach exploits causal light-cone structure by interleaving time and space evolution and applying projective measurements as soon as local subsystems reach the target physical time, suppressing entanglement growth. Comparing to time-evolving block decimation, the method reaches longer times per sample for the same resources. We also gain the ability to study dynamics of entanglement that would be occurring on quantum hardware when following similar protocols, such as the holographic quantum dynamics simulation framework. We show how to efficiently obtain local observables as well as equal-time and time-dependent correlation functions. Our findings show how optimizations for quantum hardware can benefit classical tensor network simulations and how such classical methods can yield insights into the utility of quantum simulations.
The accurate simulation of complex systems, encompassing fields like materials science, quantum chemistry, and finance, often presents a formidable computational challenge. Traditional methods frequently struggle to scale effectively, particularly when dealing with high-dimensionality or intricate correlations. This paper introduces a novel simulation approach leveraging tensor networks (TN) in conjunction with quantum-inspired sampling techniques. The core idea is to approximate the dynamics of these complex systems by exploiting the inherent structure of tensor networks and employing sampling strategies inspired by quantum measurement processes. We demonstrate that this hybrid approach offers a pathway towards scalable simulations, achieving high accuracy while mitigating the computational bottlenecks associated with conventional methods. The key innovations lie in the adaptive construction of TNs based on the system's correlation structure and the utilization of quantum-inspired sampling methods to efficiently capture the relevant dynamics. This work presents a theoretical framework and outlines a methodology for implementing such simulations, paving the way for advancements in the modeling and understanding of complex systems.
The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.
Quantum computers provide a promising platform to understand and control the dynamics of quantum many-body systems, yet current devices operate in the noisy intermediate-scale quantum (NISQ) regime, where decoherence caused by interactions with the environment severely limit their ability to accurately carry out computations. This thesis investigates how these limitations affect the simulation of quantum many-body systems, and explores strategies to design efficient quantum algorithms that can operate under realistic experimental constraints. In the first part, we assess the performance of currently available quantum hardware using lattice gauge theory as a challenging testbed. We study digital quantum simulations of a one-dimensional discretization of quantum electrodynamics on Rydberg atom and superconducting platforms, combining classical simulations with realistic noise models and quantum simulations on actual cloud-accessible devices, and analyze the impact of decoherence and gate errors on the accurate reconstruction of dynamical observables. Our findings show that, for the hardware available at the time of the study, reliable simulations without high quality error mitigation are restricted to short circuit depths or small system sizes. These limitations motivate the second part of the work, where we focus on constructing resource-efficient quantum algorithms by exploiting physical insight from quantum many-body physics. First, we introduce an approximate inversion protocol for classical shadows that enables the efficient estimation of global properties of quantum states using shallow quantum circuits. Then, we propose an algorithm for the preparation of short-range correlated quantum states, based on reconstructing the global state by learning local reduced density matrices through classical variational optimization. Taken together, the results of this thesis provide insight into the capabilities of currently available quantum devices and demonstrate how structure inherent to quantum many-body systems can be leveraged to design algorithms compatible with current hardware.
Tensor-network simulations of quantum many-body dynamics are fundamentally limited by entanglement build-up, which leads to exponentially growing computational costs. Furthermore, these classical simulation algorithms are inherently sequential as typically a tensor network representation of the quantum state is updated incrementally at each time step. We build on recently introduced randomized quantum algorithms for time evolution (TE-PAI), and adapt them to the classical simulation context with the purpose of enabling massive parallelisation. Our MPS TE-PAI approach achieves exact time evolution on average (unbiased estimator) and proceeds by representing an ensemble of randomized shallow Trotter-variant circuits as tensor networks. As each circuit instance yields a deterministic quantum state (or observable expecation value), the only source of randomness is the sampling of circuit variants; the absence of shot noise therefore yields a reduced estimator variance relative to quantum hardware implementations of TE-PAI. We simulate representative disordered one-dimensional spin-ring Hamiltonians, and numerically observe reductions in the per-sample gate-count by a factor of up to 103 relative to Trotterized MPS evolution, yielding orders of magnitude reduction in the time-to-solution under realistic levels of parallelisation. Finally, we numerically observe that MPS TE-PAI is substantially more robust against severe bond-dimension truncation than product formulas, potentially making it useful for the simulation of strongly correlated systems where truncation is necessary in practice. We also demonstrate that the approach can be used naturally in combination with existing time evolution algorithms, effectively extending their time depth via parallelisation.
Simulating quantum many-body systems is essential for understanding complex phenomena in condensed matter, chemistry, and materials science. Quantum computing offers a way to overcome the limitations of classical methods by operating directly in exponentially large Hilbert spaces. In particular, classical methods often fail to capture the dynamics of strongly correlated systems, which makes quantum algorithms a promising alternative for exploring these challenging regimes. This thesis uses quantum dynamics simulations to probe the behaviour of many-body systems. We first introduce a spectroscopy-based protocol to extract excitation spectra from the time evolution of observables and analyse its performance on near-term quantum devices. We show that the protocol requires only short evolution times and is resilient to errors, facilitating its implementation on real hardware. Building on this, we simulate fermionic excitation spectra using current quantum devices, introducing resource optimisations - including an approximate free-fermion initial state, a unitary quench without ancillae, and reduced Trotter steps - that significantly lower circuit depth. These improvements enable simulations at system sizes competitive with the state of the art, yielding results that match classical benchmarks. While most studies focus on unitary dynamics of isolated systems, open quantum dynamics is increasingly relevant for describing non-equilibrium processes across biology, materials science, and quantum control. We extend our scope to systems coupled to an environment and governed by Lindbladian evolution. By studying simulation complexity through physically meaningful quantities - such as correlation length and mixing time - we explore whether open-system dynamics can be as tractable as their unitary counterparts. These findings provide insights into the computational complexity landscape of open-system simulation and highlight regimes where quantum methods offer a clear advantage.
While quantum computers promise to solve classically intractable problems, identifying the point at which fault-tolerant quantum computation outperforms the best classical algorithms for practical applications remains an outstanding challenge. Here we establish a concrete quantum-classical crossover for quantum many-body dynamics under realistic hardware conditions. We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations, suppressing the residual logical errors that limit existing partially fault-tolerant approaches. A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics at modest system sizes. For a physical error rate of p=10−3, fault-tolerant simulation requires approximately 2 hours and 3.7×105 physical qubits for a 100-site 1D system, whereas tensor network approaches would require about 100 years. For 2D models, where rapid entanglement growth limits the classical evolution time, we project quantum runtimes within minutes. A physical error rate of p=10−4 leads to at least an order of magnitude reduction in qubit count (3.1×104 physical qubits) and runtime (minutes for 1D and seconds for 2D). The reduction in quantum runtime arises from our improved rotation-state injection and co-design of quantum error correction and observable-estimation protocols, which jointly suppress logical-error accumulation and reduce sampling overhead. Our results establish a scalable route towards practical quantum advantage and identify quantitative engineering targets for future fault-tolerant architectures.