Quantum Science and Technology · 2023 · 10 citations · 27 references
ComputingComputer EngineeringComputer ScienceOptimizationQuantum ComputingQuantum MechanicsCircuit ComplexityQuantum BitsQuantum CircuitsQuantum ComputationQuantum GatesQuantum Hardware ArchitecturesCircuit Depth OptimizationMulti-qubit GatesNative GatesParameterized Quantum CircuitsPauli GatesQuantum Circuit DecompositionQuantum Circuit Depth ReductionTwo-qubit Gates
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 mapping.
27
Quantum Computing in the NISQ era and beyond
John Preskill · Quantum · 2018 · 8.2K citations · Full text
Computing, Computer Science, Physics +17
Simulating physics with computers
Richard P. Feynman · International Journal of Theoretical Physics · 1982 · 7.5K citations
Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve et al. · Physical Review A · 1995 · 4.4K citations · Full text
Quantum Computations with Cold Trapped Ions
J. I. Cirac, P. Zoller · Physical Review Letters · 1995 · 3.7K citations
Computing, Computer Science, Physics +17