Kipu Quantum announced successful testing of the BF-DCQO algorithm, designed to solve higher order problems in binary optimization, on the 156-cube IBM processor. The algorithm outperformed existing methods like Quantum Approximate Optimization Algorithm (QAOA) and quantum annealing.
The BF-DCQO algorithm was also tested on a 433-cube IBM OSPREY processor, showcasing its scalability for larger quantum systems. Researchers believe these results could signify the dawn of the commercial era of quantum superiority, where quantum calculations can tackle real-world problems in various industries.
In their publication on LinkedIn, Kipu Quantum highlighted the adaptability of the algorithm for more powerful quantum processors like IBM OSPREY, paving the way for further advancements in quantum computing.
The BF-DCQO algorithm, tested on a HeAVY-HEX architecture processor, demonstrated superior performance compared to classical and quantum methods. The algorithm’s ability to handle interactions up to three bodies in a spin glass model makes it ideal for architectures like Heavy-HEX.
Additionally, the algorithm excelled in solving the Weighted Max 3-SAT task, surpassing both classic algorithms and solutions from other companies like D-Wave. However, researchers acknowledge the need to address scalability and error correction issues in real-world quantum systems.
Kipu Quantum plans to further explore the capabilities of the BF-DCQO algorithm in solving complex industry problems and aims to integrate it into larger quantum processors like IBM OSPREY. The research was led by scientists from Kipu Quantum GmbH and the University of the Basque Country.