A randomized algorithm recovers the exact Pauli decomposition of k-sparse n-qubit matrices in poly(n, k, log(1/δ)) time with high probability under sparse query access.
Efficient algorithm for generating Pauli coordinates for an arbitrary linear operator
3 Pith papers cite this work, alongside 5 external citations. Polarity classification is still indexing.
3
Pith papers citing it
5
external citations · external index
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Presents LCNU-plus-embedding data loading for any polynomial Carleman-linearized autonomous system and applies it to the 3D LBE, yielding Ns ~ O(α²Q²) terms and explicit T-gate resource estimates for two solvers.
Hybrid variational quantum algorithm solves the advection-diffusion equation on small systems using current noisy IBM quantum hardware, with claimed logarithmic scaling in vector space dimension.
citing papers explorer
-
An efficient Pauli decomposition algorithm for structured matrices
A randomized algorithm recovers the exact Pauli decomposition of k-sparse n-qubit matrices in poly(n, k, log(1/δ)) time with high probability under sparse query access.
-
Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation
Presents LCNU-plus-embedding data loading for any polynomial Carleman-linearized autonomous system and applies it to the 3D LBE, yielding Ns ~ O(α²Q²) terms and explicit T-gate resource estimates for two solvers.
-
Variational Quantum Solutions to the Advection-Diffusion Equation for Applications in Fluid Dynamics
Hybrid variational quantum algorithm solves the advection-diffusion equation on small systems using current noisy IBM quantum hardware, with claimed logarithmic scaling in vector space dimension.