Erika Ye
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Erika Ye has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Chao Yang
Applied Mathematics and Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, USA
2 shared publications - Garnet Kin-Lic Chan
California Institute of Technology
2 shared publications - Nuno F. Loureiro
Massachusetts Institute of Technology
2 shared publications - Abtin Ameri
Erika Ye (Massachusetts Institute of Technology, USA), Paola Cappellaro (Massachusetts Institute of Technology, USA)
1 shared publication Austin J. Minnich
Division of Engineering and Applied Sciences, California Institute of Technology, Pasadena, USA
1 shared publication- Austin J. Minnich
Division of Engineering and Applied Science, California Institute of Technology , Pasadena, California 91125
1 shared publication
Latest Publications
- Open Access
- 22 October 2026
- Published by Springer Nature in Computational Science and Engineering
Time integration of quantized tensor trains using the interpolative dynamical low-rank approximation
- 22 October 2026
- Published by Springer Nature in Computational Science and Engineering
Open AccessTime integration of quantized tensor trains using the interpolative dynamical low-rank approximation
- Open Access
Time integration of quantized tensor trains using the interpolative dynamical low-rank approximation
Quantized tensor trains (QTTs) are a low-rank and multiscale framework that allows for efficient approximation and manipulation of multi-dimensional, high resolution data. One area of active research is their use in numerical simulation of hyperbolic systems such as the Navier-Stokes equations and the Vlasov equations. One popular time integration scheme is the dynamical low-rank approximation (DLRA), in which the time integration is constrained to a low-rank manifold. However, until recently, DLRA has typically used orthogonal projectors to project the original dynamical system into a reduced space, which is only well-suited for linear systems. DLRA has also mostly been investigated in the context of non-quantized tensor trains. This work investigates interpolative DLRA schemes in which the low-rank manifold is constructed from aptly chosen interpolation points and interpolating polynomials, in the context of QTTs. Through various examples, its performance is compared to its orthogonal counterpart. This work demonstrates how interpolative DLRA is suitable for nonlinear systems and time integrators requiring nonlinear element-wise operations, such as upwind time integration schemes.
Open AccessTime integration of quantized tensor trains using the interpolative dynamical low-rank approximation
Quantized tensor trains (QTTs) are a low-rank and multiscale framework that allows for efficient approximation and manipulation of multi-dimensional, high resolution data. One area of active research is their use in numerical simulation of hyperbolic systems such as the Navier-Stokes equations and the Vlasov equations. One popular time integration scheme is the dynamical low-rank approximation (DLRA), in which the time integration is constrained to a low-rank manifold. However, until recently, DLRA has typically used orthogonal projectors to project the original dynamical system into a reduced space, which is only well-suited for linear systems. DLRA has also mostly been investigated in the context of non-quantized tensor trains. This work investigates interpolative DLRA schemes in which the low-rank manifold is constructed from aptly chosen interpolation points and interpolating polynomials, in the context of QTTs. Through various examples, its performance is compared to its orthogonal counterpart. This work demonstrates how interpolative DLRA is suitable for nonlinear systems and time integrators requiring nonlinear element-wise operations, such as upwind time integration schemes.
- Top Cited PapersOpen Access
- 1 June 2024
- Published by Cambridge University Press (CUP) in Journal of Plasma Physics
- Vol. 90 (3) , 805900301
Quantized tensor networks for solving the Vlasov–Maxwell equations
The Vlasov–Maxwell equations provide an ab initio description of collisionless plasmas, but solving them is often impractical because of the wide range of spatial and temporal scales that must be resolved and the high dimensionality of the problem. In this work, we present a quantum-inspired semi-implicit Vlasov–Maxwell solver that uses the quantized tensor network (QTN) framework. With this QTN solver, the cost of grid-based numerical simulation of size $N$ is reduced from $O(N)$ to $O(\text {poly}(D))$ , where $D$ is the ‘rank’ or ‘bond dimension’ of the QTN and is typically set to be much smaller than $N$ . We find that for the five-dimensional test problems considered here, a modest $D=64$ appears to be sufficient for capturing the expected physics despite the simulations using a total of $N=2^{36}$ grid points, which would require $D=2^{18}$ for full-rank calculations. Additionally, we observe that a QTN time evolution scheme based on the Dirac–Frenkel variational principle allows one to use somewhat larger time steps than prescribed by the Courant–Friedrichs–Lewy constraint. As such, this work demonstrates that the QTN format is a promising means of approximately solving the Vlasov–Maxwell equations with significantly reduced cost.- 1 June 2024
- Published by Cambridge University Press (CUP) in Journal of Plasma Physics
- Vol. 90 (3) , 805900301
Top Cited PapersOpen AccessQuantized tensor networks for solving the Vlasov–Maxwell equations
The Vlasov–Maxwell equations provide an ab initio description of collisionless plasmas, but solving them is often impractical because of the wide range of spatial and temporal scales that must be resolved and the high dimensionality of the problem. In this work, we present a quantum-inspired semi-implicit Vlasov–Maxwell solver that uses the quantized tensor network (QTN) framework. With this QTN solver, the cost of grid-based numerical simulation of size $N$ is reduced from $O(N)$ to $O(\text {poly}(D))$ , where $D$ is the ‘rank’ or ‘bond dimension’ of the QTN and is typically set to be much smaller than $N$ . We find that for the five-dimensional test problems considered here, a modest $D=64$ appears to be sufficient for capturing the expected physics despite the simulations using a total of $N=2^{36}$ grid points, which would require $D=2^{18}$ for full-rank calculations. Additionally, we observe that a QTN time evolution scheme based on the Dirac–Frenkel variational principle allows one to use somewhat larger time steps than prescribed by the Courant–Friedrichs–Lewy constraint. As such, this work demonstrates that the QTN format is a promising means of approximately solving the Vlasov–Maxwell equations with significantly reduced cost. - 12 June 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 107 (6) , 062412
Quantum algorithm for the linear Vlasov equation with collisions
The Vlasov equation is a nonlinear partial differential equation that provides a first-principles description of the dynamics of plasmas. Its linear limit is routinely used in plasma physics to investigate plasma oscillations and stability. In this paper, we present a quantum algorithm that simulates the linearized Vlasov equation with and without collisions, in the one-dimensional electrostatic limit. Rather than solving this equation in its native spatial and velocity phase space, we adopt an efficient representation in the dual space yielded by a Fourier-Hermite expansion. For a given simulation time, the Fourier-Hermite representation is exponentially more compact, thus yielding a classical algorithm that can match the performance of a previously proposed quantum algorithm for this problem. This representation results in a system of linear ordinary differential equations (ODEs) which can be solved with well-developed quantum algorithms: a Hamiltonian simulation in the collisionless case, and quantum ODE solvers in the collisional case. In particular, we demonstrate that a quadratic speedup in system size is attainable.
- 12 June 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 107 (6) , 062412
Quantum algorithm for the linear Vlasov equation with collisions
The Vlasov equation is a nonlinear partial differential equation that provides a first-principles description of the dynamics of plasmas. Its linear limit is routinely used in plasma physics to investigate plasma oscillations and stability. In this paper, we present a quantum algorithm that simulates the linearized Vlasov equation with and without collisions, in the one-dimensional electrostatic limit. Rather than solving this equation in its native spatial and velocity phase space, we adopt an efficient representation in the dual space yielded by a Fourier-Hermite expansion. For a given simulation time, the Fourier-Hermite representation is exponentially more compact, thus yielding a classical algorithm that can match the performance of a previously proposed quantum algorithm for this problem. This representation results in a system of linear ordinary differential equations (ODEs) which can be solved with well-developed quantum algorithms: a Hamiltonian simulation in the collisionless case, and quantum ODE solvers in the collisional case. In particular, we demonstrate that a quadratic speedup in system size is attainable.
- 29 September 2022
- Published by American Physical Society (APS) in Physical Review E
- Vol. 106 (3) , 035208
Quantum-inspired method for solving the Vlasov-Poisson equations
Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high-resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently, it has been proposed that matrix product state (MPS) methods, a quantum-inspired but classical algorithm, can be used to solve partial differential equations with exponential speed-up, provided that the solution can be compressed and efficiently represented as a MPS within some tolerable error threshold. In this work, we explore the practicality of MPS methods for solving the Vlasov-Poisson equations for systems with one coordinate in space and one coordinate in velocity, and find that important features of linear and nonlinear dynamics, such as damping or growth rates and saturation amplitudes, can be captured while compressing the solution significantly. Furthermore, by comparing the performance of different mappings of the distribution functions onto the MPS, we develop an intuition of the MPS representation and its behavior in the context of solving the Vlasov-Poisson equations, which will be useful for extending these methods to higher-dimensional problems.
- 29 September 2022
- Published by American Physical Society (APS) in Physical Review E
- Vol. 106 (3) , 035208
Quantum-inspired method for solving the Vlasov-Poisson equations
Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high-resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently, it has been proposed that matrix product state (MPS) methods, a quantum-inspired but classical algorithm, can be used to solve partial differential equations with exponential speed-up, provided that the solution can be compressed and efficiently represented as a MPS within some tolerable error threshold. In this work, we explore the practicality of MPS methods for solving the Vlasov-Poisson equations for systems with one coordinate in space and one coordinate in velocity, and find that important features of linear and nonlinear dynamics, such as damping or growth rates and saturation amplitudes, can be captured while compressing the solution significantly. Furthermore, by comparing the performance of different mappings of the distribution functions onto the MPS, we develop an intuition of the MPS representation and its behavior in the context of solving the Vlasov-Poisson equations, which will be useful for extending these methods to higher-dimensional problems.
- 26 July 2021
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 155 (4) , 044104
Constructing tensor network influence functionals for general quantum dynamics
We describe an iterative formalism to compute influence functionals that describe the general quantum dynamics of a subsystem beyond the assumption of linear coupling to a quadratic bath. We use a space-time tensor network representation of the influence functional and investigate its approximability in terms of its bond dimension and time-like entanglement in the tensor network description. We study two numerical models, the spin-boson model and a model of interacting hard-core bosons in a 1D harmonic trap. We find that the influence functional and the intermediates involved in its construction can be efficiently approximated by low bond dimension tensor networks in certain dynamical regimes, which allows the quantum dynamics to be accurately computed for longer times than with direct time evolution methods. However, as one iteratively integrates out the bath, the correlations in the influence functional can first increase before decreasing, indicating that the final compressibility of the influence functional is achieved via non-trivial cancellation.
- 26 July 2021
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 155 (4) , 044104
Constructing tensor network influence functionals for general quantum dynamics
We describe an iterative formalism to compute influence functionals that describe the general quantum dynamics of a subsystem beyond the assumption of linear coupling to a quadratic bath. We use a space-time tensor network representation of the influence functional and investigate its approximability in terms of its bond dimension and time-like entanglement in the tensor network description. We study two numerical models, the spin-boson model and a model of interacting hard-core bosons in a 1D harmonic trap. We find that the influence functional and the intermediates involved in its construction can be efficiently approximated by low bond dimension tensor networks in certain dynamical regimes, which allows the quantum dynamics to be accurately computed for longer times than with direct time evolution methods. However, as one iteratively integrates out the bath, the correlations in the influence functional can first increase before decreasing, indicating that the final compressibility of the influence functional is achieved via non-trivial cancellation.
- Top Cited PapersOpen Access
- 27 May 2021
- Published by Springer Nature in npj Quantum Information
- Vol. 7 (1) , 1-7
Low rank representations for quantum simulation of electronic structure
The quantum simulation of quantum chemistry is a promising application of quantum computers. However, for N molecular orbitals, the $${\mathcal{O}}({N}^{4})$$ gate complexity of performing Hamiltonian and unitary Coupled Cluster Trotter steps makes simulation based on such primitives challenging. We substantially reduce the gate complexity of such primitives through a two-step low-rank factorization of the Hamiltonian and cluster operator, accompanied by truncation of small terms. Using truncations that incur errors below chemical accuracy allow one to perform Trotter steps of the arbitrary basis electronic structure Hamiltonian with $${\mathcal{O}}({N}^{3})$$ gate complexity in small simulations, which reduces to $${\mathcal{O}}({N}^{2})$$ gate complexity in the asymptotic regime; and unitary Coupled Cluster Trotter steps with $${\mathcal{O}}({N}^{3})$$ gate complexity as a function of increasing basis size for a given molecule. In the case of the Hamiltonian Trotter step, these circuits have $${\mathcal{O}}({N}^{2})$$ depth on a linearly connected array, an improvement over the $${\mathcal{O}}({N}^{3})$$ scaling assuming no truncation. As a practical example, we show that a chemically accurate Hamiltonian Trotter step for a 50 qubit molecular simulation can be carried out in the molecular orbital basis with as few as 4000 layers of parallel nearest-neighbor two-qubit gates, consisting of fewer than 105 non-Clifford rotations. We also apply our algorithm to iron–sulfur clusters relevant for elucidating the mode of action of metalloenzymes.- 27 May 2021
- Published by Springer Nature in npj Quantum Information
- Vol. 7 (1) , 1-7
Top Cited PapersOpen AccessLow rank representations for quantum simulation of electronic structure
The quantum simulation of quantum chemistry is a promising application of quantum computers. However, for N molecular orbitals, the $${\mathcal{O}}({N}^{4})$$ gate complexity of performing Hamiltonian and unitary Coupled Cluster Trotter steps makes simulation based on such primitives challenging. We substantially reduce the gate complexity of such primitives through a two-step low-rank factorization of the Hamiltonian and cluster operator, accompanied by truncation of small terms. Using truncations that incur errors below chemical accuracy allow one to perform Trotter steps of the arbitrary basis electronic structure Hamiltonian with $${\mathcal{O}}({N}^{3})$$ gate complexity in small simulations, which reduces to $${\mathcal{O}}({N}^{2})$$ gate complexity in the asymptotic regime; and unitary Coupled Cluster Trotter steps with $${\mathcal{O}}({N}^{3})$$ gate complexity as a function of increasing basis size for a given molecule. In the case of the Hamiltonian Trotter step, these circuits have $${\mathcal{O}}({N}^{2})$$ depth on a linearly connected array, an improvement over the $${\mathcal{O}}({N}^{3})$$ scaling assuming no truncation. As a practical example, we show that a chemically accurate Hamiltonian Trotter step for a 50 qubit molecular simulation can be carried out in the molecular orbital basis with as few as 4000 layers of parallel nearest-neighbor two-qubit gates, consisting of fewer than 105 non-Clifford rotations. We also apply our algorithm to iron–sulfur clusters relevant for elucidating the mode of action of metalloenzymes. - Open Access
- 5 February 2019
- Published by AIP Publishing in Journal of Applied Physics
- Vol. 125 (5) , 055107
Ab initio based investigation of thermal transport in superlattices using the Boltzmann equation: Assessing the role of phonon coherence
The role of the coherent interference of phonons on thermal transport in artificial materials such as superlattices is of intense interest. Recent experimental studies report a non-monotonic trend in thermal conductivity with interface density which is attributed to band-folding of thermal phonons. Various models have been proposed to interpret these measurements, but most make simplifying assumptions that make definitively attributing the trends to the coherent transport difficult. Here, we investigate thermal transport in superlattices in the incoherent limit using the Boltzmann equation with intrinsic phonon dispersions and lifetimes calculated from first-principles. We find that the Boltzmann equation is unable to predict the non-monotonic behavior of thermal conductivity versus superlattice period, supporting the interpretation of phonon interference in recent experiments.
- 5 February 2019
- Published by AIP Publishing in Journal of Applied Physics
- Vol. 125 (5) , 055107
Open AccessAb initio based investigation of thermal transport in superlattices using the Boltzmann equation: Assessing the role of phonon coherence
The role of the coherent interference of phonons on thermal transport in artificial materials such as superlattices is of intense interest. Recent experimental studies report a non-monotonic trend in thermal conductivity with interface density which is attributed to band-folding of thermal phonons. Various models have been proposed to interpret these measurements, but most make simplifying assumptions that make definitively attributing the trends to the coherent transport difficult. Here, we investigate thermal transport in superlattices in the incoherent limit using the Boltzmann equation with intrinsic phonon dispersions and lifetimes calculated from first-principles. We find that the Boltzmann equation is unable to predict the non-monotonic behavior of thermal conductivity versus superlattice period, supporting the interpretation of phonon interference in recent experiments.