arXiv subjects

Kovid Goyal

Publications and source records attributed to Kovid Goyal.

4 recordsLinked to original sources

arXiv2009

Topological cluster state quantum computing

The quantum computing scheme described in Phys. Rev. Lett. 98, 190504 (2007), when viewed as a cluster state computation, features a 3-D cluster state, novel adjustable strength error correction capable of correcting general errors through the correction of Z errors only, a threshold error rate approaching 1% and low overhead arbitrarily long-range logical gates. In this work, we review the scheme in detail framing discussion solely in terms of the required 3-D cluster state and its stabilizers.

quant-ph↗

arXiv2007

Topological fault-tolerance in cluster state quantum computation

We describe a fault-tolerant version of the one-way quantum computer using a cluster state in three spatial dimensions. Topologically protected quantum gates are realized by choosing appropriate boundary conditions on the cluster. We provide equivalence transformations for these boundary conditions that can be used to simplify fault-tolerant circuits and to derive circuit identities in a topological manner. The spatial dimensionality of the scheme can be reduced to two by converting one spatial axis of the cluster into time. The error threshold is 0.75% for each source in an error model with preparation, gate, storage and measurement errors. The operational overhead is poly-logarithmic in the circuit size.

quant-ph↗

arXiv2006

Purification of large bicolorable graph states

We describe novel purification protocols for bicolorable graph states. The protocols scale efficiently for large graph states. We introduce a method of analysis that allows us to derive simple recursion relations characterizing their behavior as well as analytical expressions for their thresholds and fixed point behavior. We introduce two purification protocols with high threshold. They can, for graph degree four, tolerate 1% (3%) gate error or 20% (30%) local error.

quant-ph↗

arXiv2003

Noise induced loss of entanglement

The disentangling effect of repeated applications of the bit flip channel (I\otimesσ_x) on bipartite qubit systems is analyzed. It is found that the rate of loss of entanglement is not uniform over all states. The distillable entanglement of maximally entangled states decreases faster than that of less entangled states. The analysis is also generalized to noise channels of the form n.sigma.

quant-ph↗