428 citations · 1.9k across the 46 of their papers we have counts for
47 papers
Fast Hamiltonian engineering from cut polytope geometry
Thomas Joachim Friese, Özgün Kum, Aram W. Harrow +1
Hamiltonian engineering (HE) simulates quantum dynamics under a target Hamiltonian using a native entangling system Hamiltonian and restricted control, with applications from quant…
Fermionic Hamiltonian engineering with local control
Özgün Kum, Matthias Zipper, Ludwig Mathey +1
Quantum simulators enable the exploration of complex quantum phenomena in condensed-matter systems by reproducing their dynamics on controllable quantum devices. However, experimen…
Scalable Determination of Penalization Weights for Constrained Optimizations on Approximate Solvers
Edoardo Alessandroni, Sergi Ramos-Calderer, Michel Krispin +7
Quadratic unconstrained binary optimization (QUBO) provides problem formulations for various computational problems that can be solved with dedicated QUBO solvers, based on classic…
A comprehensive benchmark of an Ising machine on the Max-Cut problem
Salwa Shaglel, Markus Kirsch, Marten Winkler +4
QUBO formulations of combinatorial optimization problems allow for solving them using various quantum heuristics. While large-scale quantum computations are currently still out of…
Compensating connectivity restrictions in quantum annealers via splitting and linearization techniques
Marcel Seelbach Benkner, Zorah Lähner, Vladislav Golyanik +2
Current quantum annealing experiments often suffer from restrictions in connectivity in the sense that only certain qubits can be coupled to each other. The most common strategy to…
Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information
Alexander Gresch, Uğur Tepe, Martin Kliesch
We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition. For various quantum algorithms, in particular in the…
Sound certification of memory-bounded quantum computers
Jan Nöller, Nikolai Miklin, Martin Kliesch +1
The rapid advancement of quantum hardware calls for the development of reliable methods to certify its correct functioning. However, existing certification tests often fall short:…
On Computational Complexity of Unitary and State Design Properties
Yoshifumi Nakata, Yuki Takeuchi, Martin Kliesch +1
We investigate unitary and state -designs from a computational complexity perspective. First, we address the problems of computing frame potentials that characterize (approximat…
Shot-noise reduction for lattice Hamiltonians
Timo Eckstein, Refik Mansuroglu, Stefan Wolf +4
Efficiently estimating energy expectation values of quantum lattice systems on quantum computers is a crucial subroutine for various quantum algorithms, which can lead to significa…
General, efficient, and robust Hamiltonian engineering
Pascal Baßler, Markus Heinrich, Martin Kliesch
Implementing the time evolution under a desired target Hamiltonian is critical for various applications in quantum science. Due to the exponential increase in the number of paramet…
Bosonic randomized benchmarking with passive transformations
Mirko Arienzo, Dmitry Grinko, Martin Kliesch +1
Randomized benchmarking (RB) is the most commonly employed protocol for the characterization of unitary operations in quantum circuits due to its reasonable experimental requiremen…
Classical certification of quantum gates under the dimension assumption
Jan Nöller, Nikolai Miklin, Martin Kliesch +1
The rapid advancement of quantum hardware necessitates the development of reliable methods to certify its correct functioning. However, existing certification tests fall short, as…
Stability of classical shadows under gate-dependent noise
Raphael Brieger, Markus Heinrich, Ingo Roth +1
Expectation values of observables are routinely estimated using so-called classical shadows$\unicode{x2014}$the outcomes of randomized bases measurements on a repeatedly prepared q…
Time-optimal multi-qubit gates: Complexity, efficient heuristic and gate-time bounds
Pascal Baßler, Markus Heinrich, Martin Kliesch
Multi-qubit entangling interactions arise naturally in several quantum computing platforms and promise advantages over traditional two-qubit gates. In particular, a fixed multi-qub…
Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping
Alexander Gresch, Martin Kliesch
Estimation of the energy of quantum many-body systems is a paradigmatic task in various research fields. In particular, efficient energy estimation may be crucial in achieving a qu…
Randomized benchmarking with random quantum circuits
Markus Heinrich, Martin Kliesch, Ingo Roth
In its many variants, randomized benchmarking (RB) is a broadly used technique for assessing the quality of gate implementations on quantum computers. A detailed theoretical unders…
Optimizing the depth of variational quantum algorithms is strongly QCMA-hard to approximate
Lennart Bittel, Sevag Gharibian, Martin Kliesch
Variational Quantum Algorithms (VQAs), such as the Quantum Approximate Optimization Algorithm (QAOA) of [Farhi, Goldstone, Gutmann, 2014], have seen intense study towards near-term…
Closed-form analytic expressions for shadow estimation with brickwork circuits
Mirko Arienzo, Markus Heinrich, Ingo Roth +1
Properties of quantum systems can be estimated using classical shadows, which implement measurements based on random ensembles of unitaries. Originally derived for global Clifford…
Fast gradient estimation for variational quantum algorithms
Lennart Bittel, Jens Watty, Martin Kliesch
Many optimization methods for training variational quantum algorithms are based on estimating gradients of the cost function. Due to the statistical nature of quantum measurements,…
Learning logical Pauli noise in quantum error correction
Thomas Wagner, Hermann Kampermann, Dagmar Bruß +1
The characterization of quantum devices is crucial for their practical implementation but can be costly in experimental effort and classical postprocessing. Therefore, it is desira…
Synthesis of and compilation with time-optimal multi-qubit gates
Pascal Baßler, Matthias Zipper, Christopher Cedzich +4
We develop a method to synthesize a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. The only…
Distance-based resource quantification for sets of quantum measurements
Lucas Tendick, Martin Kliesch, Hermann Kampermann +1
The advantage that quantum systems provide for certain quantum information processing tasks over their classical counterparts can be quantified within the general framework of reso…
Scalable approach to many-body localization via quantum data
Alexander Gresch, Lennart Bittel, Martin Kliesch
We are interested in how quantum data can allow for practical solutions to otherwise difficult computational problems. A notoriously difficult phenomenon from quantum many-body phy…
Compressive gate set tomography
Raphael Brieger, Ingo Roth, Martin Kliesch
Flexible characterization techniques that identify and quantify experimental imperfections under realistic assumptions are crucial for the development of quantum computers. Gate se…