Parallelization of computations on the bundled matrix product state

Computations for excited states play an outsized role in the determination of electronic structure and properties useful for quantum computers. The algorithms for computing anything beyond the extremal eigensolutions can be very computationally intensive owing to the volume law of entanglement. In this talk, I propose a method to compute excited states on the bundled matrix product state, a concatenation of traditional matrix product states. This method is perfectly general to any algorithm, including those similar to the density matrix renormalization group method, and contains an ideal speedup with increasing computational resources.