Characterization, synthesis, and optimization of quantum circuits over multiple-control $\text{Z}$-rotation gates: A systematic study

Abstract

We conduct a systematic study of quantum circuits composed of multiple-control $Z$-rotation (MCZR) gates as primitives, since they are widely-used components in quantum algorithms and also have attracted much experimental interest in recent years. Herein, we establish a circuit-polynomial correspondence to characterize the functionality of quantum circuits over the MCZR gate set with continuous parameters. An analytic method for exactly synthesizing such quantum circuit to implement any given diagonal unitary matrix with an optimal gate count is proposed, which also enables the circuit depth optimal for specific cases with pairs of complementary gates. Furthermore, we present a gate-exchange strategy together with a flexible iterative algorithm for effectively optimizing the depth of any MCZR circuit, which can also be applied to quantum circuits over any other commuting gate set. Besides the theoretical analysis, the practical performances of our circuit synthesis and optimization techniques are further evaluated by numerical experiments on two typical examples in quantum computing, including diagonal Hermitian operators and Quantum Approximate Optimization Algorithm (QAOA) circuits with tens of qubits, which can demonstrate a reduction in circuit depth by 33.40\% and 15.55\% on average over relevant prior works, respectively. Therefore, our methods and results provide a pathway for implementing quantum circuits and algorithms on recently developed devices.

arXiv commentComments are welcome

References in corpus (45)

• Quantum Computing in the NISQ era and beyond
• Elementary gates for quantum computation
• Noisy intermediate-scale quantum (NISQ) algorithms
• Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
• Parallel implementation of high-fidelity multi-qubit gates with neutral atoms
• Realization of Three-Qubit Quantum Error Correction with Superconducting Circuits
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• Quantum advantage with shallow circuits
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Quantum Circuits for General Multiqubit Gates
• Implementation of a Toffoli Gate with Superconducting Circuits
• Realization of the quantum Toffoli gate with trapped ions
• Complete 3-Qubit Grover Search on a Programmable Quantum Computer
• The Bitter Truth About Quantum Algorithms in the NISQ Era
• Fixed-point quantum search with an optimal number of queries
• Automated optimization of large quantum circuits with continuous parameters
• On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization
• Techniques for the Synthesis of Reversible Toffoli Networks
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• Quantum Hypergraph States
• Quantum circuits with uniformly controlled one-qubit gates
• Circuit-Based Quantum Random Access Memory for Classical Data
• Deutsch-Jozsa algorithm as a test of quantum computation
• Fault-tolerant quantum computation with few qubits
• Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
• Efficient Quantum Walk on a Quantum Processor
• High-fidelity three-qubit iToffoli gate for fixed-frequency superconducting qubits
• Fast multi-qubit gates by adiabatic evolution in interacting excited state manifolds
• Continuous-variable geometric phase and its manipulation for quantum computation in a superconducting circuit
• Compiling quantum algorithms for architectures with multi-qubit gates
• Universal fault-tolerant gates on concatenated stabilizer codes
• Efficient experimental estimation of fidelity of linear optical quantum Toffoli gate
• Deterministic Grover search with a restricted oracle
• Use of global interactions in efficient quantum circuit constructions
• Circuit-based quantum random access memory for classical data with continuous amplitudes
• A programmable three-qubit superconducting processor with all-to-all connectivity
• Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
• Generating a state $t$-design by diagonal quantum circuits
• Diagonal quantum circuits: their computational power and applications
• Fast microwave-driven three-qubit gates for cavity-coupled superconducting qubits
• Controlled-Controlled-Phase Gates for Superconducting Qubits Mediated by a Shared Tunable Coupler
• Realization of a deterministic quantum Toffoli gate with a single photon
• Multi-mode superconducting circuits for realizing strongly coupled multi-qubit processor units
• Multiple multi-control unitary operations: implementation and applications
• Quantum algorithm for learning secret strings and its experimental demonstration

Cited by in corpus (4)

• Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary Matrices with Asymptotically Optimal Gate Count
• Multi-controlled Phase Gate Synthesis with ZX-calculus applied to Neutral Atom Hardware
• Optimizing Quantum Transformation Matrices: A Block Decomposition Approach for Efficient Gate Reduction
• Efficient Classical Simulation of the DQC1 Circuit with Zero Discord