| Hardness of decoding quantum stabilizer codes P Iyer, D Poulin IEEE Transactions on Information Theory 61 (9), 5209-5223, 2015 | 46 | 2015 |
| P. Iyer and D. Poulin, Hardness of decoding quantum stabilizer codes, IEEE 61, 5209 (2015). P Iyer IEEE 61, 5209, 2015 | 46* | 2015 |
| Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics C Chamberland, P Iyer, D Poulin Quantum 2, 43, 2018 | 38 | 2018 |
| A Small Quantum Computer is Needed to Optimize Fault-Tolerant Protocols P Iyer, D Poulin arXiv preprint arXiv:1711.04736, 2017 | 33 | 2017 |
| Generalized surface codes and packing of logical qubits N Delfosse, P Iyer, D Poulin arXiv preprint arXiv:1606.07116, 2016 | 23 | 2016 |
| A linear-time benchmarking tool for generalized surface codes N Delfosse, P Iyer, D Poulin arXiv preprint arXiv:1611.04256, 2016 | 12 | 2016 |
| Critical noise parameters for fault-tolerant quantum computation A Darmawan, P Iyer, D Poulin | 2 | 2016 |
| Critical parameters of a noise model that affect fault tolerant quantum computation on a single qubit P Iyer, MP da Silva, D Poulin APS Meeting Abstracts, 2016 | 2 | 2016 |
| Une analyse critique de la correction d’erreurs quantique pour du bruit réaliste PS Iyer Université de Sherbrooke, 2018 | 1 | 2018 |
| Complexité du décodage des codes stabilisateurs quantiques PI Sridharan Université de Sherbrooke, 2014 | | 2014 |
| Topological quantum computation using Majorana Fermions P Iyer | | |
David PoulinProfesseur de Physique, Université de SherbrookeVerified email at USherbrooke.ca
