The first algorithm that is typically associated with quantum computing is the Shor algorithm [1], which is seen as a significant potential threat to the current cybersecurity paradigm.
In previous posts, we have discussed the optimisation of portfolios using quantum annealing. Now, we will examine an alternative approach within a gate-based quantum computer, providing a view to understanding how QAOA works and a practical use case for the top ten enterprises in IBEX 35.
In this blog we show the results of a method that consists of introducing the possibility that in an iterative game each player can adjust the parameters of their quantum plays iteratively to optimise their own payoff through a cost function using, for example, gradient descent techniques.
In the context of quantum computing and its potential impact, the security of communications is a key concern. However, how might this new method of computing impact the security of our communications? The answer lies in the use of prime numbers.
In a previous post, we discussed how quantum annealing is an efficient technique for finding global minima in complex optimization problems. Now, we will take a step further by introducing reverse annealing, a powerful variation that enhances the search process by starting from a known solution and refining it through local exploration.
Quantum machine learning faces challenges with current quantum hardware, especially in generating high-dimensional data such as images. The Quantum Patch GAN offers a solution by generating images in smaller segments or "patches".
A random walk is a type of algorithmic process that involves taking random steps towards new points, with the probability of reaching a given point being dependent only on the previous point.
The generation of random numbers has been a subject of interest to human beings since ancient times. Proof of this is the existence of objects such as the dice, whose origin is so distant that it is not exactly known to us.
In a previous QETEL blog post we talked about the Braess Paradox and some related ideas such as Game Theory or Nash Equilibrium. However, we did not explain what Quantum Game Theory is and why it can achieve better results. To do so, we will fix ideas by reasoning with a concrete game and a particular quantization scheme.