Dominik Hangleiter

Blind calibration of a quantum computer

Liam M. Jeanette [1,2], Jadwiga Wilkens [3], Ingo Roth [4], Anton Than [1], Alaina M. Green [1], Dominik Hangleiter [5,6,7], Norbert M. Linke [2,1]

Abstract

The calibration of quantum measurements is limited by the ability to accurately prepare quantum states under unknown device errors. We develop an accurate calibration protocol for the measurement apparatus of a quantum computer that is `blind' to the state preparation. Blind calibration quantifies and corrects measurement errors from simple tomographic data on a noisy quantum state. Importantly, it calibrates multiple error mechanisms in a single experiment, eliminating the need for bespoke, separate calibration experiments. Using a trapped-ion quantum computer, we systematically demonstrate the accuracy of the method. We use blind calibration to estimate the native calibration parameters of the experimental system. The recovered calibrations are consistent with directly measured values and perform similarly in predicting the state properties.

Verifiable measurement-based quantum random sampling with trapped ions

Martin Ringbauer [1], Marcel Hinsche [2], Thomas Feldker [1,3], Paul K. Faehrmann [2], Juani Bermejo-Vega [2,4,5], Claire Edmunds [1], Lukas Postler [1], Roman Stricker [1], Christian D. Marciniak [1], Michael Meth [1], Ivan Pogorelov [1], Rainer Blatt [1,3,6], Philipp Schindler [1], Jens Eisert [2,7,8], Thomas Monz [1,3], Dominik Hangleiter [9,10]

Abstract

Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. However, existing tools for verifying that a quantum device indeed performed the classically intractable sampling task are either impractical or not scalable to the quantum advantage regime. The verification problem thus remains an outstanding challenge. Here, we experimentally demonstrate efficiently verifiable quantum random sampling in the measurement-based model of quantum computation on a trapped-ion quantum processor. We create and sample from random cluster states, which are at the heart of measurement-based computing, up to a size of 4 x 4 qubits. By exploiting the structure of these states, we are able to recycle qubits during the computation to sample from entangled cluster states that are larger than the qubit register. We then efficiently estimate the fidelity to verify the prepared states -- in single instances and on average -- and compare our results to cross-entropy benchmarking. Finally, we study the effect of experimental noise on the certificates. Our results and techniques provide a feasible path toward a verified demonstration of a quantum advantage.

Boson Sampling for Generalized Bosons

En-Jui Kuo [1,2], Yijia Xu [1,2,3], Dominik Hangleiter [2], Andrey Grankin [1], Mohammad Hafezi [1,2]

Abstract

We introduce the notion of "generalized bosons" whose exchange statistics resemble those of bosons, but the local bosonic commutator $[a_i,a_i^\dagger]=1$ is replaced by an arbitrary single-mode operator that is diagonal in the generalized Fock basis. Examples of generalized bosons include boson pairs and spins. We consider the analogue of the boson sampling task for these particles and observe that its output probabilities are still given by permanents, so that the results regarding hardness of sampling directly carry over. Finally, we propose implementations of generalized boson sampling in circuit-QED and ion-trap platforms.

Semi-device-dependent blind quantum tomography

Ingo Roth [1,2], Jadwiga Wilkens [1,2], Dominik Hangleiter [3,2], Jens Eisert [2,4]

Abstract

Extracting tomographic information about quantum states is a crucial task in the quest towards devising high-precision quantum devices. Current schemes typically require measurement devices for tomography that are a priori calibrated to high precision. Ironically, the accuracy of the measurement calibration is fundamentally limited by the accuracy of state preparation, establishing a vicious cycle. Here, we prove that this cycle can be broken and the dependence on the measurement device's calibration significantly relaxed. We show that exploiting the natural low-rank structure of quantum states of interest suffices to arrive at a highly scalable `blind' tomography scheme with a classically efficient post-processing algorithm. We further improve the efficiency of our scheme by making use of the sparse structure of the calibrations. This is achieved by relaxing the blind quantum tomography problem to the de-mixing of a sparse sum of low-rank matrices. We prove that the proposed algorithm recovers a low-rank quantum state and the calibration provided that the measurement model exhibits a restricted isometry property. For generic measurements, we show that it requires a close-to-optimal number of measurement settings. Complementing these conceptual and mathematical insights, we numerically demonstrate that robust blind quantum tomography is possible in a practical setting inspired by an implementation of trapped ions.