Skip to main content
qutalent.org
  • Home
  • Courses
  • Videos
  • Programs
  • Blogs
  • About Us
  • NQCH
  • Contact
  • Tools
  • You are here:
  • Home
  • Videos
  • Travelling Salesman Problem

Videos

BeginnerSoftware DeveloperInvestorEveryoneQuantum Landscape

Travelling Salesman Problem

blog post cover image
What is the shortest possible route that visits each city exactly once and returns to the origin city?

Credits and Attributions

Video production - Han Rui, Jibo Dai and Wai Yee Jason Ku.

Stock images and icons are taken from freepik.com.

Related

Quantum AlgorithmInvestor

Portfolio Optimization as a QUBO Problem

Quantum AlgorithmInvestor

Quantum-Accelerated Monte-Carlo Methods

Quantum AlgorithmInvestor

Overview of Quantum Computational Finance

Other Related Categories

BeginnerIntermediateAdvancedEveryoneQuantum MechanicsQuantum InformationQuantum AlgorithmQuantum CommunicationQuantum LandscapeBeyond QuantumPhysicistEducatorSoftware DeveloperInvestorCurious Mind

Learn
  • Courses
  • Videos
  • Programs
About
  • NQCH
  • Quantum Talent
  • Contact
Policies
  • Privacy Policy
  • Terms of Use
YouTubeLinkedin
© 2023 National Quantum Computing Hub. All rights reserved | Solution by ABC Online Courses