This post is meant for people who are just getting started with mechanistic interpretability and have an understanding of the transformer architecture as well as the underlying linear algebra. Maybe you have not yet read the mathematical framework for transformer circuits (MFTC) or have read it but are still confused about some things. I know that I…
We are on the cusp of a new era in computing, where the fundamental units of information processing are no longer classical bits but quantum bits, or qubits. This shift is opening up a vast, new landscape of possibilities for tackling complex mathematical problems that classical computers can’t solve efficiently. To give a case in point,…
A Cornerstone of Quantum Computing Quantum Phase Estimation (QPE) stands as a fundamental algorithm in the realm of quantum computing, renowned for its efficiency in estimating the phase (eigenvalue) of a unitary operator. This capability is crucial for unveiling properties of quantum systems that remain inaccessible to classical computational approaches. The Emergence of QPE in…
Variational algorithms are considered among the leading candidates for finding some of the first useful applications of quantum computing. However, noise in quantum hardware limits the number of operations we can run in a quantum circuit before errors accumulate and invalidate the result.Quantum error correction techniques will eventually resolve these errors in fault-tolerant quantum computers….
Simon’s algorithm provided the first example of an exponential speedup over the best known classical algorithm by using a quantum computer to solve a particular problem. Originally published in 1994, Simon’s algorithm was a precursor to Shor’s well-known factoring algorithm, and it served as inspiration for many of the seminal works in quantum computation that…
A clear guide to the Bernstein-Vazirani Algorithm, extending knowledge from the Deutsch-Jozsa into more complex algorithms. We’ll explore the Problem, Classical and Quantum Solutions, as well as creating circuits, code, and running the algorithm on Quantum Computers with Qiskit. This is a bonus Part 3 to Quantum Algorithm Untangled’s series on the Deutsch-Jozsa Algorithm. Part…
When learning quantum computing algorithms from a textbook, there is usually a progression from the earliest, simplest algorithms to the later, more complex algorithms. Among the first of these textbook algorithms to be presented is often the Deutsch-Jozsa algorithm, whose small size and seeming simplicity belie its importance. What is the Deutsch-Jozsa algorithm? Using the…
There’s been a lot of hype recently surrounding quantum computers. From IBM releasing their new 127-qubit Eagle Chip, to Xanadu unveiling their Quantum Codebook, there’s been a lot going on in the industry! However, this news might lead one to wonder: Sure, the tech’s cool and all, but what can I actually use a quantum computer for? IBM’s…
Anyone interested in learning quantum computing cannot avoid hearing about Shor’s Factoring Algorithm. It is one of the few textbook quantum algorithms, which means that it remains one of the rare examples of quantum computational advantage. In other words, the algorithm can compute something quantumly that is harder and slower to compute classically. In fact, this particular…
What is Quantum Computing? Quantum Computing is a form of computing that takes advantage of quantum mechanics to process information exponentially faster than classical computers. Classical computers use classical bits which can consist of either a 0 or a 1 to encode information. Quantum computers, on the other hand, use quantum bits, or qubits, like photons, atoms,…
