For IBM Quantum Challenge Africa 2021, 9 September (07:00 UTC) - 20 September (23:00 UTC).

Overview

IBM Quantum Challenge Africa 2021

To ensure Africa is able to apply quantum computing to solve problems relevant to the continent, the IBM Research Lab in South Africa and the University of the Witwatersrand have developed a quantum computing challenge that focuses on the fields of optimization, finance, and chemistry. This challenge will boost participant's quantum computing skills and give them the tools to devise the best solutions to real-world issues faced in Africa.

The challenge exercises are developed by African researchers for African learners, researchers, and industry professionals. Participants need not have any formal education in quantum computing, as the challenge focuses on its application to already existing classical problems.

The challenge will take place from 9 September (07:00 UTC) to 20 September (23:00 UTC). Read more about the challenge in the announcement blog.

Make sure to join the dedicated Slack channel #challenge-africa-2021 where you can connect with mentors and fellow attendees! Join the Qiskit Slack workspace here if you haven't already. Please also review our Slack Guidelines to make the most of your experience!

Event Code of Conduct

Preliminary Content

FAQ

Submitting Solutions

You might also like...
Effect of Different Encodings and Distance Functions on Quantum Instance-based Classifiers

Effect of Different Encodings and Distance Functions on Quantum Instance-based Classifiers The repository contains the code to reproduce the experimen

Self-Correcting Quantum Many-Body Control using Reinforcement Learning with Tensor Networks

Self-Correcting Quantum Many-Body Control using Reinforcement Learning with Tensor Networks This repository contains the code and data for the corresp

CVPR 2021 Challenge on Super-Resolution Space
CVPR 2021 Challenge on Super-Resolution Space

Learning the Super-Resolution Space Challenge NTIRE 2021 at CVPR Learning the Super-Resolution Space challenge is held as a part of the 6th edition of

This repo contains the official code of our work SAM-SLR which won the CVPR 2021 Challenge on Large Scale Signer Independent Isolated Sign Language Recognition.
This repo contains the official code of our work SAM-SLR which won the CVPR 2021 Challenge on Large Scale Signer Independent Isolated Sign Language Recognition.

Skeleton Aware Multi-modal Sign Language Recognition By Songyao Jiang, Bin Sun, Lichen Wang, Yue Bai, Kunpeng Li and Yun Fu. Smile Lab @ Northeastern

🏆 The 1st Place Submission to AICity Challenge 2021 Natural Language-Based Vehicle Retrieval Track (Alibaba-UTS submission)
🏆 The 1st Place Submission to AICity Challenge 2021 Natural Language-Based Vehicle Retrieval Track (Alibaba-UTS submission)

AI City 2021: Connecting Language and Vision for Natural Language-Based Vehicle Retrieval 🏆 The 1st Place Submission to AICity Challenge 2021 Natural

The 1st place solution of track2 (Vehicle Re-Identification) in the NVIDIA AI City Challenge at CVPR 2021 Workshop.

AICITY2021_Track2_DMT The 1st place solution of track2 (Vehicle Re-Identification) in the NVIDIA AI City Challenge at CVPR 2021 Workshop. Introduction

 Waymo motion prediction challenge 2021: 3rd place solution
Waymo motion prediction challenge 2021: 3rd place solution

Waymo motion prediction challenge 2021: 3rd place solution 📜 Technical report 🗨️ Presentation 🎉 Announcement 🛆Motion Prediction Channel Website 🛆

UIUCTF 2021 Public Challenge Repository

UIUCTF-2021-Public UIUCTF 2021 Public Challenge Repository Notes: every challenge folder contains a challenge.yml file in the format for ctfcli, CTFd'

Music Source Separation; Train & Eval & Inference piplines and pretrained models we used for 2021 ISMIR MDX Challenge.
Music Source Separation; Train & Eval & Inference piplines and pretrained models we used for 2021 ISMIR MDX Challenge.

Music Source Separation with Channel-wise Subband Phase Aware ResUnet (CWS-PResUNet) Introduction This repo contains the pretrained Music Source Separ

Comments
  • Added my exercise answers and explanations

    Added my exercise answers and explanations

    My open-ended solutions were scored as 100 and ~85, respectively. All other answers were marked as correct. Each exercise has a section titled as follows:

    Solution This shows the solution explanation.

    opened by Mouhamedaminegarrach 1
  • Add community guideline doc from iqc21 repo (with edits)

    Add community guideline doc from iqc21 repo (with edits)

    Changes include

    • Rename challenge to IBM Quantum Challenge Africa 2021
    • Fix incorrect capitalization of Slack
    • Change Slack channel name to #challenge-africa-2021
    • Change Slack channel link to match the channel name
    opened by conradhaupt 1
  • Added my exercise answers and explanations

    Added my exercise answers and explanations

    My open-ended solutions were scored as 100 and ~85, respectively. All other answers were marked as correct. Each exercise has a section titled as follows:

    Solution

    This shows the solution explanation.

    opened by RoyalWeden 1
  • Fixed erros in subscripts

    Fixed erros in subscripts

    The subscripts in the commentary were different from the subscripts in the paper that was supposed to be cited.

    In the text, "\textbf{X}_N" is used, but I think "\textbf{X}_M" is correct.

    notebook : lab2.ipynb section : Monte Carlo methods for option pricing body : Generate a large number, $M$, of random values which can serve as price paths ${\textbf{X}_1, \textbf{X}_2, . . . , \textbf{X}_N} $ for the underlying asset. These random values should be drawn from the probability distribution implied by the stochastic process. Let's call this distribution $\mathbb{P}$.

    source : Option Pricing Using Quantum Computers https://arxiv.org/abs/1905.02666

    It would be helpful if you could check it out.

    Thank you.

    opened by rsobt 1
The challenge for Quantum Coalition Hackathon 2021

Qchack 2021 Google Challenge This is a challenge for the brave 2021 qchack.io participants. Instructions Hello, intrepid qchacker, welcome to the <G|o

quantumlib 18 May 4, 2022
Code and description for my BSc Project, September 2021

BSc-Project Disclaimer: This repo consists of only the additional python scripts necessary to run the agent. To run the project on your own personal d

Matin Tavakoli 20 Jul 19, 2022
September-Assistant - Open-source Windows Voice Assistant

September - Windows Assistant September is an open-source Windows personal assis

The Nithin Balaji 9 Nov 22, 2022
ManiSkill-Learn is a framework for training agents on SAPIEN Open-Source Manipulation Skill Challenge (ManiSkill Challenge), a large-scale learning-from-demonstrations benchmark for object manipulation.

ManiSkill-Learn ManiSkill-Learn is a framework for training agents on SAPIEN Open-Source Manipulation Skill Challenge, a large-scale learning-from-dem

Hao Su's Lab, UCSD 48 Dec 30, 2022
QHack—the quantum machine learning hackathon

Official repo for QHack—the quantum machine learning hackathon

Xanadu 72 Dec 21, 2022
Simulating Sycamore quantum circuits classically using tensor network algorithm.

Simulating the Sycamore quantum supremacy circuit This repo contains data we have obtained in simulating the Sycamore quantum supremacy circuits with

Feng Pan 46 Nov 17, 2022
Official repo for QHack—the quantum machine learning hackathon

Note: This repository has been frozen while we consider the submissions for the QHack Open Hackathon. We hope you enjoyed the event! Welcome to QHack,

Xanadu 118 Jan 5, 2023
'Solving the sampling problem of the Sycamore quantum supremacy circuits

solve_sycamore This repo contains data, contraction code, and contraction order for the paper ''Solving the sampling problem of the Sycamore quantum s

Feng Pan 29 Nov 28, 2022
An implementation of quantum convolutional neural network with MindQuantum. Huawei, classifying MNIST dataset

关于实现的一点说明 山东大学 2020级 苏博南 www.subonan.com 文件说明 tools.py 这里面主要有两个函数: resize(a, lenb) 这其实是我找同学写的一个小算法hhh。给出一个$28\times 28$的方阵a,返回一个$lenb\times lenb$的方阵。因

ぼっけなす 2 Aug 29, 2022
Filtering variational quantum algorithms for combinatorial optimization

Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently.

null 1 Feb 9, 2022