Local variational quantum compilation of a large-scale Hamiltonian dynamics

Abstract

Implementing time evolution operators on quantum circuits is important for quantum simulation. However, the standard way, Trotterization, requires a huge numbers of gates to achieve desirable accuracy. Here, we propose a local variational quantum compilation (LVQC) algorithm, which allows to accurately and efficiently compile a time evolution operators on a large-scale quantum system by the optimization with smaller-size quantum systems. LVQC utilizes a subsystem cost function, which approximates the fidelity of the whole circuit, defined for each subsystem as large as approximate causal cones brought by the Lieb-Robinson (LR) bound. We rigorously derive its scaling property with respect to the subsystem size, and show that the optimization conducted on the subsystem size leads to the compilation of whole-system time evolution operators. As a result, LVQC runs with limited-size quantum computers or classical simulators that can handle such smaller quantum systems. For instance, finite-ranged and short-ranged interacting $L$-size systems can be compiled with $O(L^0)$- or $O(\log L)$-size quantum systems depending on observables of interest. Furthermore, since this formalism relies only on the LR bound, it can efficiently construct time evolution operators of various systems in generic dimension involving finite-, short-, and long-ranged interactions. We also numerically demonstrate the LVQC algorithm for one-dimensional systems. Employing classical simulation by time-evolving block decimation, we succeed in compressing the depth of a time evolution operators up to $40$ qubits by the compilation for $20$ qubits. LVQC not only provides classical protocols for designing large-scale quantum circuits, but also will shed light on applications of intermediate-scale quantum devices in implementing algorithms in larger-scale quantum devices.

arXiv comment21 pages, 7 figures

References in corpus (46)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Quantum Computing in the NISQ era and beyond
• The density-matrix renormalization group in the age of matrix product states
• Variational Quantum Algorithms
• Efficient classical simulation of slightly entangled quantum computations
• Efficient simulation of one-dimensional quantum many-body systems
• Quantum Algorithms Revisited
• On the Power of One Bit of Quantum Information
• Hamiltonian Simulation by Qubitization
• Scalable Quantum Simulation of Molecular Energies
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Efficient variational quantum simulator incorporating active error minimisation
• Universal digital quantum simulation with trapped ions
• Spectral Gap and Exponential Decay of Correlations
• Ab Initio Quantum Chemistry using the Density Matrix Renormalization Group
• A Theory of Trotter Error
• Theory of variational quantum simulation
• Lieb-Robinson Bounds and the Exponential Clustering Theorem
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Quantum-assisted quantum compiling
• A random compiler for fast Hamiltonian simulation
• Observation of Time-Crystalline Eigenstate Order on a Quantum Processor
• The density matrix renormalization group for ab initio quantum chemistry
• Simulating quantum many-body dynamics on a current digital quantum computer
• Variational quantum simulation of general processes
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Propagation of Correlations in Quantum Lattice Systems
• Nearly-linear light cones in long-range interacting quantum systems
• Real- and imaginary-time evolution with compressed quantum circuits
• Observation of a many-body-localized discrete time crystal with a programmable spin-based quantum simulator
• Noise Resilience of Variational Quantum Compiling
• Faster quantum simulation by randomization
• Hardware-efficient variational quantum algorithms for time evolution
• Strictly linear light cones in long-range interacting systems of arbitrary dimensions
• Higher Order Methods for Simulations on Quantum Computers
• The Lieb-Robinson light cone for power-law interactions
• Calculation of the Green's function on near-term quantum computers
• An improved Lieb-Robinson bound for many-body Hamiltonians with power-law interactions
• Accurately computing electronic properties of a quantum ring
• Impossibility of Classically Simulating One-Clean-Qubit Computation
• Robust quantum compilation and circuit optimisation via energy minimisation
• Compilation by stochastic Hamiltonian sparsification
• Light Cone Matrix Product
• Improving the Lieb-Robinson bound for long-range interactions
• Probing many-body localization on a noisy quantum computer

Cited by in corpus (15)

• Classically optimized Hamiltonian simulation
• Noise-assisted digital quantum simulation of open systems
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
• Variational quantum simulation: a case study for understanding warm starts
• Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits
• Localized Virtual Purification
• Computation of Green's function by local variational quantum compilation
• The power and limitations of learning quantum dynamics incoherently
• Assisted quantum simulation of open quantum systems
• Variational Phase Estimation with Variational Fast Forwarding
• Accelerating two-dimensional electronic spectroscopy simulations with a probe qubit protocol
• Subspace-Based Local Compilation of Variational Quantum Circuits for Large-Scale Quantum Many-Body Simulation
• Deep Circuit Compression for Quantum Dynamics via Tensor Networks
• Optimal compression of constrained quantum time evolution
• Fast-forwardability of Qubit-mapped Fermion models based on Cartan decomposition