# What all parameters can we take into account when comparing different quantum programming languages

I am planning to write a paper which compares Qiskit and Q# in the following circuits/algorithms

• Bell circuits

• Controlled swap to test similarity of two registers

• Phase kickback between two qubits

• Deutsch-Jozsa algorithm

• Grovers algorithm

• Simons algorithm

• Shors algorithm (slightly advanced for me)

What all parameters apart from time and space complexity can I take to compare these languages

• As @Chris Granade already said in his answer, such comparison will have very limited value. Instead, consider using the things that have impact on developer experience such as: simulators performance, available debugging options, quality of documentation, community size, ..etc. – Egretta.Thula Mar 15 at 9:26

Just as with classical computing, we don't expect that in quantum computing the choice of a programming language will have a direct effect on the time and space complexity of most algorithms. That is, while C, Python, Rust, and Swift are all very different programming languages, quicksort is a $$O(n \ln n)$$ algorithm in all of them. Rather, classical languages tend to be compared on the basis of whether they are low-level or high-level, how easy they are to work with, what safety they provide the programmer (e.g.: it's more difficult to segfault in Python or Rust than in C), and so forth.