# David Sutter

Office: IBM Research Rüschlikon

E-mail: dsu@zurich.ibm.com

I am a Staff Research Scientist at IBM Research working on quantum computing and quantum information theory.

I obtained my PhD degree from the Institute for Theoretical Physics at ETH Zurich under the supervision of Renato Renner. My thesis can be found here.

I am the author of the book "Approximate Quantum Markov Chains" published by SpringerBriefs in Mathematical Physics

Curriculum vitae [pdf]

News

Follow up work on the effective dimension [arXiv]

How to cut arbitrary two-qubit gates [arXiv]

Optimal wire cutting of quantum circuits [arXiv]

Awards

Annals Henri Poincaré Prize 2018 [picture]

Thomas M. Cover Dissertation Award 2019 [picture]

ETH medal for outstanding doctoral thesis 2018 [picture]

Jack Keil Wolf Student Paper Award at ISIT 2016 [picture]

Jack Keil Wolf Student Paper Award finalist (shortlisted) at ISIT 2013

Publications and Preprints

See the arXiv and Google Scholar or see Publications

Selected Talks

"Circuit knitting with classical communication" TUM, 2022 and EPFL 2022 [video]

"Towards a quantum advantage in machine learning", Math Colloquium, Trento, 2022 [video]

"Approximate quantum Markov chains", ICMP, Geneva, 2021 [pdf, video]

"Error mitigation for universal gates on encoded qubits", Pasadena, 2021

"The power of quantum neural networks", Cambridge, 2021, Amsterdam, 2021, QML_meetup, 2021 [video]

"Quantum Legendre-Fenchel transform", Informs, 2020

"Quantum Brascamp-Lieb dualities", Beyond iid, 2020 [pdf] [zoom]

"A chain rule for the quantum relative entropy", TUM, 2019 [pdf], IPAM, 2021 [video], Tübingen 2021

"Quantum information theory", IBM Research, 2019 [pdf] and EPFL, 2019 [pdf]

"A new approach to prove entropy inequalities", Cambridge, 2019 [pdf]

"Generalized maximum entropy estimation", Imperial College, 2019 [pdf]

"Approximate quantum Markov chains", PhD defense, ETH Zurich, 2018 [pdf]

"Approximate quantum Markov chains", University of Waterloo, 2017 [pdf]

"Logarithmic trace inequalities and approximate quantum Markov chains", ISIT, 2017 [pdf]

"Strenghtened monotonicity of relative entropy via pinched Petz recovery map", ISIT, 2016 [pdf]

"Multivariate trace inequalities", QIP, 2017, Stanford 2016, Caltech, 2016, Beyond iid 2016, and IFA, ETH, Zurich, 2016 [pdf] [QIP talk]

"Universal recoverability in quantum information theory", QIP 2016, MIT 2016, GBMS 2015 [pdf] [QIP talk (part I)] [QIP talk (part II)]

"Approximate degradable quantum channels", QIP 2016, Beyond iid 2015, ISIT 2015, ICITS 2015 [pdf] [talk beyond iid] [QIP talk (part I)] [QIP talk (part I)]

"Alignment of polarized sets", ISIT 2015, ICITS 2015 [pdf]

"Efficient approximation of quantum channel capacities", Delft 2015

"Efficient approximation of discrete memoryless channel capacities", ISIT 2014 [pdf]

"Universal polar codes for more capable and less noisy channels and sources, ISIT 2014 [pdf]

"Efficient secret key distillation over quantum channels", QCrypt 2014, ISIT 2013 [pdf]

"Efficient one-way secret-key agreement and private channel coding via polarization", ASIACRYPT 2013 [pdf]

"Achieving the capacity of any DMC using only polar codes", ITW 2012