Please use this identifier to cite or link to this item:
|Title:||Tree-size complexity of multiqubit states|
|Citation:||Nguyên, L.H., Cai, Y., Wu, X., Scarani, V. (2013-07-22). Tree-size complexity of multiqubit states. Physical Review A - Atomic, Molecular, and Optical Physics 88 (1) : -. ScholarBank@NUS Repository. https://doi.org/10.1103/PhysRevA.88.012321|
|Abstract:||Complexity is often invoked alongside size and mass as a characteristic of macroscopic quantum objects. In 2004, Aaronson introduced the tree size (TS) as a computable measure of complexity and studied its basic properties. In this paper, we improve and expand on those initial results. In particular, we give explicit characterizations of a family of states with superpolynomial complexity nΩ(logn)=TS=O(√n!) in the number of qubits n, and we show that any matrix-product state whose tensors are of dimension D×D has polynomial complexity TS=O(nlog22D). © 2013 American Physical Society.|
|Source Title:||Physical Review A - Atomic, Molecular, and Optical Physics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 16, 2018
WEB OF SCIENCETM
checked on Oct 1, 2018
checked on May 11, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.