The max-cut problem on a random graph with 7 nodes is solved using QAOA, ED, Monte-Carlo, and simulated annealing.
-
Updated
Sep 9, 2021 - Jupyter Notebook
The max-cut problem on a random graph with 7 nodes is solved using QAOA, ED, Monte-Carlo, and simulated annealing.
Simulating non-native cubic interactions on noisy quantum machines
Learning the quantum algorithm for state overlap
A repository containing my solution to the screening tasks for the second cohort of Quantum Open Source Foundation Mentorship program.
Some tests with QAOA, VQE, annealers and other procedures for NISQ quantum computers
Quantum Circuit Simulator for browser and Node.js, powered by WebAssembly
Algorithms for optimization tasks (operations research)
Quantum computational chemistry based on TensorCircuit
Tensor network based quantum software framework for the NISQ era
Variational Quantum Circuit Simulator for Quantum Computation Research
Schrödinger and Schrödinger-Feynman simulators for quantum circuits.
A python framework for creating, editing, and invoking Noisy Intermediate Scale Quantum (NISQ) circuits.
Add a description, image, and links to the nisq topic page so that developers can more easily learn about it.
To associate your repository with the nisq topic, visit your repo's landing page and select "manage topics."