Classical simulation versus universality in measurement based quantum computation
arXiv:quant-ph/0608060 · doi:10.1103/PhysRevA.75.012337
Abstract
We investigate for which resource states an efficient classical simulation of measurement based quantum computation is possible. We show that the Schmidt--rank width, a measure recently introduced to assess universality of resource states, plays a crucial role in also this context. We relate Schmidt--rank width to the optimal description of states in terms of tree tensor networks and show that an efficient classical simulation of measurement based quantum computation is possible for all states with logarithmically bounded Schmidt--rank width (with respect to the system size). For graph states where the Schmidt--rank width scales in this way, we efficiently construct the optimal tree tensor network descriptions, and provide several examples. We highlight parallels in the efficient description of complex systems in quantum information theory and graph theory.
16 pages, 4 figures
References in corpus (4)
Cited by in corpus (11)
- Novel schemes for measurement-based quantum computation
- On the role of entanglement and correlations in mixed-state quantum computation
- Measurement-based quantum computation beyond the one-way model
- Fundamentals of universality in one-way quantum computation
- On measurement-based quantum computation with the toric code states
- Efficient classical simulation of the approximate quantum Fourier transform
- Measurement-based quantum computation and undecidable logic
- Classical simulability and the significance of modular exponentiation in Shor's algorithm
- Epsilon-measures of entanglement
- Classical spin systems and the quantum stabilizer formalism: general mappings and applications
- What Can be Observed Locally? Round-based Models for Quantum Distributed Computing