A quantum-inspired algorithm has its origins in the study of quantum computing and systems. Yet, they can be executed in conventional computers! Programming a quantum computer constitutes a new way of thinking and solving computationally hard problems, also for normal computers.

For many problems, quantum-inspired algorithms obtain some of the promised advantages of quantum hardware. These advantages could result in computational speedups, better solutions, or memory savings. We make the most of these advantages to provide business value to our customers.

We benefit from the insight and the understanding of hard problems using quantum information frameworks. Quite often, a simple redefinition of the problem opens the door to innovative solutions with significant speedups. Other times, we can transform quantum algorithms into classical algorithms that provide heuristic speedups. We could not find those algorithms without understanding how quantum systems work.

Yes and no. Quantum-inspired algorithms can run on individual computers, on big clusters, on SaaS architectures, and on many different types of architectures and installations. We provide our services as a SaaS running on Azure.

Because they are inspired by quantum algorithms, quantum-inspired solutions share conventions, problem definitions and most characteristics with the corresponding quantum computing algorithms. Hence, due to the «black-box» nature of both approaches, both solutions are largely interchangeable. In case of doubt, our team can help you develop future-proof solutions that benefit from both approaches.

No. Some quantum-inspired algorithms that we develop are inspired by quantum computing, but they are designed from scratch to create new, extremely efficient algorithms that do not imitate universal quantum computers.

No. Quantum computers are fragile and expensive. It is therefore a waste of resources to run classical computations on quantum computers for many tasks. Classical algorithms are not magically accelerated by running on a quantum computer; on the contrary, qubits are usually slower than ordinary bits, and quantum speedups are not worthwhile in some cases. Quantum algorithms may require very little entanglement, and in that case, it is preferable to use a quantum-inspired algorithm that will run faster on ordinary hardware.

No. A few quantum algorithms provide exponential speedups, such as factoring, for which there are no classical alternatives. In exceptional situations those speedups are provably unique, and cannot be reproduced by classical computation means.