In this series of posts, we’re exploring a famous algorithm called Shor’s Algorithm. In previous posts, we talked about using phase estimation to do order finding. In order to use phase estimation we need to be able to take a unitary operator U and construct a \(CU^n\) gate that is...
Read More
You might have heard of the Fibonacci numbers (don’t worry if you’ve haven’t - we’ll explain them below) but did you know we there is a way of calculating them without having to use recursion called Bidet’s formula. What are the Fibonacci numbers? The Fibonacci numbers are the sequence of...
Read More
In this series of posts, we’re exploring a famous algorithm called Shor’s Algorithm. In the previous post, explored how phase estimation work and in doing so we mentioned the Quantum Fourier Transform but we didn’t dive into it. In this post we will but before we jump to the Quantum...
Read More
Most of my work is focused on de Sitter space so I want to spend some time focussing on it. Let’s start by describing de Sitter space by picturing it being embedded in a higher dimension space. We can describe \(dS_d\) (d dimension de Sitter space) by starting with \(\mathbb{R}^{1,d}\)...
Read More
Concurrent Programming What is concurrency? Concurrency is all about getting a computer doing many things at the same time. You may have come across the idea that computers have multiple cores - it would be nice if we could use all them at the same time to speed things up....
Read More
See all posts
