Boson-Sampling in the light of sample complexity. - Christian Gogolin; Martin Kliesch; Leandro Aolita; Jens Eisert (CoRR, 2013)

Proceedings of the third "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'16). - Vinayak Abrol; Olivier Absil; Pierre-Antoine Absil; Sandrine Anthoine; Philippe Antoine; Thomas Arildsen; Nancy Bertin; Folkert Bleichrodt; Jérôme Bobin; Anne Bol; Antoine Bonnefoy; Francesco Caltagirone; et al. (CoRR, 2016)

Note on the saturation of the norm inequalities between diamond and nuclear norm. - Ulrich Michel; Martin Kliesch; Richard Kueng; David Gross 003 (CoRR, 2016)

Reliable recovery of hierarchically sparse signals and application in machine-type communications. - Ingo Roth; Martin Kliesch; Gerhard Wunder; Jens Eisert (CoRR, 2016)

Improving Compressed Sensing With the Diamond Norm. - Martin Kliesch; Richard Kueng; Jens Eisert; David Gross 003 (IEEE Trans. Inf. Theory, 2016)

Recovering quantum gates from few average gate fidelities. - Ingo Roth; Richard Kueng; Shelby Kimmel; Yi-Kai Liu 001; David Gross 003; Jens Eisert; Martin Kliesch (CoRR, 2018)

Comments on "Improving Compressed Sensing With the Diamond Norm"-Saturation of the Norm Inequalities Between Diamond and Nuclear Norm. - Ulrich Michel; Martin Kliesch; Richard Kueng; David Gross 003 (IEEE Trans. Inf. Theory, 2018)

Simultaneous Structures in Convex Signal Recovery - Revisiting the Convex Combination of Norms. - Martin Kliesch; Stanislaw J. Szarek; Peter Jung 001 (Frontiers Appl. Math. Stat., 2019)

Guaranteed recovery of quantum processes from few measurements. - Martin Kliesch; Richard Kueng; Jens Eisert; David Gross 003 (Quantum, 2019)

Reliable Recovery of Hierarchically Sparse Signals for Gaussian and Kronecker Product Measurements. - Ingo Roth; Martin Kliesch; Axel Flinth; Gerhard Wunder; Jens Eisert (IEEE Trans. Signal Process., 2020)

Scalable approach to many-body localization via quantum data. - Alexander Gresch; Lennart Bittel; Martin Kliesch (CoRR, 2022)

Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate. - Lennart Bittel; Sevag Gharibian; Martin Kliesch (CoRR, 2022)

Pauli channels can be estimated from syndrome measurements in quantum error correction. - Thomas Wagner; Hermann Kampermann; Dagmar Bruß; Martin Kliesch (Quantum, 2022)

The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. - Lennart Bittel; Sevag Gharibian; Martin Kliesch (CCC, 2023)

Synthesis of and compilation with time-optimal multi-qubit gates. - Pascal Baßler; Matthias Zipper; Christopher Cedzich; Markus Heinrich; Patrick H. Huber; Michael Johanning; Martin Kliesch (Quantum, 2023)

Distance-based resource quantification for sets of quantum measurements. - Lucas Tendick; Martin Kliesch; Hermann Kampermann; Dagmar Bruß (Quantum, 2023)

Closed-form analytic expressions for shadow estimation with brickwork circuits. - Mirko Arienzo; Markus Heinrich; Ingo Roth; Martin Kliesch (Quantum Inf. Comput., 2023)

Time-optimal multi-qubit gates: Complexity, efficient heuristic and gate-time bounds. - Pascal Baßler; Markus Heinrich; Martin Kliesch (Quantum, 2024)

Classical certification of quantum gates under the dimension assumption. - Jan Nöller; Nikolai Miklin; Martin Kliesch; Mariami Gachechiladze (Quantum, 2025)

A comprehensive benchmark of an Ising machine on the Max-Cut problem. - Salwa Shaglel; Markus Kirsch; Marten Winkler; Christian Münch; Stefan Walter; Fritz Schinkel; Martin Kliesch (CoRR, 2025)

Quantum and quantum-inspired computing in civil engineering. - Joern Ploennigs; Kay Smarsly; Markus Berger; Kosmas Dragos; Martin Kliesch (Adv. Eng. Informatics, 2026)