activity
20222026
most citedDoes provable absence of barren plateaus imply classical simulability?

78 citations · 244 across the 16 of their papers we have counts for

collaborators
Showing 2026Show all

5 papers · 1 filter

quant-ph2026

Pushing beyond the memory barrier in propagation algorithms with randomization

Manuel S. Rudolph, Ricard Puig, Slimane Thabet +1

Performant classical tools for simulating quantum circuits are important for benchmarking and supporting upcoming quantum devices. Pauli propagation offers promising capabilities,…

quant-ph2026

Dissipation accelerates quantum and classical simulation of open-system dynamics

Armando Angrisani, Ricard Puig, Yanting Teng +1

Simulating open quantum systems reveals how environmental coupling shapes relaxation, excitation transport, and the dynamics of quantum correlations. On quantum hardware, dissipati…

quant-ph2026

The cost of simulating classically tractable quantum circuits and dynamics

Su Yeon Chang, Supanut Thanasilp, Zoë Holmes +1

Determining whether a quantum evolution can be efficiently simulated classically is central to understanding the boundary between classical and quantum computation. However, polyno…

quant-ph2026

Double-bracket quantum algorithms for thermal state preparation

Andrew Wright, Reyhaneh Aghaei Saem, Supanut Thanasilp +2

We propose quantum algorithms for preparing thermal states via the simulation of the thermofield double states. The key idea is to leverage double-bracket quantum algorithms to imp…

quant-ph2026

Leveraging Symmetry Merging in Pauli Propagation

Yanting Teng, Su Yeon Chang, Manuel S. Rudolph +1

We introduce a symmetry-adapted framework for simulating quantum dynamics based on Pauli propagation. When a quantum circuit possesses a symmetry, many Pauli strings evolve redunda…