Gast ::
| Hauptseite > Publikationsdatenbank > Simulation of gate-based quantum computers with superconducting qubits |
| Hauptseite > Publikationsdatenbank > Simulation of gate-based quantum computers with superconducting qubits |
| Poster (Other) | FZJ-2017-06889 |
; ; ; ;
2017
Please use a persistent id in citations: http://hdl.handle.net/2128/15559
Abstract: Over the last decades, tremendous effort has gone into building a universal quantum computer. In theory, such a device can solve certain problems such as factoring exponentially faster than digital computers. The leading technological prototypes are based on superconducting circuits and comprise up to 17 qubits. Controlling these fragile systems requires an enormous amount of precision, posing a difficult challenge for the experimentalists. We study such quantum systems in detail by solving the time-dependent Schrödinger equation for a generic model Hamiltonian. For this purpose, we have developed efficient product-formula algorithms that are tailored to key features of the model Hamiltonian. This allows us to simulate every individual controlling pulse that is used in experiments to realize a certain quantum gate, as dictated by the computational model of a quantum computer. By optimizing the pulse parameters, we find that even in the ideal case, the best pulses still contain undesirable errors in the realization of the intended quantum gate. The common gate metrics measured and reported in experiments or computed in theory are shown to provide insufficient practical information about the significance of these errors.
|
The record appears in these collections: |
PDF
PDF (PDFA)