Tales from graphland

Recording Details

Speaker(s): 
Scientific Areas: 
PIRSA Number: 
08050016

Abstract

This talk will report recent work on two themes that relate concepts in graph theory to problems in quantum information theory. We will discuss the quantum analogue of expander graphs which prove to be of key importance when de-randomizing algorithms in classical computer science. Using powerful ideas of discrete phase space methods, efficiently implementable quantum expanders can be constructed based on an argument that barely fills three lines. We also briefly report news on novel measurement-based models of quantum computing, based on quantum systems distributed on a graph, beyond one-way computing. Work done in collaboration with D. Gross D. Gross, J. Eisert, \'Quantum Margulis expanders\', Quant. Inf. Comp. (2008), arXiv:0710.0651. D. Gross, J. Eisert, \'Quantum computational wires\', in preparation (2008). D. Gross, J. Eisert, N. Schuch, D. Perez-Garcia, \'Measurement-based quantum computation beyond the one-way model\', Phys. Rev. A 76, 052315 (2007), arXiv:0706.3401. D. Gross, J. Eisert, \'Novel schemes for measurement-based quantum computation\', Phys. Rev. Lett. 98, 220503 (2007).