Impact of qubit connectivity on quantum algorithm performance
arXiv:1811.02125 · doi:10.1088/2058-9565/ab73e0
Abstract
Quantum computing hardware is undergoing rapid development from proof-of-principle devices to scalable machines that could eventually challenge classical supercomputers on specific tasks. On platforms with local connectivity, the transition from one- to two-dimensional arrays of qubits is seen as a natural technological step to increase the density of computing power and to reduce the routing cost of limited connectivity. Here we map and schedule representative algorithmic workloads - the Quantum Fourier Transform (QFT) relevant to factoring, the Grover diffusion operator relevant to quantum search, and Jordan-Wigner parity rotations relevant to simulations of quantum chemistry and materials science - to qubit arrays with varying connectivity. In particular we investigate the impact of restricting the ideal all-to-all connectivity to a square grid, a ladder and a linear array of qubits. Our schedule for the QFT on a ladder results in running time close to that of a system with all-to-all connectivity. Our results suggest that some common quantum algorithm primitives can be optimized to have execution times on systems with limited connectivities, such as a ladder and linear array, that are competitive with systems that have all-to-all connectivity
References in corpus (24)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Mechanics helps in searching for a needle in a haystack
- Elementary gates for quantum computation
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Topological quantum memory
- Quantum Amplitude Amplification and Estimation
- Scalable multi-particle entanglement of trapped ions
- State preservation by repetitive error detection in a superconducting quantum circuit
- A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
- Demonstration of a small programmable quantum computer with atomic qubits
- Simulation of Electronic Structure Hamiltonians Using Quantum Computers
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- Quantum Algorithms for Fermionic Simulations
- Scalable gate architecture for densely packed semiconductor spin qubits
- Blueprint for a microwave trapped-ion quantum computer
- A Crossbar Network for Silicon Quantum Dot Qubits
- Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
- Layered architecture for quantum computing
- Scalable quantum circuit and control for a superconducting surface code
- Structure of 2D Topological Stabilizer Codes
- Two-step approach to scheduling quantum circuits
- Noise gates for decoherent quantum circuits
- Efficient implementations of the Quantum Fourier Transform: an experimental perspective
Cited by in corpus (22)
- The Bitter Truth About Quantum Algorithms in the NISQ Era
- Resource-efficient digital quantum simulation of -level systems for photonic, vibrational, and spin- Hamiltonians
- Biology and medicine in the landscape of quantum advantages
- Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in VQE
- Fully tunable longitudinal spin-photon interactions in Si and Ge quantum dots
- Quantum algorithm for credit valuation adjustments
- A Toffoli Gate Decomposition via Echoed Cross-Resonance Gates
- Applications of Universal Parity Quantum Computation
- Engineering Cross Resonance Interaction in Multi-modal Quantum Circuits
- Non-Local Multi-Qubit Quantum Gates via a Driven Cavity
- Entanglement bounds on the performance of quantum computing architectures
- Benchmarking Quantum Computers: Towards a Standard Performance Evaluation Approach
- On connectivity-dependent resource requirements for digital quantum simulation of -level particles
- Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement
- Qubit assignment using time reversal
- Constant Depth Code Deformations in the Parity Architecture
- SWAP-less Implementation of Quantum Algorithms
- Comparing planar quantum computing platforms at the quantum speed limit
- Quantum error detection in qubit-resonator star architecture
- Bilayer Ion Trap Design for 2D Arrays
- Achieving computational gains with quantum error-correction primitives: Generation of long-range entanglement enhanced by error detection
- Cavity polariton blockade for non-local entangling gates with trapped atoms