On connectivity-dependent resource requirements for digital quantum simulation of $d$-level particles

Abstract

A primary objective of quantum computation is to efficiently simulate quantum physics. Scientifically and technologically important quantum Hamiltonians include those with spin-$s$, vibrational, photonic, and other bosonic degrees of freedom, i.e. problems composed of or approximated by $d$-level particles (qudits). Recently, several methods for encoding these systems into a set of qubits have been introduced, where each encoding's efficiency was studied in terms of qubit and gate counts. Here, we build on previous results by including effects of hardware connectivity. To study the number of SWAP gates required to Trotterize commonly used quantum operators, we use both analytical arguments and automatic tools that optimize the schedule in multiple stages. We study the unary (or one-hot), Gray, standard binary, and block unary encodings, with three connectivities: linear array, ladder array, and square grid. Among other trends, we find that while the ladder array leads to substantial efficiencies over the linear array, the advantage of the square over the ladder array is less pronounced. These results are applicable in hardware co-design and in choosing efficient qudit encodings for a given set of near-term quantum hardware. Additionally, this work may be relevant to the scheduling of other quantum algorithms for which matrix exponentiation is a subroutine.

arXiv commentAccepted to QCE20 (IEEE Quantum Week). Corrected erroneous circuits in Figure 3

References in corpus (34)

• A Quantum Engineer's Guide to Superconducting Qubits
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Trapped-Ion Quantum Computing: Progress and Challenges
• Fermionic quantum computation
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Prospects for Spin-Based Quantum Computing
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Cloud Quantum Computing of an Atomic Nucleus
• Boson Sampling for Molecular Vibronic Spectra
• Solving strongly correlated electron models on a quantum computer
• A Software Methodology for Compiling Quantum Programs
• Efficient multiphoton sampling of molecular vibronic spectra on a superconducting bosonic processor
• Resource-efficient digital quantum simulation of $d$-level systems for photonic, vibrational, and spin-$s$ Hamiltonians
• Quantum Hamiltonian Complexity
• Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
• Electron-Phonon Systems on a Universal Quantum Computer
• Superfast encodings for fermionic quantum simulation
• Digital quantum simulation of molecular vibrations
• Digital quantum computation of fermion-boson interacting systems
• Domain wall encoding of discrete variables for quantum annealing and QAOA
• Quantum algorithm for calculating molecular vibronic spectra
• Two-step approach to scheduling quantum circuits
• Quantum Simulations of Physics Problems
• Impact of qubit connectivity on quantum algorithm performance
• Digital quantum simulation of molecular dynamics and control
• Calculation of molecular vibrational spectra on a quantum annealer
• Variational Quantum Simulation of Ultrastrong Light-Matter Coupling
• Dilution effects in spin 7/2 systems. The case of the antiferromagnet GdRhIn${}_5$
• Estimating Franck-Condon factors using an NMR quantum processor
• Digital quantum simulation of linear and nonlinear optical elements
• Scheduler of quantum circuits based on dynamical pattern improvement and its application to hardware design

Cited by in corpus (4)

• Biology and medicine in the landscape of quantum advantages
• Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
• A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
• Expanding Hardware-Efficiently Manipulable Hilbert Space via Hamiltonian Embedding