On the need for large Quantum depth

DOI10.1145/3357713.3384291MaRDI QIDQ5144976zbMATH OpenOpenAlexWikidataFDO

Authors Nai-Hui Chia, Kai-Min Chung, Ching-Yi Lai

Publication date 19 January 2021

Published in Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

d-shuffling Simon's problemhybrid quantum-classical computernear-term quantum computeroracle separationsmall-depth quantum circuit

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Optimizing the depth of quantum implementations of linear layers
• The need for structure in quantum speedups
• Depth optimization for topological quantum circuits
• Reducing the Depth of Quantum Circuits Using Additional Circuit Lines
• Computational Depth Complexity of Measurement-Based Quantum Computation
• Efficient depth selection for the implementation of noisy quantum approximate optimization algorithm
• Comment on ``Nonclassical depth of the phase state
• Computations with greater Quantum depth are strictly more powerful (relative to an oracle)
• Fundamentals of Computation Theory
• A quantum subgroup depth

Cited in

(5)

• Average-case quantum advantage with shallow circuits
• Quantum depth in the random oracle model
• Exact distributed quantum algorithm for generalized Simon's problem
• On the need for large quantum depth
• Syndrome decoding by quantum approximate optimization

This page was built for publication: On the need for large Quantum depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144976)