Constructing approximately diagonal quantum gates

DOI10.1142/S0219749922500253MaRDI QIDQ5878645zbMATH OpenFDO

Authors Colton Griffin, Shawn X. Cui

Publication date 21 February 2023

Published in International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2109.05138

zbMATH Keywords

quantum search algorithmsquantum circuitstopological quantum computingleakage-free entangled gates

Mathematics Subject Classification ID

Quantum theory (81-XX)

Recommendations

• Generating a state \(t\)-design by diagonal quantum circuits
• Efficient discrete approximations of quantum gates
• Diagonal-unitary 2-design and their implementations by quantum circuits
• Asymptotically optimal circuits for arbitrary \(n\)-qubit diagonal computations
• A sequence of quantum gates

Cites work

• scientific article; zbMATH DE number 6131345 (Why is no real title available?)
• A modular functor which is universal for quantum computation
• Fixed-point quantum search
• Interferometry of non-Abelian anyons
• The Solovay--Kitaev algorithm
• The search for leakage-free entangling Fibonacci braiding gates

Cited in

(7)

• Asymptotically optimal circuits for arbitrary \(n\)-qubit diagonal computations
• Efficient quantum circuits for diagonal unitaries without ancillas
• A sequence of quantum gates
• Topological quantum gate construction by iterative pseudogroup hashing
• Constructing Approximately Diagonal Quantum Gates
• Efficient discrete approximations of quantum gates
• Groups of diagonal gates in the Clifford hierarchy

This page was built for publication: Constructing approximately diagonal quantum gates

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