Quantum outperforms classical supercomputers in approximate optimisation problems
Credit: 3d_kot/Shutterstock
Researchers from new study from University of South Carolina found that quantum annealing could offer a computational edge over classical supercomputers in solving certain types of optimization problems—specifically when near-optimal rather than exact solutions are acceptable.
Register for FREE to keep reading
Join 12,000+ scientists, engineers, and IT professionals driving innovation through informatics, HPC, and simulation with:
- Insights into HPC, AI, lab informatics & data
- Curated content for life sciences, engineering & academia
- Access to Breakthroughs: real-world computing success
- Free reports & panels, including the Lab Informatics Guide
- White Papers & software updates for smarter research
Sign up now
Already a member? Log in here
Your data is protected under our privacy policy.
