Quantum Computing, Photonics, Quantum Physics, Quantum, Quantum Algorithms.
application development process in both models. The maximum clique problem was chosen because it is a well known NP-Hard [1] problem that can potentially be solved in both environments. In this case, these two environments are Qiskit and Strawberry Fields. A clique is a fully connected subgraph.