All You Need is pi: Quantum Computing with Hermitian Gates

Abstract

Universal gate sets for quantum computation, when single and two qubit operations are accessible, include both Hermitian and non-Hermitian gates. Here we utilize the fact that any single-qubit operator may be implemented as two Hermitian gates, and thus a purely Hermitian universal set is possible. This implementation can be used to prepare high fidelity single-qubit states in the presence of amplitude errors, and helps to achieve a high fidelity single-qubit gate decomposition using four Hermitian gates. An implementational convenience can be that non-identity single-qubit Hermitian gates are equivalent to $\pi$ rotations up to a global phase. We show that a gate set comprised of $\pi$ rotations about two fixed axes, along with the CNOT gate, is universal for quantum computation. Moreover, we show that two $\pi$ rotations can transform the axis of any multi-controlled unitary, a special case being a single CNOT sufficing for any controlled $\pi$ rotation. These gates simplify the process of circuit compilation in view of their Hermitian nature. We exemplify by designing efficient circuits for a variety of controlled gates, and achieving a CNOT count reduction for the four-controlled Toffoli gate in LNN-restricted qubit connectivity.

References in corpus (23)

• Elementary gates for quantum computation
• Dynamical Decoupling of Open Quantum Systems
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Solid-state electronic spin coherence time approaching one second
• Keeping a Quantum Bit Alive by Optimized $\pi$-Pulse Sequences
• Synthesis of Quantum Logic Circuits
• Optimal Quantum Circuits for General Two-Qubit Gates
• Minimal Universal Two-qubit Quantum Circuits
• A universal quantum circuit for two-qubit transformations with three CNOT gates
• Robust dynamical decoupling for quantum computing and quantum memory
• Robust dynamical decoupling
• Optimal arbitrarily accurate composite pulse sequences
• Ultrahigh-fidelity composite rotational quantum gates
• Depth optimization of CZ, CNOT, and Clifford circuits
• Further analysis of some symmetric and antisymmetric composite pulses for tackling pulse strength errors
• Efficient variational synthesis of quantum circuits with coherent multi-start optimization
• Shallow unitary decompositions of quantum Fredkin and Toffoli gates for connectivity-aware equivalent circuit averaging
• Nested composite NOT gates for quantum computation
• Optimizing Gate Decomposition for High-Level Quantum Programming
• Single-qubit gates in two steps with rotation axes in a single plane
• Quantum-gate decomposer
• Benchmarking 16-element quantum search algorithms on superconducting quantum processors
• Multi-Controlled Quantum Gates in Linear Nearest Neighbor