Quantum annealing has garnered attention for its potential to solve combinatorial optimization problems quickly. However, many combinatorial optimization problems include constraints such as selecting m items from n, which complicates balancing solution accuracy and speed. In this project, we developed a custom quantum annealing simulator that searches for solutions while consistently satisfying these constraints, and we applied and evaluated it on real-world problems.
Creator
Hayato Okada (Year: 2024 / Mentor: Kakeru Ishii)
Pitch
To show English subtitles:
Play video →↓
Click CC icon →↓
Click Settings →↓
Click Subtitles/CC →↓
Click Auto-translate →↓
Click English (or other language you prefer)
Play video →↓
Click CC icon →↓
Click Settings →↓
Click Subtitles/CC →↓
Click Auto-translate →↓
Click English (or other language you prefer)