A Caltech Library Service

Using graph states for quantum computation and communication


Goyal, Kovid (2009) Using graph states for quantum computation and communication. Dissertation (Ph.D.), California Institute of Technology.


In this work, we describe a method to achieve fault tolerant measurement based quantum computation in two and three dimensions. The proposed scheme has an threshold of 7.8*10^-3 and poly-logarithmic overhead scaling. The overhead scaling below the threshold is also studied. The scheme uses a combination of topological error correction and magic state distillation to construct a universal quantum computer on a qubit lattice. The chapters on measurement based quantum computation are written in review form with extensive discussion and illustrative examples.

In addition, we describe and analyze a family of entanglement purification protocols that provide a flexible trade-off between overhead, threshold and output quality. The protocols are studied analytically, with closed form expressions for their threshold.

Item Type:Thesis (Dissertation (Ph.D.))
Subject Keywords:entanglement; fault tolerance; graph states; purification; quantum computation
Degree Grantor:California Institute of Technology
Division:Physics, Mathematics and Astronomy
Major Option:Physics
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Preskill, John P.
Thesis Committee:
  • Preskill, John P. (chair)
  • Kitaev, Alexei
  • Wise, Mark B.
  • Yeh, Nai-Chang
Defense Date:22 May 2009
Record Number:CaltechETD:etd-05272009-130323
Persistent URL:
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:2177
Deposited By: Imported from ETD-db
Deposited On:29 May 2009
Last Modified:26 Dec 2012 02:47

Thesis Files

PDF (kovid_thesis.pdf) - Final Version
See Usage Policy.


Repository Staff Only: item control page