Simulating Quantum Algorithms Using Fidelity and Coherence Time as Principle Models for Error

TL;DR

This paper investigates how fidelity and coherence time influence the success of quantum algorithms by simulating their performance within realistic connectivity and error models, providing benchmarks for reliable quantum computation.

Contribution

It introduces a realistic connectivity model and simulates key quantum algorithms to analyze the effects of fidelity and coherence times on their success.

Findings

Identifies benchmark values for fidelity and coherence times for reliable algorithm success

Demonstrates the impact of connectivity geometry on quantum algorithm performance

Provides simulation results linking error parameters to algorithm success rates

Abstract

As various quantum computing technologies continue to compete for quantum supremacy, several parameters have emerged as benchmarks for the quality of qubits. These include fidelity, coherence times, connectivity, and a few others. In this paper, we aim to study the importance of these parameters and their impact on quantum algorithms. We propose a realistic connectivity geometry and form quantum circuits for the Bernstein-Vazirani, QFT, and Grover Algorithms based on the limitations of the chosen geometry. We then simulate these algorithms using error models to study the impact of gate fidelity and coherence times on success of the algorithms. We report on the findings of our simulations and note the various benchmarking values which produce reliably successful results.