Open in app
Jonathan Hui
17.1K Followers
About

Sign in

17.1K Followers
About
Open in app

QC — Appendix for the Shor’s Algorithm

Jonathan Hui

Jonathan Hui

Nov 29, 2018·2 min read

Image for post
Image for post
Photo by rawpixel

This article holds the appendix section of the Shor’s Algorithm in Quantum Computing.

Proof: Perform the QFT iteratively

Image for post
Image for post
Source

Eigenvector and eigenvalue of a modulo function

With U defined as:

Image for post
Image for post

The corresponding eigenvalue and the eigenvector of U are:

Image for post
Image for post

Prove:

Image for post
Image for post

Written by

Jonathan Hui

Deep Learning

More from Jonathan Hui

Deep Learning

More From Medium

TensorFlow Eager Execution v.s. Graph (@tf.function)

Jonathan Hui

QC — How to build a Quantum Computer with Superconducting Circuit?

Jonathan Hui

TensorFlow RNN models

Jonathan Hui

Using Quantum Operations to Achieve Computing Objectives

John Boyer in Qiskit

QC — Control quantum computing with unitary operators, interference & entanglement

Jonathan Hui

QC — Programming with Quantum Gates (Single Qubits)

Jonathan Hui

F is a second-order derivative.

Jonathan Hui

TensorFlow Save & Restore Model

Jonathan Hui

About

Help

Legal

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store