Block encoding bosons by signal processing
arXiv:2408.16824 · doi:10.22331/q-2025-05-15-1747
Abstract
Block Encoding (BE) is a crucial subroutine in many modern quantum algorithms, including those with near-optimal scaling for simulating quantum many-body systems, which often rely on Quantum Signal Processing (QSP). Currently, the primary methods for constructing BEs are the Linear Combination of Unitaries (LCU) and the sparse oracle approach. In this work, we demonstrate that QSP-based techniques, such as Quantum Singular Value Transformation (QSVT) and Quantum Eigenvalue Transformation for Unitary Matrices (QETU), can themselves be efficiently utilized for BE implementation. Specifically, we present several examples of using QSVT and QETU algorithms, along with their combinations, to block encode Hamiltonians for lattice bosons, an essential ingredient in simulations of high-energy physics. We also introduce a straightforward approach to BE based on the exact implementation of Linear Operators Via Exponentiation and LCU (LOVE-LCU). We find that, while using QSVT for BE results in the best asymptotic gate count scaling with the number of qubits per site, LOVE-LCU outperforms all other methods for operators acting on up to qubits, highlighting the importance of concrete circuit constructions over mere comparisons of asymptotic scalings. Using LOVE-LCU to implement the BE, we simulate the time evolution of single-site and two-site systems in the lattice theory using the Generalized QSP algorithm and compare the gate counts to those required for Trotter simulation.
22 pages, 12 Figures, 2 Tables, 2 Appendices. Version published in Quantum
References in corpus (61)
- Hamiltonian Simulation by Qubitization
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Synthesis of Quantum Logic Circuits
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- A Theory of Trotter Error
- Quantum-Classical Computation of Schwinger Model Dynamics using Quantum Computers
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Quantum Simulation for High Energy Physics
- SU(2) non-Abelian gauge field theory in one dimension on digital quantum computers
- A Trailhead for Quantum Simulation of SU(3) Yang-Mills Lattice Gauge Theory in the Local Multiplet Basis
- Nearly optimal lattice simulation by product formulas
- Digitization of Scalar Fields for Quantum Computing
- Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
- Loop, String, and Hadron Dynamics in SU(2) Hamiltonian Lattice Gauge Theories
- Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
- Simulations of Subatomic Many-Body Physics on a Quantum Frequency Processor
- A resource efficient approach for quantum and classical simulations of gauge theories in particle physics
- A quantum algorithm for high energy physics simulations
- Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
- Quantum Simulation of Quantum Field Theory in the Light-Front Formulation
- BQP-completeness of Scattering in Scalar Quantum Field Theory
- Bravyi-Kitaev Superfast simulation of fermions on a quantum computer
- Preparations for Quantum Simulations of Quantum Chromodynamics in 1+1 Dimensions: (I) Axial Gauge
- Solving Gauss's Law on Digital Quantum Computers with Loop-String-Hadron Digitization
- Exponentially More Precise Quantum Simulation of Fermions in the Configuration Interaction Representation
- Preparations for Quantum Simulations of Quantum Chromodynamics in 1+1 Dimensions: (II) Single-Baryon -Decay in Real Time
- Single-particle digitization strategy for quantum computation of a scalar field theory
- A gauge redundancy-free formulation of compact QED with dynamical matter for quantum and classical computations
- General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory
- Quantum simulation of gauge theory via orbifold lattice
- Loop-string-hadron formulation of an SU(3) gauge theory with dynamical quarks
- Randomizing multi-product formulas for Hamiltonian simulation
- Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
- FABLE: Fast Approximate Quantum Circuits for Block-Encodings
- Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers
- Multivariable quantum signal processing (M-QSP): prophecies of the two-headed oracle
- Quench dynamics of the Schwinger model via variational quantum algorithms
- Nearly-optimal state preparation for quantum simulations of lattice gauge theories
- Exponential improvements in the simulation of lattice gauge theories using near-optimal techniques
- Loop-string-hadron approach to SU(3) lattice Yang-Mills theory: I. Hilbert space of a trivalent vertex
- Doubling Efficiency of Hamiltonian Simulation via Generalized Quantum Signal Processing
- Minimum Trotterization Formulas for a Time-Dependent Hamiltonian
- Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations
- Efficient and practical Hamiltonian simulation from time-dependent product formulas
- Selection and improvement of product formulae for best performance of quantum simulation
- Efficient quantum implementation of 2+1 U(1) lattice gauge theories with Gauss law constraints
- Explicit block encodings of boundary value problems for many-body elliptic operators
- Quantum Simulations of Dark Sector Showers
- On multivariate polynomials achievable with quantum signal processing
- Solving lattice gauge theories using the quantum Krylov algorithm and qubitization
- Overcoming exponential scaling with system size in Trotter-Suzuki implementations of constrained Hamiltonians: 2+1 U(1) lattice gauge theories
- Comment on "Multivariable quantum signal processing (M-QSP): prophecies of the two-headed oracle"
- Quantum Algorithms for Simulating Nuclear Effective Field Theories
- Quantum Simulation of SU(3) Lattice Yang Mills Theory at Leading Order in Large N
- Exponentially Reduced Circuit Depths Using Trotter Error Mitigation
- On variants of multivariate quantum signal processing and their characterizations
- Randomly Compiled Quantum Simulation with Exponentially Reduced Circuit Depths
- Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla
- Multivariable QSP and Bosonic Quantum Simulation using Iterated Quantum Signal Processing
Cited by in corpus (3)
- Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
- Scalable Quantum Computational Science: A Perspective from Block-Encodings and Polynomial Transformations
- An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations