112 citations · 255 across the 10 of their papers we have counts for
10 papers
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…
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…
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…
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…
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…
The axiomatic and the operational approaches to resource theories of magic do not coincide
Arne Heimendahl, Markus Heinrich, David Gross
Stabiliser operations occupy a prominent role in fault-tolerant quantum computing. They are defined operationally: by the use of Clifford gates, Pauli measurements and classical co…
Efficient unitary designs with a system-size independent number of non-Clifford gates
Jonas Haferkamp, Felipe Montealegre-Mora, Markus Heinrich +3
Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full -q…
Robustness of Magic and Symmetries of the Stabiliser Polytope
Markus Heinrich, David Gross
We give a new algorithm for computing the robustness of magic - a measure of the utility of quantum states as a computational resource. Our work is motivated by the magic state mod…