Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
Citations Over TimeTop 1% of 2020 papers
Abstract
Quantum algorithms offer a dramatic speedup for computational problems in material science and chemistry. However, any near-term realizations of these algorithms will need to be optimized to fit within the finite resources offered by existing noisy hardware. Here, taking advantage of the adjustable coupling of gmon qubits, we demonstrate a continuous two-qubit gate set that can provide a threefold reduction in circuit depth as compared to a standard decomposition. We implement two gate families: an imaginary swap-like (iSWAP-like) gate to attain an arbitrary swap angle, θ, and a controlled-phase gate that generates an arbitrary conditional phase, ϕ. Using one of each of these gates, we can perform an arbitrary two-qubit gate within the excitation-preserving subspace allowing for a complete implementation of the so-called Fermionic simulation (fSim) gate set. We benchmark the fidelity of the iSWAP-like and controlled-phase gate families as well as 525 other fSim gates spread evenly across the entire fSim(θ,ϕ) parameter space, achieving a purity-limited average two-qubit Pauli error of 3.8×10^{-3} per fSim gate.
Related Papers
- → Quantum Computing Concepts with Deutsch Jozsa Algorithm(2019)6 cited
- → Variational Quantum Computation Integer Factorization Algorithm(2023)3 cited
- → Quantum computation with rotational states of nonpolar ionic molecules(2013)4 cited
- → Developing a Hardware Approach to Simulating Quantum Computing Using an Optimization Algorithm(2021)1 cited
- → (2013)