Estimating Fidelity Lower Bounds of Quantum Subroutines

Karl Mayer, Charlie Baldwin · 2023

We define scalable benchmarks for two important quantum subroutines, namely the quantum Fourier transform (QFT) and the multi-controlled-Z gate. Our benchmarks are based on applying the subroutines to a set of states that are sufficient for lower-bounding the process fidelity from the set of measured output state fidelities. By randomly sampling from the set of input states, the lower boundonthe process fidelity can be estimated. We implement the QFT and multi-controlled-Z circuits with up to 20 and 12 qubits, respectively, on the Quantinuum H1-1 quantum computer. Our circuits make use of parameterized-angle entangling gates, which for these circuits reduces the number of two-qubit gates significantly.

Read the paper · More papers on PaperTik