top of page
Quantum Inspired
IQExtreme: a platform of quantuminspired optimization
Problems that can be solved by
IQExtreme
iQXtreme is a platform for solving complex mathematical optimization problems, specially focused on highly nonconvex combinatorial optimization. Nonlinear combinatorial optimization is generally a NPhard problem, and solving them more efficiently is one of the promising applications of quantum computing.
DWave hardware is specially designed to solve Quadratic Unconstrained Binary Optimization (QUBO) problems, and it is the most mature quantum hardware up to date.
With iQXtreme, the user can solve not only QUBO problems, but other mathematical problems that are more appropriate for practical use cases compared to QUBO formulations.

Quantuminspired binary simulated annealing: heuristic search similar to quantum annealing (DWave).
â€‹

Quantuminspired integer simulated annealing: heuristic search inspired by quantum annealing, extended to integer variables.
â€‹

Constrained quantuminspired simulated annealing: heuristic search inspired by quantum annealing, in which search is constrained to a given cardinality subspace.
â€‹

Quantuminspired pruning algorithm: heuristic based on constrained quantuminspired simulated annealing.
â€‹

Quantuminspired permutation simulated annealing: heuristic search inspired by quantum annealing, extended to permutation matrices.
IQEXTREME advantages
Optimization
problems with thousands of variables
Near optimal solutions with quantuminspired heuristic search
Quick answers to exponentially complex problems
Highly nonconvex problems impossible for a regular optimizer
More variables
High quality
Fast solutions
Hard problems
Use cases
For Portfolio Optimization > Selection of a basket of N assets from a universe of thousands of financial instruments, optimizing return for given goals of risk, diversification and ESG scoring.
For Asset Allocation > Transforming portfolio weights into a discrete asset allocation so that budget is completely adjusted and transaction costs are minimized.For Asset Allocation > Transforming portfolio weights into a discrete asset allocation so that budget is completely adjusted and transaction costs are minimized.For Asset Allocation > Transforming portfolio weights into a discrete asset allocation so that budget is completely adjusted and transaction costs are minimized.
For Portfolio Optimization > Selection of a basket of N assets from a universe of thousands of financial instruments, optimizing return for given goals of risk, diversification and ESG scoring.
For Asset Allocation > Transforming portfolio weights into a discrete asset allocation so that budget is completely adjusted and transaction costs are minimized.
For Asset Allocation > Transforming portfolio weights into a discrete asset allocation so that budget is completely adjusted and transaction costs are minimized.
For Asset Allocation > Transforming portfolio weights into a discrete asset allocation so that budget is completely adjusted and transaction costs are minimized.
Why Quantum Inspired here?

Fast calculation of efficient frontier for a universe of thousands of assets (example shown: EF of 10 assets from 480 in SP500).

Savings in transaction costs.

Added portfolio value with respect to standard optimization techniques.

Ideal for trading with lots that are an integer multiple of a standard lot size.
Companies using IQExtreme
FAQs

What is quantum computing?A quantuminspired 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.

What is quantuminspired advantage?For many problems, quantuminspired 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.

Why are quantuminspired solutions better than traditional ones?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.

Is quantuminspired computation just a form of supercomputing?Yes and no. Quantuminspired algorithms can run on individual computers, on big clusters, on SaaS architectures and on many different types of architectures and installations. Our own API is delivered as an AWS Lambda service that can be upgraded to AWS E3 images running on demand, depending on the service contract.

Are quantuminspired solutions compatible with quantum computers?Because they are inspired by quantum algorithms, quantuminspired solutions share conventions, problem definitions and most characteristics with the corresponding quantum computing algorithms. Hence, due to the Â«blackboxÂ» nature of both approaches, both solutions are largely interchangeable. In case of doubt, our team can help you develop futureproof solutions that benefit from both approaches.

Do you just simulate a quantum computer? Is this like Qiskit or Cirq?No. Some quantuminspired 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.

Will quantum computers make all classical computation obsolete?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 quantuminspired algorithm that will run faster on ordinary hardware.

Can we always replace a quantum computer with a quantuminspired solution?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.
bottom of page