Huy Nguyên Lê, Yu Cai, Xingyao Wu, Valerio Scarani
We give an explicit construction for classes of quantum states of qubits, whose complexity grows super-polynomially in the number of qubits. The complexity measure considered is the tree size of a quantum state, which is in principle computable and closely related to the size of a multi-linear formula. The properties of these states are discussed, with particular attention to their multi-partite entanglement.
View original:
http://arxiv.org/abs/1303.4843
No comments:
Post a Comment