TUHH Open Research
Help
  • Log In
    New user? Click here to register.Have you forgotten your password?
  • English
  • Deutsch
  • Communities & Collections
  • Publications
  • Research Data
  • People
  • Institutions
  • Projects
  • Statistics
  1. Home
  2. TUHH
  3. Publications
  4. Time-optimal multi-qubit gates : complexity, efficient heuristic and gate-time bounds
 
Options

Time-optimal multi-qubit gates : complexity, efficient heuristic and gate-time bounds

Citation Link: https://doi.org/10.15480/882.13945
Publikationstyp
Preprint
Date Issued
2023-07-20
Sprache
English
Author(s)
Baßler, Pascal 
Heinrich, Markus  
Kliesch, Martin  
Quantum-Inspired and Quantum Optimization E-25  
TORE-DOI
10.15480/882.13945
TORE-URI
https://hdl.handle.net/11420/44119
Citation
arXiv: 2307.11160 (2023)
Publisher DOI
10.48550/arXiv.2307.11160
ArXiv ID
2307.11160v1
Publisher
arXiv
Multi-qubit interactions are omnipresent in quantum computing hardware, and they can generate multi-qubit entangling gates. Such gates promise advantages over traditional two-qubit gates. In this work, we focus on the quantum gate synthesis with multi-qubit Ising-type interactions and single-qubit gates.
These interactions can generate global ZZ-gates (GZZ gates). We show that the synthesis of time-optimal multi-qubit gates is NP-hard. However, under certain assumptions we provide explicit constructions of time-optimal multi-qubit gates allowing for efficient synthesis. These constructed multi-qubit gates have a constant gate time and can be implemented with linear single-qubit gate layers. Moreover, a heuristic algorithm with polynomial runtime for synthesizing fast multi-qubit gates is provided. Finally, we prove lower and upper bounds on the optimal GZZ gate-time. Furthermore, we conjecture that any GZZ gate can be executed in a time O(n) for n qubits. We support this claim with theoretical and numerical results.
Subjects
quant-ph
DDC Class
530: Physics
Lizenz
https://creativecommons.org/licenses/by/4.0/
Loading...
Thumbnail Image
Name

2307.11160v2.pdf

Type

Main Article

Size

952.15 KB

Format

Adobe PDF

TUHH
Weiterführende Links
  • Contact
  • Send Feedback
  • Cookie settings
  • Privacy policy
  • Impress
DSpace Software

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science
Design by effective webwork GmbH

  • Deutsche NationalbibliothekDeutsche Nationalbibliothek
  • ORCiD Member OrganizationORCiD Member Organization
  • DataCiteDataCite
  • Re3DataRe3Data
  • OpenDOAROpenDOAR
  • OpenAireOpenAire
  • BASE Bielefeld Academic Search EngineBASE Bielefeld Academic Search Engine
Feedback