Efficient quantum pseudorandomness with simple graph states
Abstract
Measurement based (MB) quantum computation allows for universal quantum computing by measuring individual qubits prepared in entangled multipartite states, known as graph states. Unless corrected for, the randomness of the measurements leads to the generation of ensembles of random unitaries, where each random unitary is identified with a string of possible measurement results. We show that repeating an MB scheme an efficient number of times, on a simple graph state, with measurements at fixed angles and no feed-forward corrections, produces a random unitary ensemble that is an {\epsilon}-approximate t-design on n-qubits. Unlike previous constructions, the graph is regular and is also a universal resource for measurement based quantum computing, closely related to the brickwork state
Cite
@article{arxiv.1709.08091,
title = {Efficient quantum pseudorandomness with simple graph states},
author = {Rawad Mezher and Joe Ghalbouni and Joseph Dgheim and Damian Markham},
journal= {arXiv preprint arXiv:1709.08091},
year = {2018}
}