https://github.com/Djohnnie/QuantumComputingQSharpIntroduction2018

https://github.com/Djohnnie/QuantumComputingQSharpIntroduction2018

quantum

Last synced: 25 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/Djohnnie/QuantumComputingQSharpIntroduction2018
• Owner: Djohnnie
• License: mit
• Created: 2018-10-22T17:25:04.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2019-02-08T15:45:59.000Z (almost 6 years ago)
• Last Synced: 2024-08-04T01:02:27.231Z (4 months ago)
• Topics: quantum
• Language: C#
• Size: 14.6 KB
• Stars: 0
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

• awesome-qsharp - Quantum Computing Q# Introduction 2018

README

        
# QuantumComputingQSharpIntroduction2018

This Visual Studio Solution uses the Quantum Development Kit extension for Visual Studio 2017 and contains four Q# projects plus an additional C# class library. Each Q# project is an example of an algorithm talked about during the [Quantum Computing Deep Dive](https://www.slideshare.net/djohnnieke/quantum-computing-deep-dive) talk.

## 1. Introduction

This example will run the bitflip (X) gate on a qubit with state |0> and a qubit with state |1> and it will put a qubit in superposition ,measuring it 10.000 times, resulting in about 5.000 times |0> and about 5.000 times |1>.

## 2. Deutschs Algorithm

This example implements the Deutsch algorithm to evaluate if a blackbox function (Constant-Zero, Constant-One, Identity, Negation) is a constant or variable function.

## 3. Entanglement

This example entangles two qubits and measures them 10.000 times, resulting in about 5.000 times the state |00> and about 5.000 times the state |11>.

## 4. Teleportation

This example teleports a message qubit between two entangled qubits, one from Alice and one from Bob. The experiment is executed 10 times where the message is a random qubit state of |0> or |1>.