Quantum computing
The foundation of quantum computing comes a long way from 1980s to winning the 2022 physics nobel prize. Quantum computing has become a highly popular field of study to research as it tackles computational problems that were deemed impossible to solve. Many large tech companies in the world are inve...
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/168333 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-168333 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1683332023-06-17T16:50:52Z Quantum computing Lwee, Jia Wei Shu Jian Jun School of Mechanical and Aerospace Engineering MJJShu@ntu.edu.sg Engineering::Mechanical engineering The foundation of quantum computing comes a long way from 1980s to winning the 2022 physics nobel prize. Quantum computing has become a highly popular field of study to research as it tackles computational problems that were deemed impossible to solve. Many large tech companies in the world are investing heavily and angling to stake their place in a quantum future. At present, current technologies has enabled the production of quantum computer, Osprey, a new 433 qubit processor. On the other hand, the quantum computing research have drifted towards software development. In this project, the author examine an approach to apply Hadamard Gate to Fourier Transform and compute the differences between the quantum and classical approach. The author then proposes a quantum algorithm to improve on current sequencing methods called Grover’s search algorithm, which in comparison to classical method, may extract information from an unsorted dataset of size N in a number of iterations on the order of O√N. Bachelor of Engineering (Mechanical Engineering) 2023-06-12T02:49:54Z 2023-06-12T02:49:54Z 2023 Final Year Project (FYP) Lwee, J. W. (2023). Quantum computing. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/168333 https://hdl.handle.net/10356/168333 en B228 application/pdf Nanyang Technological University |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Mechanical engineering |
spellingShingle |
Engineering::Mechanical engineering Lwee, Jia Wei Quantum computing |
description |
The foundation of quantum computing comes a long way from 1980s to winning the 2022 physics nobel prize. Quantum computing has become a highly popular field of study to research as it tackles computational problems that were deemed impossible to solve. Many large tech companies in the world are investing heavily and angling to stake their place in a quantum future. At present, current technologies has enabled the production of quantum computer, Osprey, a new 433 qubit processor. On the other hand, the quantum computing research have drifted towards software development. In this project, the author examine an approach to apply Hadamard Gate to Fourier Transform and compute the differences between the quantum and classical approach. The author then proposes a quantum algorithm to improve on current sequencing methods called Grover’s search algorithm, which in comparison to classical method, may extract information from an unsorted dataset of size N in a number of iterations on the order of O√N. |
author2 |
Shu Jian Jun |
author_facet |
Shu Jian Jun Lwee, Jia Wei |
format |
Final Year Project |
author |
Lwee, Jia Wei |
author_sort |
Lwee, Jia Wei |
title |
Quantum computing |
title_short |
Quantum computing |
title_full |
Quantum computing |
title_fullStr |
Quantum computing |
title_full_unstemmed |
Quantum computing |
title_sort |
quantum computing |
publisher |
Nanyang Technological University |
publishDate |
2023 |
url |
https://hdl.handle.net/10356/168333 |
_version_ |
1772827732627947520 |