Augmented index and quantum streaming algorithms for \textsc{Dyck}(2)
From MaRDI portal
Publication:5111153
Abstract: We show how two recently developed quantum information theoretic tools can be applied to obtain lower bounds on quantum information complexity. We also develop new tools with potential for broader applicability, and use them to establish a lower bound on the quantum information complexity for the Augmented Index function on an easy distribution. This approach allows us to handle superpositions rather than distributions over inputs, the main technical challenge faced previously. By providing a quantum generalization of the argument of Jain and Nayak [IEEE TIT'14], we leverage this to obtain a lower bound on the space complexity of multi-pass, unidirectional quantum streaming algorithms for the DYCK(2) language.
Recommendations
- Information cost tradeoffs for augmented index and streaming language recognition
- Recognizing well-parenthesized expressions in the streaming model
- Recognizing well-parenthesized expressions in the streaming model
- Quantum online streaming algorithms with logarithmic memory
- Quantum information complexity
This page was built for publication: Augmented index and quantum streaming algorithms for \textsc{Dyck}(2)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111153)