All publications of all group members are on the Arxiv:
Martin Kliesch, Christopher Cedzich, Markus Heinrich, Nikolai Miklin, ...
With some delay they might also be listed below.
2025
-
Stability of Classical Shadows under Gate-Dependent Noise
Physical review letters 134: 090801 (2025)
Publisher DOI -
Simple and general bounds on quantum random access codes
Quantum 9: 1643 (2025)
Open Access | Publisher DOI -
Influence of disorder at insulator-metal interface on spin transport
Physical Review B 111 (5): 054414 (2025)
Publisher DOI -
Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information
arXiv: 2502.01730 (2025)
Open Access | Publisher DOI -
Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping
Nature communications 16: 689 (2025)
Open Access | Publisher DOI -
Solving an industrially relevant quantum chemistry problem on quantum hardware
Quantum science and technology 10 (1): 015066 (2025)
Open Access | Publisher DOI
2024
-
On computational complexity of unitary and state design properties
arXiv:2410.23353 (2024)
Open Access | Publisher DOI -
Efficient Hamiltonian engineering
arXiv: 2410.19903 (2024)
Open Access | Publisher DOI -
Information causality as a tool for bounding the set of quantum correlations
Physical Review Letters 133 (16): 160201 (2024)
Publisher DOI -
Deterministic impartial selection with weights
ACM Transactions on Economics and Computation 12 (3): 10 (2024)
Open Access | Publisher DOI -
Quantum-inspired computing in civil engineering – Opportunities, challenges, and visions
European Conference on Product and Process Modeling, ECPPM 2024
-
Bosonic randomized benchmarking with passive transformations
arXiv: 2408.11111 (2024)
Publisher DOI -
Time-optimal multi-qubit gates : complexity, efficient heuristic and gate-time bounds
Quantum 8: 1279 (2024)
Open Access | Publisher DOI -
Classical certification of quantum computation under the dimension assumption
arXiv: 2401.17006 (2024)
Publisher DOI
2023
-
Simple and general bounds on quantum random access codes
arXiv: 2312.14142 (2023)
Open Access | Publisher DOI -
Stability of classical shadows under gate-dependent noise
arXiv: 2310.19947 (2023)
Publisher DOI -
Closed-form analytic expressions for shadow estimation with brickwork circuits
Quantum Information and Computation 23 (11-12): 961-993 (2023-09)
Publisher DOI -
Information causality as a tool for bounding the set of quantum correlations
arXiv: 2308.02478 (2023)
Open Access | Publisher DOI -
Time-optimal multi-qubit gates : complexity, efficient heuristic and gate-time bounds
arXiv: 2307.11160 (2023)
Open Access | Publisher DOI -
Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate
38th Computational Complexity Conference (CCC 2023)
Open Access | Publisher DOI -
Learning logical quantum noise in quantum error correction
Physical Review Letters 130 (20): 200601 (2023-05-19)
Publisher DOI -
Distance-based resource quantification for sets of quantum measurements
Quantum 7: 1003 (2023)
Open Access | Publisher DOI -
Synthesis of and compilation with time-optimal multi-qubit gates
Quantum 7: 984 (2023)
Open Access | Publisher DOI -
Compressive gate set tomography
PRX Quantum 4 (1): 010325 (2023-03)
Open Access | Publisher DOI -
Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping
arXiv: 2301.03385 (2023)
Publisher DOI
2022
-
General guarantees for randomized benchmarking with random quantum circuits
arXiv: 2212.06181 (2022)
Publisher DOI