Details

The given work is devoted to investigating the potential of quantum annealing techniques, particularly Quantum-inspired Annealing, for solving the mode-mapping optimization problem in multi-mode fiber optical communication systems. The work begins with the Traveling Salesman Problem as a benchmarking scenario to validate the effectiveness of quantum annealing methods, followed by applying these insights specifically to multi-mode fiber mode transition optimization. Computational experiments compare Quantum-inspired Annealing with classical Simulated Annealing highlighting advantages, limitations, and future prospects of quantum optimization methods in complex optical communication scenarios.

• CONTENTS
• INTRODUCTION
• CHAPTER 1. LITERATURE REVIEW
  • 1.1 MMF Technology
    • 1.1.1 Rationale
    • 1.1.2 Research status
  • 1.2 Quantum Algorithm
    • 1.2.1 Rationale
    • 1.2.2 The Origin of Quantum Computing Methods
    • 1.2.3 Development of Quantum Computers and Quantum
    • 1.2.4 Research status of Quantum Annealing Algorit
  • 1.3 Summary
• CHAPTER 2. THE TRAVELING SALESMAN PROBLEM INSTANCE
  • 2.1 Problem Description
  • 2.2 Computational Experiments
    • 2.2.1 Solved using the Dynamic Programming Algorit
    • 2.2.2 Solved using the Genetic Algorithm
    • 2.2.3 Solved using the Simulated Annealing
    • 2.2.4 Solved using the Quantum-inspired Annealing
  • 2.3 Summary
• CHAPTER 3. MODE TRANSITION OPTIMIZATION IN MULTI-M
  • 3.1 Problem Description and Mathematical Modeling
  • Subsequently, ell Experiments
    • 3.2.1 Solved using the Simulated Annealing
    • 3.2.2 Solved using the Quantum-inspired Annealing
  • 3.3 Summary
• CONCLUSION
• REFERENCES