Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2504.00995 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912365727973376 |
|---|---|
| author | Mahmud, M M Hassan Goldsmith, Daniel |
| author_facet | Mahmud, M M Hassan Goldsmith, Daniel |
| contents | In this article, we present an introduction to quantum computing (QC) tailored for computing professionals such as programmers, machine learning engineers, and data scientists. Our approach abstracts away the physics underlying QC, which can be challenging to grasp, and frames it as a model of computation similar to, for instance, Turing machines. This helps readers grasp the fundamental principles of QC from a purely logical perspective. We begin by defining quantum states and qubits, establishing their mathematical representation and role in computation. We introduce fundamental concepts such as basis states, quantum gates, and tensor products, illustrating how these form the building blocks of quantum computation. Then we present the Deutsch-Josza algorithm, one of the simplest quantum algorithms that demonstrate how quantum computers can outperform classical computers. Finally, we provide guidance for further study, recommending resources for those interested in exploring quantum algorithms, implementations, and industry applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_00995 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Minimal Introduction to Quantum Computing Mahmud, M M Hassan Goldsmith, Daniel Quantum Physics In this article, we present an introduction to quantum computing (QC) tailored for computing professionals such as programmers, machine learning engineers, and data scientists. Our approach abstracts away the physics underlying QC, which can be challenging to grasp, and frames it as a model of computation similar to, for instance, Turing machines. This helps readers grasp the fundamental principles of QC from a purely logical perspective. We begin by defining quantum states and qubits, establishing their mathematical representation and role in computation. We introduce fundamental concepts such as basis states, quantum gates, and tensor products, illustrating how these form the building blocks of quantum computation. Then we present the Deutsch-Josza algorithm, one of the simplest quantum algorithms that demonstrate how quantum computers can outperform classical computers. Finally, we provide guidance for further study, recommending resources for those interested in exploring quantum algorithms, implementations, and industry applications. |
| title | A Minimal Introduction to Quantum Computing |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2504.00995 |