Ladder Operator Block-Encoding
arXiv:2503.11641 · doi:10.22331/q-2025-12-22-1953
Abstract
We describe and analyze LOBE (Ladder Operator Block-Encoding), a framework for block-encoding ladder operators that act upon fermionic and bosonic modes. In this framework, we achieve efficient block-encodings by applying the desired action of the operator onto the quantum state and pushing any undesired effects outside of the encoded subspace. This direct approach avoids any overhead caused by expanding the operators in another basis. We numerically benchmark these constructions using models arising in quantum field theories including the quartic harmonic oscillator, and and Yukawa Hamiltonians on the light front. These benchmarks show that LOBE often produces block-encodings with fewer non-Clifford operations, fewer block-encoding ancillae and overall number of qubits, and lower rescaling factors for various operators as compared to frameworks that expand the ladder operators in the Pauli basis. LOBE constructions also demonstrate favorable scaling with respect to key parameters, including the maximum occupation of bosonic modes, the total number of fermionic and bosonic modes, and the locality of the operators. LOBE is implemented as an open-source python package to enable further applications.
Published in Quantum; Accepted Nov. 30th, 2025
References in corpus (46)
- A variational eigenvalue solver on a quantum processor
- Quantum computational chemistry
- Quantum Chemistry in the Age of Quantum Computing
- Simulated Quantum Computation of Molecular Energies
- Logical quantum processor based on reconfigurable atom arrays
- Universal computation by quantum walk
- Hamiltonian Simulation by Qubitization
- Scalable Quantum Simulation of Molecular Energies
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Hartree-Fock on a superconducting qubit quantum computer
- Quantum error correction below the surface code threshold
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Quantum Algorithms for Quantum Field Theories
- A Theory of Trotter Error
- Polynomial-time quantum algorithm for the simulation of chemical dynamics
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Hamiltonian simulation with nearly optimal dependence on all parameters
- Quantum Simulation for High Energy Physics
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- Halving the cost of quantum addition
- Creating superpositions that correspond to efficiently integrable probability distributions
- Quantum circuits of T-depth one
- Novel constructions for the fault-tolerant Toffoli gate
- Adiabatic Quantum Simulation of Quantum Chemistry
- Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
- Resource-efficient digital quantum simulation of -level systems for photonic, vibrational, and spin- Hamiltonians
- Hamiltonian Simulation Using Linear Combinations of Unitary Operations
- Quantum Algorithm for Spectral Measurement with Lower Gate Count
- Quantum Simulation of Quantum Field Theory in the Light-Front Formulation
- Efficient quantum computation of molecular forces and other energy gradients
- Black-box Hamiltonian simulation and unitary implementation
- FABLE: Fast Approximate Quantum Circuits for Block-Encodings
- Lecture Notes on Quantum Algorithms for Scientific Computation
- Contextual Subspace Variational Quantum Eigensolver
- Exponential improvements in the simulation of lattice gauge theories using near-optimal techniques
- A stabilizer framework for Contextual Subspace VQE and the noncontextual projection ansatz
- Contextual Subspace Variational Quantum Eigensolver Calculation of the Dissociation Curve of Molecular Nitrogen on a Superconducting Quantum Computer
- Explicit Quantum Circuit for Simulating the Advection-Diffusion-Reaction Dynamics
- Unitary Partitioning and the Contextual Subspace Variational Quantum Eigensolver
- The Solovay-Kitaev algorithm
- Elementary example of exact effective-Hamiltonian computation
- A universal framework for the quantum simulation of Yang-Mills theory
- Multi-qubit Toffoli with exponentially fewer T gates