Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates
arXiv:2303.04498 · doi:10.1088/2058-9565/acfa20
Abstract
We show how to efficiently decompose a parameterized multi-qubit Pauli (PMQP) gate into native parameterized two-qubit Pauli (P2QP) gates minimizing both the circuit depth and the number of P2QP gates. Given a realistic quantum computational model, we argue that the technique is optimal in terms of the number of hardware native gates and the overall depth of the decomposition. Starting from PMQP gate decompositions for the path and star hardware graph, we generalize the procedure to any generic hardware graph and provide exact expressions for the depth and number of P2QP gates of the decomposition. Furthermore, we show how to efficiently combine the decomposition of multiple PMQP gates to further reduce the depth as well as the number of P2QP gates for a combinatorial optimization problem using the Lechner-Hauke-Zoller (LHZ) mapping.
arXiv comment17 pages, 4 figures
References in corpus (23)
- Quantum Computing in the NISQ era and beyond
- Elementary gates for quantum computation
- A Quantum Engineer's Guide to Superconducting Qubits
- Microwave photonics with superconducting quantum circuits
- Fermionic quantum computation
- Multi-particle entanglement of hot trapped ions
- Real-time dynamics of lattice gauge theories with a few-qubit quantum computer
- Universal digital quantum simulation with trapped ions
- Quantum Circuits for General Multiqubit Gates
- Efficient decomposition of quantum gates
- Mapping local Hamiltonians of fermions to local Hamiltonians of spins
- Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
- A Compact Fermion to Qubit Mapping
- Digital-Analog Quantum Computation
- Two-qubit spectroscopy of spatiotemporally correlated quantum noise in superconducting qubits
- Phase Gadget Synthesis for Shallow Circuits
- Quantum bits with Josephson junctions
- Decompositions of general quantum gates
- Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware
- Superconducting Circuit Architecture for Digital-Analog Quantum Computing
- Low-depth simulations of fermionic systems on square-grid quantum hardware
- Parity Quantum Optimization: Encoding Constraints
- Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization
Cited by in corpus (8)
- Toward QCD on Quantum Computer: Orbifold Lattice Approach
- Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
- Measurement-based infused circuits for variational quantum eigensolvers
- Four-body coupler for superconducting qubits based on Josephson parametric oscillators
- Vanishing performance of the parity-encoded quantum approximate optimization algorithm applied to spin-glass models
- Benchmarking Digital-Analog Quantum Computation
- Efficient quantum simulation for translationally invariant systems
- Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation