TL;DR
This paper demonstrates that quantum algorithms with intermediate measurements can be simulated by purely unitary quantum algorithms with only polynomial overhead in time and space, using pseudorandom generators to replace randomness.
Contribution
It introduces a method to simulate measurement-based quantum algorithms with unitary-only algorithms, leveraging pseudorandom generators for quantum space-bounded computation.
Findings
Quantum algorithms with intermediate measurements can be simulated unitarily.
INW pseudorandom generator fools quantum space-bounded algorithms.
Simulation achieves polynomial overhead in time and space.
Abstract
We show that quantum algorithms of time and space with unitary operations and intermediate measurements can be simulated by quantum algorithms of time and space with unitary operations and without intermediate measurements. The best results prior to this work required either space (by the deferred measurement principle) or time [FR21,GRZ21]. Our result is thus a time-efficient and space-efficient simulation of algorithms with unitary operations and intermediate measurements by algorithms with unitary operations and without intermediate measurements. To prove our result, we study pseudorandom generators for quantum space-bounded algorithms. We show that (an instance of) the INW pseudorandom generator for classical space-bounded algorithms [INW94] also fools quantum space-bounded…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Eliminating Intermediate Measurements using Pseudorandom Generators· youtube
