Adding a fast-forwardable penalty projection to the generator of a quantum-simulated ODE enforces boundary conditions up to error ε, with gate complexity overhead O(log λ).
Thus, we will continue only with bounding the error in representing a difference formula, denoted by D, using our projection method
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Arbitrary Boundary Conditions and Constraints in Quantum Algorithms for Differential Equations via Penalty Projections
Adding a fast-forwardable penalty projection to the generator of a quantum-simulated ODE enforces boundary conditions up to error ε, with gate complexity overhead O(log λ).