QAOA to solve MIS
In the last blog, we talked about the Quantum Adiabatic Algorithm (QAA) and used it solve the MIS problem. Here, we will discuss the Quantum Approximation Optimization Algorithm (QAOA) which is popular algorithm in the gate based quantum computing. We will use QAOA to solve the same MIS problem that we tackled in the last blog. Algorithm description In QAOA, we start with an eigenstate of the mixer hamiltonian. We then exponentiate and parameterize in $p$ steps by $p$ betas and gammas:...
Maximum Independent Set with Quantum Adiabatic Algorithm
Recently, I participated in the The Blaise Pascal [re]Generative Quantum Challenge by Pasqal and got to learn about Pasqal鈥檚 neutral atom arrays and pulse-level programming as well as implementing quantum algorithms on an analog device. Here, I will share my learnings and in this blog particularly, we will solve the MIS problem with the quantum adiabatic algorithm using Pulser ( Citation: Henrique, Grijalva & al., Henrique, S., Grijalva, S., Henriet, L., Cornillot, A....
Brassard-H酶yer-Tapp Algorithm in Qiskit
A Womanium Global Media Project Initiative Overview Previously, we discussed the theoritical aspects of Quantum Collision Finding and the BHT algorithm. We now try to implement in the BHT algorithm using Qiskit for small functions. We鈥檒l create a class for this and explain it step-by-step. First let鈥檚 import essential packages. import numpy as np from qiskit import QuantumCircuit from qiskit.primitives import Sampler from qiskit.tools.visualization import plot_histogram from qiskit.algorithms.algorithm_result import AlgorithmResult from qiskit....
Quantum Collision Finding
A Womanium Global Media Project Initiative. Collisions in hash functions A collision in a hash function is when two different inputs produce the same output hash. This is a problem because it violates the fundamental premise of a hash function, which is to produce a unique output for each unique input. Collisions can be exploited by attackers to create fraudulent transactions or gain unauthorized access to secure systems, making them a critical concern in the design and implementation of hash functions....
Deterministic Measurement-based imaginary time evolution
Paper: ( Citation: Mao, Chaudhary & al., 2022 Mao, Y., Chaudhary, M., Kondappan, M., Shi, J., Ilo-Okeke, E., Ivannikov, V. & Byrnes, T. (2022). Deterministic measurement-based imaginary time evolution. https://doi.org/0.48550/arXiv.2202.09100 ) Imaginary time evolution (ITE) ITE is a technique to find the ground state of a system where the time t is replaced by imagainary time $i\tau$. To understand this, let us consider the time-dependent Schrodinger equation for a system with Hamiltonian $H$:...