✨Map scf.for operations by restoration using the 4-approximation token swap algorithm

[MatthiasReumann]

Changes

• ✨Add functionality to handle operation with nested operations.
• ✨ Implement the 4-Approximation Algorithm described in arXiv:1602.05150v3.
• ✨Add two unit tests for quantum programs using scf.for operations and one unrolling unit test.
• 📝 Use LLVM codebase style function description (consistent with the IRVerifier and some other parts of the cc).
• 🚛 Move Layout class to separate file.

Checklist

• The pull request only contains commits that are focused and relevant to this change.
• I have added appropriate tests that cover the new/changed functionality.
• I have updated the documentation to reflect these changes.
• I have added entries to the changelog for any noteworthy additions, changes, fixes, or removals.
• I have added migration instructions to the upgrade guide (if needed).
• The changes follow the project's style guidelines and introduce no new warnings.
• The changes are fully tested and pass the CI checks.
• I have reviewed my own code changes.

If PR contains AI-assisted content:

• I have disclosed the use of AI tools in the PR description as per our AI Usage Guidelines.
• AI-assisted commits include an Assisted-by: [Model Name] via [Tool Name] footer.
• I confirm that I have personally reviewed and understood all AI-generated content, and accept full responsibility for it.