"
]
},
{
"cell_type": "code",
"collapsed": true,
"input": [
"%load_ext sympyprinting"
],
"language": "python",
"outputs": [],
"prompt_number": 1
},
{
"cell_type": "code",
"collapsed": true,
"input": [
"from sympy import sqrt, symbols, Rational",
"from sympy import expand, Eq, Symbol, simplify, exp, sin",
"from sympy.physics.quantum import *",
"from sympy.physics.quantum.qubit import *",
"from sympy.physics.quantum.gate import *",
"from sympy.physics.quantum.grover import *",
"from sympy.physics.quantum.qft import QFT, IQFT, Fourier",
"from sympy.physics.quantum.circuitplot import circuit_plot"
],
"language": "python",
"outputs": [],
"prompt_number": 2
},
{
"cell_type": "markdown",
"source": [
"QFT is useful for a quantum algorithm for factoring numbers which is exponentially faster than what is thought to be possible on a classical machine. ",
"The transform does a DFT on the state of a quantum system ",
"There is a simple decomposition of the QFT in terms of a few elementary gates."
]
},
{
"cell_type": "markdown",
"source": [
"