Approximate quantum gates compilation for superconducting transmon qubits with self-navigation algorithm

DOI10.1007/S11128-023-04125-8MaRDI QIDQ6048747zbMATH OpenFDO

Authors Runhong He, Feng-Hua Ren, Yang-Yang Xie, Arapat Ablimit, Zhao-Ming Wang

Publication date 13 October 2023

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11128-023-04125-8

zbMATH Keywords

approximate compilationquantum gatesuperconducting transmon qubits

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Robustness of a universal gate set implementation in transmon systems via chopped random basis optimal control
• An algebraic quantum circuit compression algorithm for Hamiltonian simulation
• Practical circuit optimization algorithm for quantum simulation based on template matching
• On the qubit routing problem
• Decoherence dynamics estimation for superconducting gate-model quantum computers

Cites work

• Quantum computation and quantum information. 10th anniversary edition
• The Solovay--Kitaev algorithm

Cited in

(1)

• Practical circuit optimization algorithm for quantum simulation based on template matching

This page was built for publication: Approximate quantum gates compilation for superconducting transmon qubits with self-navigation algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6048747)