Close

Filter courses

Show courses Show filters
Close

Germanium Quantum Technology

01 /What can CMOS technology do for quantum computing? 02 /Semiconductor devices and scaling with industrial approach 03 /Semiconductor foundry facilities: the good and the bad for qubits 04 /IMEC's latest qubit developments 05 /Summary and outlook 06 /Semiconductors for spin qubits 07 /Germanium quantum wells on silicon 08 /Germanium quantum wells on silicon-germanium 09 /Growth methods 10 /Characterization techniques 11 /Electrical characterization of germanium quantum wells 12 /Fabrication of H-FET 13 /Semiconductor qubits: vision and challenges 14 /Quantum materials 15 /Quantum dot qubits and their operation 16 /Types of quantum dot qubits 17 /Qubit Readout 18 /Qubit Control 19 /Qubit Coherence and Fidelity 20 /Multi-qubit control and quantum algorithms 21 /Quantum links and scaling 22 /Physics of holes 23 /Hole spin qubits 24 /Introduction to electronics for quantum computing 25 /Room temperature electronics 26 /Cryogenic qubit chip carriers 27 /Contribution to IGNITE 28 /Quantum Control Stack for Spin Qubits 29 /Auto-tuning a quantum computer 30 /Tuning and operation of arrays 31 /Finding operation points example 32 /What is auto-tuning? 33 /Neural network tuning 34 /Navigating charge stability diagrams 35 /Experimental implementation 36 /Towards universal quantum algorithms 37 /Classical error correction 38 /Quantum error correction 39 /Progress and challenges 40 /Introduction to quantum algorithms 41 /The first algorithms 42 /Quantum annealing 43 /Quantum Machine Learning

The first algorithms

In this video we just give a quick overview of the first algorithms that were developed in the context of quantum computing. Taking place at the very end of last century, Shor’s algorithm and Grover’s algorithm were considered an inflection point in this matter, proving that quantum computing could achieve solutions out of reach for classical devices. These solutions were designed with a well-defined mathematical formalism, so there is mathematical proof of a quantum advantage on their definition.

Main takeaways

  • Certain quantum algorithms prove a quantum advantage. 
  • A few critical domains under the scope of fault-tolerant devices: cryptography. 
  • Recent field with a lot of potential also in the software domain. 

Further thinking

True or False: We can improve Grover’s algorithm by substituting some of its parts with classical devices.

Solution

Further reading

Quantum Information and Quantum Computation. Michael A. Nielsen and Isaac L. Chuang

Variational Quantum Factoring. Eric R. Anschuetz, et al. arXiv:1808.08927

Complete 3-Qubit Grover search on a programmable quantum computer C. Figgatt et al. Nature Communications 8, 1918 (2017)