Random circuits by measurements on weighted graph states

A. Douglas K. Plato, Oscar C. Dahlsten, and Martin B. Plenio
Phys. Rev. A 78, 042332 – Published 28 October 2008

Abstract

Random quantum circuits take an input quantum state and randomize it. This is a task with a growing number of identified uses in quantum-information processing. We suggest a scheme to implement random circuits in a weighted graph state. The input state is entangled with the weighted graph state and a random circuit is implemented when the experimenter performs local measurements in one fixed basis only. The scheme uses no classical random numbers and is a new and natural application of weighted graph states.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 18 June 2008

DOI:https://doi.org/10.1103/PhysRevA.78.042332

©2008 American Physical Society

Authors & Affiliations

A. Douglas K. Plato1,*, Oscar C. Dahlsten2,†, and Martin B. Plenio1,‡

  • 1Institute for Mathematical Sciences, Imperial College London, Prince’s Gate, London SW7 2PG, United Kingdom QOLS, Blackett Laboratory, Imperial College London, Prince Consort Road, London SW7 2BW, United Kingdom
  • 2Institute for Theoretical Physics, ETH Zurich, 8093 Zurich, Switzerland

  • *alexander.plato@imperial.ac.uk
  • dahlsten@phys.ethz.ch
  • m.plenio@imperial.ac.uk

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 78, Iss. 4 — October 2008

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×