Regensburg 2022 – scientific programme

Parts | Days | Selection | Search | Updates | Downloads | Help

QI: Fachverband Quanteninformation

QI 12: Quantum Computing and Algorithms

QI 12.9: Talk

Thursday, September 8, 2022, 17:15–17:30, H8

Preparation of Hardware-Efficient Graph States on IBM QX — •Sebastian Brandhofer¹, Jelena Mackeprang², Daniel Bhatti², Ilia Polian¹, and Stefanie Barz² — ¹Institute of Computer Architecture and Computer Engineering & IQST, University of Stuttgart, Germany — ²Institute for Functional Matter and Quantum Technologies & IQST, University of Stuttgart, Germany

Near-term quantum computers are characterized by heterogeneous errors that occur at a high rate, a short decoherence time, and a limited number of qubits. Preparing a quantum state on these near-term quantum computers must be performed with these limitations in mind. Especially, when preparing highly entangled multi-qubit quantum states one would like to reach quantum state fidelities as high as possible. For this, the quantum state preparation algorithm needs to be adapted to the specific quantum hardware and the respective limitations. In this work, a method is proposed for determining the optimal preparation algorithm of a specific class of graph states. The proposed method is based on one of the winning submissions to the 2020 IBM Quantum's Open Science Prize - Graph State Challenge.