Please use this identifier to cite or link to this item:
http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/6950
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Prabhakar, Anil | en_US |
dc.contributor.author | RAMACHANDRAN, NANDHINI | en_US |
dc.date.accessioned | 2022-05-14T17:43:51Z | - |
dc.date.available | 2022-05-14T17:43:51Z | - |
dc.date.issued | 2022-05 | - |
dc.identifier.citation | 49 | en_US |
dc.identifier.uri | http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/6950 | - |
dc.description.abstract | Quantum computers are expected to revolutionise computing. An essential step towards that is to implement high fidelity quantum gates. In the thesis, we try to build an universal SU(2) gate set consisting of Z gate, X(π/2) gate and cross resonance gate, robust to various noises using Q-CTRL Boulder Opal. Q-CTRL have demonstrated techniques to improve quantum gates by 10x reduction in coherent error. We make use of these techniques to create better universal gates and compare their efficiency in IBM superconducting qubits. We optimise X(π/2) pulse for dephasing noise and control amplitude error and compare the control error robustness of optimised pulse against Gaussian pulse, DRAG pulse calibrated for leakage error, DRAG pulse calibrated for phase error and IBM default pulses. We also optimise cross resonance gate against cross talk noise and study its robustness theoretically | en_US |
dc.description.sponsorship | DST - INSPIRE | en_US |
dc.language.iso | en | en_US |
dc.subject | quantum gates | en_US |
dc.subject | pulse programming | en_US |
dc.title | Improving quantum gates using pulse programming | en_US |
dc.type | Thesis | en_US |
dc.type.degree | BS-MS | en_US |
dc.contributor.department | Dept. of Physics | en_US |
dc.contributor.registration | 20171077 | en_US |
Appears in Collections: | MS THESES |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Nandhini MS Thesis.pdf | MS Thesis | 1.82 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.