Skip to content
This repository was archived by the owner on Aug 21, 2023. It is now read-only.

Commit 41dca38

Browse files
committed
Add readme for notebooks in terra/qis_adv
1 parent 12c379f commit 41dca38

1 file changed

Lines changed: 29 additions & 0 deletions

File tree

community/terra/qis_adv/README.md

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
# Advanced Quantum Information Science with Qiskit Terra
2+
3+
This folder hosts notebooks on advanced topics of Quantum Information Science.
4+
5+
Now that you have seen that quantum superposition and entanglement are important features in quantum computing and information,
6+
we will see how they can be used to obtain quantum advantages, as below.
7+
8+
* [Quantum Random Access Coding](single-qubit_quantum_random_access_coding.ipynb): show quantum advantages with one qubit that cannot be achieved with a single classical bit. The two-qubit version is also available [here](two-qubit_state_quantum_random_access_coding.ipynb).
9+
10+
* [Vaidman Detection Test](vaidman_detection_test.ipynb): show how to exploit probability computation between classical and quantum devices. Quantum computing works on probability amplitudes (instead of probability in classical), which is shown can mean either dead or alive! The ability to operate on probability amplitudes is also the basis of [the Grover search algorithm](../../algorithms/grover_algorithm.ipynb).
11+
12+
* [Quantum Fourier Transform](fourier_transform.ipynb): part of the [Shor's factoring algorithm](../../algorithms/shor_algorithm.ipynb) and an important block for extracting periodicity structures in many quantum algorithms.
13+
14+
* [Creation of Multi-Qubit W State Systems](Multi-Qubit_W_States_with_Tomography.ipynb): show an evidence that a customized circuit can be more efficient than the standard/generic one.
15+
16+
* [Topological Quantum Walk](topological_quantum_walk.ipynb): an example of applying quantum mechanics for random walk, which is a powerful tool in many classical randomized algorithms.
17+
18+
* [Wigner Functions](wigner_functions.ipynb): show how to create a quasiprobability density function (corresponding to probability density function in classical statistics) from density matrices.
19+
20+
* [Entangled Measurement](entangled_measurement.ipynb): show that entanglement can also be defined over quantum measurements just like over quantum states. And likewise, an equivalent inequality to test the existence of entangled measurement can also be derived just like the Bell/CHSH inequalities for the quantum states.
21+
22+
* [Quantum Finite Automata](comparing_classical_and_quantum_finite_automata.ipynb): show an example when quantum finite automata can be exponentially more efficient that its classical counterpart.
23+
24+
* [Quantum Pseudo-Telepathy](quantum_magic_square.ipynb): show that gambling with parties sharing quantum entanglement can be a headache as they can trick you proving something impossible with classical statistics.
25+
26+
27+
## Contributing
28+
29+
We welcome more examples in this folder, in particular, experimenting with the latest results in quantum information science.

0 commit comments

Comments
 (0)