Comparing planar quantum computing platforms at the quantum speed limit
arXiv:2304.01756 · doi:10.1103/PhysRevResearch.6.023026
Abstract
An important aspect that strongly impacts the experimental feasibility of quantum circuits is the ratio of gate times and typical error time scales. Algorithms with circuit depths that significantly exceed the error time scales will result in faulty quantum states and error correction is inevitable. We present a comparison of the theoretical minimal gate time, i.e., the quantum speed limit (QSL), for realistic two- and multi-qubit gate implementations in neutral atoms and superconducting qubits. Subsequent to finding the QSLs for individual gates by means of optimal control theory we use them to quantify the circuit QSL of the quantum Fourier transform and the quantum approximate optimization algorithm. In particular, we analyze these quantum algorithms in terms of circuit run times and gate counts both in the standard gate model and the parity mapping. We find that neutral atom and superconducting qubit platforms show comparable weighted circuit QSLs with respect to the system size.
20 pages, 5 figures
References in corpus (19)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Charge insensitive qubit design derived from the Cooper pair box
- Probing many-body dynamics on a 51-atom quantum simulator
- Quantum computational advantage using photons
- Coupling Superconducting Qubits via a Cavity Bus
- Strong quantum computational advantage using a superconducting quantum processor
- Many-Body Physics with Individually-Controlled Rydberg Atoms
- Simple pulses for elimination of leakage in weakly nonlinear qubits
- Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer
- Quantum computing with neutral atoms
- Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
- tket : A Retargetable Compiler for NISQ Devices
- Fast and robust two-qubit gates for scalable ion trap quantum computing
- Quantum brachistochrone curves as geodesics: obtaining accurate control protocols for time-optimal quantum gates
- QuOCS: The Quantum Optimal Control Suite
- Quantum brachistochrone problem for spin-1 in a magnetic field
- Quantum Optimal Control via Semi-Automatic Differentiation
- Modular Parity Quantum Approximate Optimization
- Quantum-brachistochrone approach to the conversion from to Greenberger-Horne-Zeilinger states for Rydberg-atom qubits