Phase Estimation with Compressed Controlled Time Evolution

Abstract

Many optimally scaling quantum simulation algorithms employ controlled time evolution of the Hamiltonian, which is typically the major bottleneck for their efficient implementation. This work establishes a compression protocol for encoding the controlled time evolution operator of translationally invariant, local Hamiltonians into a quantum circuit. It achieves a near-optimal in time $t$ scaling for circuit depth $\mathcal{O}(t\text{ polylog}(tN/\epsilon ))$, while reducing the control overhead from a multiplicative to an additive factor. We report that this compression protocol enables the implementation of Iterative Quantum Phase Estimation with as few as 414 CNOT gates for a frustrated quantum spin system on a 6$\times$6 triangular lattice and delivers ground state energy errors below 1% (with $\pm$ 1.5% variation, calculated with a hardware noise aware pipeline) on a 4$\times$4 triangular lattice using the noisy emulator of the Quantinuum H2 trapped ion device.

References in corpus (43)

• A variational eigenvalue solver on a quantum processor
• Elementary gates for quantum computation
• The theory of variational hybrid quantum-classical algorithms
• Adiabatic Quantum Computing
• Quantum Algorithms Revisited
• Hamiltonian Simulation by Qubitization
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Lieb-Schultz-Mattis in Higher Dimensions
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Spectral Gap and Exponential Decay of Correlations
• Noise tailoring for scalable quantum computation via randomized compiling
• A Theory of Trotter Error
• A geometric theory of non-local two-qubit operations
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Quantum-assisted quantum compiling
• Real- and imaginary-time evolution with compressed quantum circuits
• Nearly optimal lattice simulation by product formulas
• Higher Order Decompositions of Ordered Operator Exponentials
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
• Fast-forwarding of Hamiltonians and Exponentially Precise Measurements
• Hamiltonian Simulation with Optimal Sample Complexity
• Minimum construction of two-qubit quantum operations
• Experimentally scalable protocol for identification of correctable codes
• Recognizing Small-Circuit Structure in Two-Qubit Operators and Timing Hamiltonians to Compute Controlled-Not Gates
• Quantum algorithms: A survey of applications and end-to-end complexities
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution
• On low-depth algorithms for quantum phase estimation
• Variational Hamiltonian simulation for translational invariant systems via classical pre-processing
• Simultaneous estimation of multiple eigenvalues with short-depth quantum circuit on early fault-tolerant quantum computers
• Quantum Resources Required to Block-Encode a Matrix of Classical Data
• Optimal compression of quantum many-body time evolution operators into brickwall circuits
• Native two-qubit gates in fixed-coupling, fixed-frequency transmons beyond cross-resonance interaction
• Riemannian quantum circuit optimization for Hamiltonian simulation
• Tensor-based quantum phase difference estimation for large-scale demonstration
• Group twirling and noise tailoring for multi-qubit controlled phase gates
• Riemannian quantum circuit optimization based on matrix product operators
• Optimal-order Trotter-Suzuki decomposition for quantum simulation on noisy quantum computers
• Filter-enhanced adiabatic quantum computing on a digital quantum processor
• Hardware-efficient quantum phase estimation via local control
• Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering

Cited by in corpus (1)

• Tensor-based phase difference estimation on time series analysis