Explicit Lower Bounds on Strong Quantum Simulation

DOI10.1109/TIT.2020.3004427zbMath1448.68243arXiv1804.10368OpenAlexW3037871222MaRDI QIDQ5124525

No author found.

Publication date: 29 September 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.10368

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Trading locality for time: certifiable randomness from low-depth circuits

This page was built for publication: Explicit Lower Bounds on Strong Quantum Simulation