GitHub

02_Deutsch_Jozsa_Algorithm.py

Consider a function f(x) that takes as input n-bit strings x and returns 0 or 1. Suppose we are promised that f(x) is either a constant function that takes the same value c in {0,1} on all inputs x, ...
GitHub

1.1 classical_dj_benchmarks.py

# Scalability = growth of runtime as N increases (digits/bits). # Reliability = success rate + dispersion across repetitions. # Carbon footprints = derived *only* from PERFORMANCE totals # (sum of ...
IEEE

Deutsch-Jozsa and Bernstein-Vazirani algorithm using single-particle discrete-time quantum walk

Abstract: The paper introduces an efficient implementation of the Deutsch-Jozsa and Bernstein-Vazirani algorithm using the single-particle discrete-time quantum walk. We also provide a detailed ...
IEEE

Error Rate Increment of Quantum Computer using Quantity Computational Algorithm Comparing with Deutsch Jozsa Algorithm

Abstract: the primary purpose is to investigate the possibility of utilizing quantum algorithms in order to improve the error rate of quantum computing devices. The ...