Institute for Quantum Inspired and Quantum Optimization

2024

• Nakata, Yoshifumi; Takeuch, Yuki; Kliesch, Martin; Darmawan, Andrew
  On computational complexity of unitary and state design properties
  Quantum Physics: 2410.23353v1 (2024-10-30)
  Publisher DOI
• Baßler, Pascal; Heinrich, Markus; Kliesch, Martin
  Efficient Hamiltonian engineering
  arxiv: 2410.19903v1 (2024)
  Publisher DOI
• Cembrano, Javier; Griesbach, Svenja Marie; Stahlberg, Maximilian
  Deterministic impartial selection with weights
  ACM Transactions on Economics and Computation 12 (3): 10 (2024-09-06)
  Open Access | Publisher DOI
• Arienzo, Mirko; Grinko, Dmitry; Kliesch, Martin; Heinrich, Markus
  Bosonic randomized benchmarking with passive transformations
  arxiv: 2408.11111v1 (2024)
  Publisher DOI
• Baßler, Pascal; Heinrich, Markus; Kliesch, Martin
  Time-optimal multi-qubit gates : complexity, efficient heuristic and gate-time bounds
  Quantum 8: 1279 (2024)
  Open Access | Publisher DOI
• Nöller, Jan; Miklin, Nikolai; Kliesch, Martin; Gachechiladze, Mariami
  Classical certification of quantum computation under the dimension assumption
  arXiv: 2401.17006 (2024)
  Publisher DOI

2023

• Farkas, Máté; Miklin, Nikolai; Tavakoli, Armin
  Simple and general bounds on quantum random access codes
  arXiv: 2312.14142 (2023)
  Publisher DOI
• Brieger, Raphael; Heinrich, Markus; Roth, Ingo; Kliesch, Martin
  Stability of classical shadows under gate-dependent noise
  arXiv: 2310.19947 (2023)
  Publisher DOI
• Arienzo, Mirko; Heinrich, Markus; Roth, Ingo; Kliesch, Martin
  Closed-form analytic expressions for shadow estimation with brickwork circuits
  Quantum Information and Computation 23 (11-12): 961-993 (2023-09)
  Publisher DOI
• Jain, Prabhav; Gachechiladze, Mariami; Miklin, Nikolai
  Information causality as a tool for bounding the set of quantum correlations
  arXiv: 2308.02478 (2023)
  Open Access | Publisher DOI
• Baßler, Pascal; Heinrich, Markus; Kliesch, Martin
  Time-optimal multi-qubit gates : complexity, efficient heuristic and gate-time bounds
  arXiv: 2307.11160 (2023)
  Publisher DOI
• Bittel, Lennart; Gharibian, Sevag; Kliesch, Martin
  Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate
  Computational Complexity Conference (CCC 2023)
  Publisher DOI
• Wagner, Thomas; Kampermann, Hermann; Bruß, Dagmar; Kliesch, Martin
  Learning logical quantum noise in quantum error correction
  Physical Review Letters 130 (20): 200601 (2023-05-19)
  Publisher DOI
• Tendick, Lucas; Kliesch, Martin; Kampermann, Hermann; Bruß, Dagmar
  Distance-based resource quantification for sets of quantum measurements
  Quantum 7: 1003 (2023)
  Publisher DOI
• Brieger, Raphael; Roth, Ingo; Kliesch, Martin
  Compressive gate set tomography
  PRX Quantum 4 (1): 010325 (2023-03)
  Open Access | Publisher DOI
• Gresch, Alexander; Kliesch, Martin
  Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping
  arXiv: 2301.03385 (2023)
  Publisher DOI
• Baßler, Pascal; Zipper, Matthias; Cedzich, Christopher; Heinrich, Markus; Huber, Patrick; Johanning, Michael; Kliesch, Martin
  Synthesis of and compilation with time-optimal multi-qubit gates
  Quantum 7: 984 (2023)
  Publisher DOI

2022

• Heinrich, Markus; Kliesch, Martin; Roth, Ingo
  General guarantees for randomized benchmarking with random quantum circuits
  arXiv:2212.06181 (2022)
  Publisher DOI