Constructing Approximately Diagonal Quantum Gates
From MaRDI portal
Quantum algorithms and complexity in the theory of computing (68Q12) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of digital topology (68U03) Quantum coherence, entanglement, quantum correlations (81P40) Quantum gates (81P65) Quantum computation (81P68)
Abstract: 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.
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 Q6377373)
