Skip to content

Implementation and analysis of different DTQW schemes in Qiskit.

Notifications You must be signed in to change notification settings

QuantumVic/discrete-time-quantum-walks

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 
 
 

Repository files navigation

Discrete-Time Quantum Walks

License: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License

Douglas&Wang, Fujiwara schemes (Toffoli-based)

Number of qubits n, number of steps t and coin operator C can be chosen.

q0 is the coin operator, qubits [1, n-1] are used for encoding the nodes in the line.

The multi-controlled Toffoli gate mct integrated in Qiskit is used, needing O(n) auxiliary qubits, and using O(n) basic gates. Since a step of the QW needs O(n) such operations, the use of gates grows as O(n^2).


Total gate count of one QW step vs. number of qubits (coin + nodes).

Other implementations of the mct gate use O(n^2) gates without auxiliary qubits, making the total gate count grow as O(n^3).

Shakeel scheme (QFT-based)

Total gate count grows as O(n^2) with no need of auxiliary qubits.

About

Implementation and analysis of different DTQW schemes in Qiskit.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published