Poulin, David

Quantum Metropolis sampling

Temme, K., Osborne, T. J., Vollbrecht, K. G., Poulin, D., & Verstraete, F. (2011) · Nature

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 305

Quantum Simulation of Time-Dependent Hamiltonians and the Convenient Illusion of Hilbert Space

Poulin, D., Qarry, A., Somma, R., & Verstraete, F. (2011) · Physical Review Letters

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 265

The Trotter step size required for accurate quantum simulation of quantum chemistry

Poulin, D., Hastings, M. B., Wecker, D., Wiebe, N., Doberty, A. C., & Troyer, M. (2015) · Quantum Information and Computation

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 159

Quantum Algorithm for Spectral Measurement with a Lower Gate Count

Poulin, D., Kitaev, A., Steiger, D. S., Hastings, M. B., & Troyer, M. (2018) · Physical Review Letters

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 108

Optimal and efficient decoding of concatenated quantum block codes

Poulin, D. (2006) · Physical Review A

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 105

Subsystem surface codes with three-qubit check operators

Bravyi, S., Duclos-Cianci, G., Poulin, D., & Suchara, M. (2012) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 58

Fault-tolerant renormalization group decoder for Abelian topological codes

Duclos-Cianci, G., & Poulin, D. (2014) · Quantum Information and Computation

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 52

A small quantum computer is needed to optimize fault-tolerant protocols

Iyer, P., & Poulin, D. (2018) · Quantum Science and Technology

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 34