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

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.

Cited by in corpus (4)

• Universal programmable photonic architecture for quantum information processing
• Special Session: Noisy Intermediate-Scale Quantum (NISQ) Computers -- How They Work, How They Fail, How to Test Them?
• Tsallis relative $\alpha$ entropy of coherence dynamics in Grover's search algorithm
• ArsoNISQ: Analyzing Quantum Algorithms on Near-Term Architectures