Quantum circuit synthesis with SQiSW

Abstract

The primary objective of quantum circuit synthesis is to efficiently and accurately realize specific quantum algorithms or operations utilizing a predefined set of quantum gates, while also optimizing the circuit size. It holds a pivotal position in Noisy Intermediate-Scale Quantum (NISQ) computation. Historically, most synthesis efforts have predominantly utilized CNOT or CZ gates as the 2-qubit gates. However, the SQiSW gate, also known as the square root of iSWAP gate, has garnered considerable attention due to its outstanding experimental performance with low error rates and high efficiency in 2-qubit gate synthesis. In this paper, we investigate the potential of the SQiSW gate in various synthesis problems by utilizing only the SQiSW gate along with arbitrary single-qubit gates, while optimizing the overall circuit size. For exact synthesis, the upper bound of SQiSW gates to synthesize arbitrary 3-qubit and $n$-qubit gates are 24 and $\frac{139}{192}{4}^n(1+o(1))$ respectively, which relies on the properties of SQiSW gate in Lie theory and Quantum Shannon Decomposition. We also introduce an exact synthesis scheme for Toffoli gate using only 8 SQiSW gates, which is grounded in numerical observation. More generally, with respect to numerical approximations, we provide a theoretical analysis of a pruning algorithm to reduce the size of the searching space in numerical experiment to $\frac{1}{12}+o(1)$ of previous size, helping us reach the result that 11 SQiSW gates are enough in arbitrary 3-qubit gates synthesis up to an acceptable numerical error.

References in corpus (22)

• Validating quantum computers using randomized model circuits
• Synthesis of Quantum Logic Circuits
• A geometric theory of non-local two-qubit operations
• Quantum Circuits for General Multiqubit Gates
• Minimal Universal Two-qubit Quantum Circuits
• Quantum Process Tomography of a Universal Entangling Gate Implemented with Josephson Phase Qubits
• Efficient decomposition of quantum gates
• Natural two-qubit gate for quantum computation using the XY interaction
• Variational Quantum State Eigensolver
• Implementation of the XY interaction family with calibration of a single pulse
• Compiling quantum algorithms for architectures with multi-qubit gates
• Five Two-Qubit Gates Are Necessary for Implementing Toffoli Gate
• On the CNOT-complexity of CNOT-PHASE circuits
• Quantum Instruction Set Design for Performance
• Constructive Quantum Shannon Decomposition from Cartan Involutions
• Numerical analysis of quantum circuits for state preparation and unitary operator synthesis
• Automatic quantum circuit encoding of a given arbitrary quantum state
• QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation
• Variational quantum eigensolver with linear depth problem-inspired ansatz for solving portfolio optimization in finance
• One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing
• Quantum circuit synthesis via a random combinatorial search
• Synthesizing quantum circuits via numerical optimization