Constructing approximately diagonal quantum gates

Journal Article · 15 October 2022 · International Journal of Quantum Information

DOI:https://doi.org/10.1142/s0219749922500253· OSTI ID:2424066

Griffin, Colton ^[1]; Cui, Shawn X. ^[1]

---

1. Department of Mathematics and Department of Physics and Astronomy, Purdue University, 150 N. University Street, West Lafayette, Indiana 47907, USA

We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are conjectured to converge to diagonal gates doubly exponentially fast and are verified for small integers. We systemically study this conjecture and prove several important partial results. Some techniques are developed to pave the way for a final resolution of the conjecture. The sequences provided here have applications in quantum search algorithms, quantum circuit compilation, generation of leakage-free entangled gates in topological quantum computing, etc.

• Research Organization: National Quantum Information Science (QIS) Research Centers (United States). The Quantum Science Center (QSC)
• Sponsoring Organization: USDOE
• DOE Contract Number: AC05-00OR22725
• OSTI ID: 2424066
• Journal Information: International Journal of Quantum Information, Journal Name: International Journal of Quantum Information Journal Issue: 08 Vol. 20; ISSN 0219-7499
• Publisher: World Scientific
• Country of Publication: United States
• Language: English

Related Subjects

Computer Science
Physics