Skip to content
This repository was archived by the owner on Dec 21, 2022. It is now read-only.
This repository was archived by the owner on Dec 21, 2022. It is now read-only.

Using Quantum Computers to play Wordle #134

@jsistosb

Description

@jsistosb

Team Name:

Entangled_Pirates

Project Description:

The Hamming distance is a metric of how many different characters two strings have on corresponding places. Algorithms to measure this distance in Quantum Computers often focus only at the bit level. This is not ideal in situations where strings of symbols, composed of several bits, want to be compared. In this paper, the authors implement an encoding scheme to successfully measure the hamming distance between sequences of letters.

One current interesting application of this is the word-game Wordle. By looking for the word whose average Hamming distance to the rest of the database is minimal, we can optimize a playing strategy in which the probability of getting green and yellow matches is higher, therefore reducing the set of possible answers quickly and efficiently.

Presentation:

Presentation

Source code:

Quantum Wordle Solver

Which challenges/prizes would you like to submit your project for?

IBM Qiskit Challenge
Young Scientist Challenge

About us

Entangled_Pirates is the team formed by @jsistos, @SaulPuente, @Isamade, @shamimmamun and two other people, which participated in QHack's 2022 edition.

Metadata

Metadata

Assignees

No one assigned

    Labels

    IBM Qiskit ChallengeMore details here: https://github.com/XanaduAI/QHack/blob/master/Open_Hackathon.md#ibm-qiskit-challeYoung Scientist ChallengeMore details here: https://github.com/XanaduAI/QHack/blob/master/Open_Hackathon.md#young-scientist-c

    Type

    No type
    No fields configured for issues without a type.

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions