In words of Wikipedia,
The Curry–Howard correspondence is the observation that two families of seemingly unrelated formalisms—namely, the proof systems on one hand, and the models of computation on the other—are in fact the same kind of mathematical objects [...] a proof is a program, and the formula it proves is the type for the program.
Further, under General Formulation, it provides the following table and the statement that bears my question:
In its more general formulation, the Curry–Howard correspondence is a correspondence between formal proof calculi and type systems for models of computation. In particular, it splits into two correspondences. One at the level of formulas and types that is independent of which particular proof system or model of computation is considered, and one at the level of proofs and programs which, this time, is specific to the particular choice of proof system and model of computation considered.
Is quantum computing in this hindsight equivalent to classical computing, or is it a different "model of computation" (i.e. does it have a different set of elements in the Programming side)? Would it still correspond to the exact same Logic side?