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
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01619864
Contributor : Damian Markham <>
Submitted on : Thursday, October 19, 2017 - 5:23:30 PM
Last modification on : Tuesday, May 14, 2019 - 10:45:58 AM

Links full text

Identifiers

Citation

Rawad Mezher, Joe Ghalbouni, Joseph Dgheim, Damian Markham. Efficient quantum pseudorandomness with simple graph states. Physical Review A, American Physical Society, 2018, ⟨10.1103/PhysRevA.97.022333⟩. ⟨hal-01619864⟩

Share

Metrics

Record views

149