Fast Introduction to Quantum Computers

Rasit O. Topaloglu

Rasit O. Topaloglu

IBM, Hopewell Junction, NY, USA

Search for more papers by this author
First published: 13 August 2022

Abstract

There exists a theoretical set of problems that could be solved in polynomial time with a quantum computer. Hence, quantum computing carries the potential to solve such problems much faster than a traditional supercomputer can. In this article, we provide intuition about quantum computing to the readers and walk them through the basics including what qubits are, what types of qubits there are, how they can be operated on, what are important about qubit characteristics, what the quantum circuits and architectures look like, and what the future of quantum circuits looks like. We only briefly mention about our original work on how to improve a qubit. This article is a tutorial in nature and those with no quantum background should be able to follow it.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.