Quantum Computing Tutorials

Pauli gates are single-qubit quantum gates; they are essential for altering and controlling quantum information. Named for the scientist Wolfgang Pauli, they are represented...

Simon algorithm is one of the initial quantum algorithms that establish the advantage of quantum computing over classical computing for specific problems. It was...

A quantum method meant to solve systems of linear equations is the (Harrow-Hassidim-Lloyd) HHL algorithm. It offers a technique for determining the solution vector...

Quantum phase estimate is a quantum method for estimating the eigenvalue of a unitary operator. Many quantum algorithms depend on this fundamental subroutine, which...

Adiabatic quantum computing (AQC) is a model of quantum computation solving computational tasks by use of the adiabatic theorem of quantum mechanics. Farhi, Goldstone,...

A fundamental idea guiding the total energy of a quantum system in quantum computing is the Hamiltonian. It is a Hermitian operator that controls...

Examples of quantum walk algorithms, specifically two, are the Element Distinctness Problem and Glued Trees Graph Traversal. Element Distinctness Problem: Ambainis's method for the element...

Particularly for search and sampling issues, quantum walk algorithms are a major focus of research in quantum computing as they provide quicker and more...

The mathematical foundation supporting quantum mechanics, quantum computing, and QFT is Hilbert space. The development of quantum technology depends on a means to characterize...

Quantum Cellular Automata (QCA) are a quantum equivalent of classical cellular automata that give a computing paradigm in which cells with quantum states grow...