State complexity and quantum computation

DOI10.1002/andp.201400199zbMath1329.81152arXiv1503.04017OpenAlexW3122549703WikidataQ59436223 ScholiaQ59436223MaRDI QIDQ3461969

Valerio Scarani, Yu Cai, Huy Nguyen le

Publication date: 4 January 2016

Published in: Annalen der Physik (Search for Journal in Brave)

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

zbMATH Keywords

complexityquantum computationtree size

Mathematics Subject Classification ID

Trees (05C05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup ⋮ The theory of variational hybrid quantum-classical algorithms

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• A simple division-free algorithm for computing determinants
• Multipartite entanglement and frustration
• QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
• SECOND QUANTIZED KOLMOGOROV COMPLEXITY
• Classical statistical mechanics approach to multipartite entanglement
• Statistical mechanics of multipartite entanglement
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Computational Complexity
• Quantum Kolmogorov complexity

This page was built for publication: State complexity and quantum computation