default search action
Martin Kliesch
Person information
- affiliation: Hamburg University of Technology, Institute for Quantum-Inspired and Quantum Optimization, Germany
- affiliation: Heinrich Heine University of Düsseldorf, Institute for Theoretical Physics, Germany
- affiliation: University of Gdańsk, Institute of Theoretical Physics and Astrophysics, Gdańsk, Poland
- affiliation: University of Cologne, Institute for Theoretical Physics, Germany
- affiliation (PhD 2015): Free University of Berlin, Department of Physics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Pascal Baßler, Markus Heinrich, Martin Kliesch:
Time-optimal multi-qubit gates: Complexity, efficient heuristic and gate-time bounds. Quantum 8: 1279 (2024) - 2023
- [j8]Mirko Arienzo, Markus Heinrich, Ingo Roth, Martin Kliesch:
Closed-form analytic expressions for shadow estimation with brickwork circuits. Quantum Inf. Comput. 23(11&12): 961-993 (2023) - [j7]Pascal Baßler, Matthias Zipper, Christopher Cedzich, Markus Heinrich, Patrick H. Huber, Michael Johanning, Martin Kliesch:
Synthesis of and compilation with time-optimal multi-qubit gates. Quantum 7: 984 (2023) - [j6]Lucas Tendick, Martin Kliesch, Hermann Kampermann, Dagmar Bruß:
Distance-based resource quantification for sets of quantum measurements. Quantum 7: 1003 (2023) - [c1]Lennart Bittel, Sevag Gharibian, Martin Kliesch:
The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. CCC 2023: 34:1-34:24 - 2022
- [j5]Thomas Wagner, Hermann Kampermann, Dagmar Bruß, Martin Kliesch:
Pauli channels can be estimated from syndrome measurements in quantum error correction. Quantum 6: 809 (2022) - [i10]Alexander Gresch, Lennart Bittel, Martin Kliesch:
Scalable approach to many-body localization via quantum data. CoRR abs/2202.08853 (2022) - [i9]Lennart Bittel, Sevag Gharibian, Martin Kliesch:
Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate. CoRR abs/2211.12519 (2022) - 2020
- [j4]Ingo Roth
, Martin Kliesch
Reliable Recovery of Hierarchically Sparse Signals for Gaussian and Kronecker Product Measurements. IEEE Trans. Signal Process. 68: 4002-4016 (2020)
2010 – 2019
- 2019
- [j3]Martin Kliesch, Stanislaw J. Szarek
Simultaneous Structures in Convex Signal Recovery - Revisiting the Convex Combination of Norms. Frontiers Appl. Math. Stat. 5: 23 (2019) - [i8]Martin Kliesch, Stanislaw J. Szarek, Peter Jung:
Simultaneous structures in convex signal recovery - revisiting the convex combination of norms. CoRR abs/1904.07893 (2019) - 2018
- [j2]Ulrich Michel
Comments on "Improving Compressed Sensing With the Diamond Norm"-Saturation of the Norm Inequalities Between Diamond and Nuclear Norm. IEEE Trans. Inf. Theory 64(11): 7443-7445 (2018) - [i7]Ingo Roth, Richard Kueng, Shelby Kimmel, Yi-Kai Liu, David Gross, Jens Eisert, Martin Kliesch:
Recovering quantum gates from few average gate fidelities. CoRR abs/1803.00572 (2018) - 2017
- [i6]Martin Kliesch, Richard Kueng, Jens Eisert, David Gross:
Guaranteed recovery of quantum processes from few measurements. CoRR abs/1701.03135 (2017) - 2016
- [j1]Martin Kliesch
Improving Compressed Sensing With the Diamond Norm. IEEE Trans. Inf. Theory 62(12): 7445-7463 (2016) - [i5]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, Valerio Cambareri, Cecile Chenot, Vladimir S. Crnojevic, Marie Danková, Kévin Degraux, Jens Eisert, Mohamed-Jalal Fadili, Marylou Gabrié, Nicolas Gac, Daniele Giacobello, Carlos A. Gomez Gonzalez, Adriana Gonzalez, Pierre-Yves Gousenbourger, Mads Græsbøll Christensen, Rémi Gribonval, Stéphanie Guérit, Shaoguang Huang, Paul Irofti, Laurent Jacques, Ulugbek S. Kamilov, Srdan Kitic, Martin Kliesch, Florent Krzakala, John A. Lee, Wenzhi Liao, Tobias Lindstrøm Jensen, Andre Manoel, Hassan Mansour, Ali Mohammad-Djafari, Amirafshar Moshtaghpour, Fred Maurice Ngolè Mboula, Benoît Pairet, Marko Panic, Gabriel Peyré, Aleksandra Pizurica, Pavel Rajmic, Matthieu Roblin, Ingo Roth, Anil Kumar Sao, Pulkit Sharma, Jean-Luc Starck, Eric W. Tramel, Toon van Waterschoot, Dejan Vukobratovic, Li Wang, Benedikt Wirth, Gerhard Wunder, Hongyan Zhang:
Proceedings of the third "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'16). CoRR abs/1609.04167 (2016) - [i4]Ingo Roth, Martin Kliesch, Gerhard Wunder, Jens Eisert:
Reliable recovery of hierarchically sparse signals and application in machine-type communications. CoRR abs/1612.07806 (2016) - [i3]Ulrich Michel, Martin Kliesch, Richard Kueng, David Gross:
Note on the saturation of the norm inequalities between diamond and nuclear norm. CoRR abs/1612.07931 (2016) - 2015
- [i2]Martin Kliesch, Richard Kueng, Jens Eisert, David Gross:
Improving compressed sensing with the diamond norm. CoRR abs/1511.01513 (2015) - 2013
- [i1]Christian Gogolin
Boson-Sampling in the light of sample complexity. CoRR abs/1306.3995 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: