The paper gives a QLSS with query complexity (1+O(ε))κ ln(2√2/ε) using one kernel reflection when ||x|| is known, or O(κ log(1/ε)) overall, with explicit bound 56κ + 1.05κ ln(1/ε).
The cost of solving linear differential equations on a quantum com- puter: fast-forwarding to explicit resource counts
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2024 2representative citing papers
Proposes multi-component bridge states outside cat code space for syndrome extraction in teleportation-based cat code QEC when nonlinear interactions are limiting.
citing papers explorer
-
A shortcut to an optimal quantum linear system solver
The paper gives a QLSS with query complexity (1+O(ε))κ ln(2√2/ε) using one kernel reflection when ||x|| is known, or O(κ log(1/ε)) overall, with explicit bound 56κ + 1.05κ ln(1/ε).
-
Use of Faulty States in Cat-Code Error Correction
Proposes multi-component bridge states outside cat code space for syndrome extraction in teleportation-based cat code QEC when nonlinear interactions are limiting.