On the other hand, the past years have witnessed the rise of quantum computing both in terms of hardware development [1]}, [2]} and implementation of algorithms on such platforms [3]}, [4]}. In quantum computing [5]}, computations are carried over the equivalent of bits called qubits, which notoriously can handle information in a non-binary state thanks to a property of quantum systems called superposition [6]}. A quantum circuit is a series of operations applied to qubits that change their state, e.g. by changing their relative phase or angles in the quantum Hilbert space. Qubits can be represented geometrically with a so called Bloch sphere [6]}, so an operation onto a qubit corresponds to a rotation of the quantum state vector in this virtual space. One key concept of quantum algorithms is that, because of the intrinsic nature of qubits [6]}, certain calculations can be carried out with smaller complexity compared to the classical equivalent (this property is known as super-polynomial speedup [5]}, [10]}, [11]}). This is especially true in the case of chemistry, where quantum algorithms are used to predict electronic structures [12]}, ground-state energies[13]}, and the spatial configuration of proteins [14]}. In fact, quantum computers are extremely efficient in cases where CPUs may take — literally — forever, such as in the simulation of the Ferredoxin molecule [15]}.
