Real-World Proof of Performance: An Order of Magnitude Faster with Dynex Quantum Core v2.
13 Jul 2025, 21:38
Real-World Proof of Performance: An Order of Magnitude Faster with Dynex Quantum Core v2
Dynex Quantum Core algorithm v2 has solved the n-queen problem for n = 100 in under 200 seconds utilising 10,000 qubits.
The n-queen problem is a well-known computational benchmark that requires placing n queens on an n×n chessboard such that no two queens threaten each other. As n increases, the solution space grows exponentially, making it a strong test for scalability and performance.
This result demonstrates Dynex’s ability to solve exponentially complex problems in sub-exponential—near-linear—time, confirming the scalability and efficiency of its quantum network.
⚖️ In comparison, classical solvers and current quantum hardware struggle at this scale or fail to reach a solution altogether.
⏱️ Dynex’s previous core algorithm v1 required an order of magnitude more time for the same problem size.
🔍 Zoom in to the 100×100 chessboard below to appreciate the full scale of the solution.