Recognition: unknown
Hamiltonian Simulation Using Linear Combinations of Unitary Operations
read the original abstract
We present a new approach to simulating Hamiltonian dynamics based on implementing linear combinations of unitary operations rather than products of unitary operations. The resulting algorithm has superior performance to existing simulation algorithms based on product formulas and, most notably, scales better with the simulation error than any known Hamiltonian simulation technique. Our main tool is a general method to nearly deterministically implement linear combinations of nearby unitary operations, which we show is optimal among a large class of methods.
This paper has not been read by Pith yet.
Forward citations
Cited by 15 Pith papers
-
Analytical Angle-Finding and Series Expansions for Quantum Signal Processing via Orthogonal Polynomial Theory
Quantum signal processing angles admit closed-form expressions via orthogonal polynomial theory, allowing O(log(1/ε)) gate block-encodings of smooth functions through Hermite expansions and full characterization of SU...
-
Gauss law codes and vacuum codes from lattice gauge theories
Gauss law codes identify the full gauge-invariant sector as the code space while vacuum codes restrict to the matter vacuum, with the two shown to be unitarily equivalent for finite gauge groups.
-
Quantum Simulation of Differential-Algebraic Equations with Applications to Unsteady Stokes Flow
A new dilation embeds non-Hermitian DAE evolution into projected Hermitian quantum dynamics, enabling block encodings and QSVT for simulation of constrained systems like unsteady Stokes flow.
-
Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation
A new LCNU-to-LCU decomposition yields a quantum framework for Carleman-linearized lattice Boltzmann equations whose term count scales as O(α² Q²) and is independent of spatial or temporal grid points.
-
Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation
A new LCNU-to-LCU decomposition enables a generalized quantum framework for Carleman-linearized polynomial systems like the lattice Boltzmann equation, with Ns scaling as O(α² Q²) independent of spatial and temporal d...
-
Generalized Complexity Distances and Non-Invertible Symmetries
Non-invertible symmetries define quantum gates with generalized complexity distances, and simple objects in symmetry categories turn out to be computationally complex in concrete 4D and 2D QFT examples.
-
Explicit Block Encoding of Difference-of-Gaussian Operators on a Periodic Grid
Explicit block encoding of the DoG operator achieves constant subnormalization factor λ=2 and a closed-form success probability that scales as O(h^4) on fine grids.
-
Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fej\'er Filtering
CE-QAOA with finite layers achieves dimension-free success probability bounds q0 ≥ x/(1+x) via Fejér filtering under a wrapped phase-separation condition.
-
Finite Imaginary-Time Evolution for Polynomial Unconstrained Binary Optimization
FinITE gives an exact identity linking LCU success probability to ground-subspace fidelity for diagonal Pauli-Z Hamiltonians, yielding a closed-form imaginary-time threshold beta-star based on spectral gap and initial...
-
Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators
Qudit encodings for quadratic diagonal evolutions require exponentially stronger synthesis advantages than qubits to win asymptotically in product formulas but can yield constant-factor savings in LCU at low d.
-
Exponentially improved quantum simulation of scalar QFT
Diagonalizing field operators before Pauli-string decomposition exponentially cuts circuit depth and Trotter errors in 2+1D scalar QFT simulations, with faster local-truncation convergence for Lorentzian energy-energy...
-
An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics
An oracle-free Trotter-based quantum algorithm for nonadiabatic molecular dynamics achieves circuit depth advantages over QROM architectures and retains T-gate scalability compared to quantum signal processing.
-
Lindbladian Homotopy Analysis Method to Solve Nonlinear Partial Differential Equations
LHAM converts nonlinear PDEs into linear recursive systems via homotopy analysis and simulates them through Lindbladian quantum dynamics, achieving logarithmic Hilbert space scaling versus polynomial scaling in prior methods.
-
Schr\"odinger-Navier-Stokes Equation for the Quantum Simulation of Navier-Stokes Flows
A quantum algorithm for genuine Navier-Stokes equations is developed using Schrödinger-Navier-Stokes reformulation, Hamilton-Jacobi equations, and tensor-network Carleman embedding, with classical emulation shown for ...
-
Quantum algorithm for solving differential equations using SLAC derivatives
Efficient quantum block-encodings of SLAC first-order derivative and Laplacian operators are built with LCU, state preparation, wavelet multi-scale transforms, and preconditioning to solve PDEs via QLSA with analyzed ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.