پیاده سازی الگوریتم های کوانتومی

Quantum Computations

• Two-Level Quantum Systems: Qubits, Superposition and Quantum Entanglement
•  Classical universal Gates: AND, OR, NOR, NOT, XOR and NAND
•  Single and Multiple-Qubit Gates: NOT, Hadamard, Z, CNOT, Controlled-U gates
•  Quantum Gates Theory: Bell State, Quantum Teleportation, Quantum Random Number Generator, Deutsch-Jozsa, Bernstein-Vajrini, Bell’s Inequality, Simon’s and Grover’s Algorithms

Implementation of Quantum algorithms
• Introduction to Google Cirq
• Install Cirq
• Define Qubits in Cirq
• Gates and operations in Cirq
• Measurement gate
• Single qubit gates
• Two qubit gates
• Other gates
• Create your own gates
• Circuits and moments in Cirq
• Simulation in Cirq
• Expectation values
• Observables
• Parameterized values and studies
• Qsim Cirq
• Using parameter sweeps
• Unitary matrices and decompositions in Cirq
• Optimizers in Cirq
• Noise
• Common channels implementation in Cirq
• The channel and mixture protocols implementation in Cirq
• Custom channels implementation in Cirq
• Noisy circuits implementation in Cirq
• Entangled States implementation in Cirq
• Bell State implementation in Cirq
• Quantum Teleportation implementation in Cirq
• Quantum Random Number Generator implementation in Cirq
• Superdense coding implementation in Cirq
• Deutsh’s and Deutsch–Jozsa algorithm implementation in Cirq
• Bernstein-Vazirani algorithm implementation in Cirq
• Simon algorithm implementation in Cirq
• Quantum Fourier transform implementation in Cirq
• Grover’s Search algorithm implementation in Cirq
• RSI and Shor algorithm
• QisKit framework