  Quantum algorithms provide an exponential speedup for solving certain classes
of linear systems, including those that model geologic fracture flow. However,
this revolutionary gain in efficiency does not come without difficulty. Quantum
algorithms require that problems satisfy not only algorithm-specific
constraints, but also application-specific ones. Otherwise, the quantum
advantage carefully attained through algorithmic ingenuity can be entirely
negated. Previous work addressing quantum algorithms for geologic fracture flow
has illustrated core algorithmic approaches while incrementally removing
assumptions. This work addresses two further requirements for solving geologic
fracture flow systems with quantum algorithms: efficient system state
preparation and efficient information extraction. Our approach to addressing
each is consistent with an overall exponential speed-up.
