7 citations · 7 across the 3 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2026
Pre-optimization of quantum circuits, barren plateaus and classical simulability: tensor networks to unlock the variational quantum eigensolver
Baptiste Anselme Martin, Thomas Ayral
Variational quantum algorithms are practical approaches to prepare ground states, but their potential for quantum advantage remains unclear. Here, we use differentiable 2D tensor n…
quant-ph2023★ 7 cited
Anderson impurity solver integrating tensor network methods with quantum computing
Francois Jamet, Lachlan P. Lindoy, Yannic Rath +6
Solving the Anderson impurity model typically involves a two-step process, where one first calculates the ground state of the Hamiltonian, and then computes its dynamical propertie…