scholarly journals Experimental measurement-based quantum computing beyond the cluster-state model

2011 ◽  
Vol 5 (2) ◽  
pp. 117-123 ◽  
Author(s):  
Wei-Bo Gao ◽  
Xing-Can Yao ◽  
Jian-Ming Cai ◽  
He Lu ◽  
Ping Xu ◽  
...  
2007 ◽  
Vol 7 (3) ◽  
pp. 184-208
Author(s):  
W. Hall

The cluster state model for quantum computation [Phys. Rev. Lett. \textbf{86}, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum computations. The model itself and many works dedicated to it involve using entangled qubits. In this paper we consider the issue of using entangled qudits instead. We present a complete framework for cluster state quantum computation using qudits, which not only contains the features of the original qubit model but also contains the new idea of adaptive computation: via a change in the classical computation that helps to correct the errors that are inherent in the model, the implemented quantum computation can be changed. This feature arises through the extra degrees of freedom that appear when using qudits. Finally, for prime dimensions, we give a very explicit description of the model, making use of mutually unbiased bases.


Science ◽  
2019 ◽  
Vol 366 (6463) ◽  
pp. 373-376 ◽  
Author(s):  
Warit Asavanant ◽  
Yu Shiozawa ◽  
Shota Yokoyama ◽  
Baramee Charoensombutamon ◽  
Hiroki Emura ◽  
...  

Entanglement is the key resource for measurement-based quantum computing. It is stored in quantum states known as cluster states, which are prepared offline and enable quantum computing by means of purely local measurements. Universal quantum computing requires cluster states that are both large and possess (at least) a two-dimensional topology. Continuous-variable cluster states—based on bosonic modes rather than qubits—have previously been generated on a scale exceeding one million modes, but only in one dimension. Here, we report generation of a large-scale two-dimensional continuous-variable cluster state. Its structure consists of a 5- by 1240-site square lattice that was tailored to our highly scalable time-multiplexed experimental platform. It is compatible with Bosonic error-correcting codes that, with higher squeezing, enable fault-tolerant quantum computation.


2009 ◽  
Vol 9 (9&10) ◽  
pp. 721-738 ◽  
Author(s):  
A.G. Fowler ◽  
K. Goyal

The quantum computing scheme described by Raussendorf et. al (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 the discussion solely in terms of the required 3-D cluster state and its stabilizers.


2009 ◽  
Vol 103 (24) ◽  
Author(s):  
D. N. Biggerstaff ◽  
R. Kaltenbaek ◽  
D. R. Hamel ◽  
G. Weihs ◽  
T. Rudolph ◽  
...  

2010 ◽  
Vol 82 (3) ◽  
Author(s):  
Dave Bacon ◽  
Steven T. Flammia

Nanophotonics ◽  
2017 ◽  
Vol 6 (3) ◽  
pp. 531-541 ◽  
Author(s):  
Hari Krovi

AbstractI review some work on models of quantum computing, optical implementations of these models, as well as the associated computational power. In particular, we discuss the circuit model and cluster state implementations using quantum optics with various encodings such as dual rail encoding, Gottesman-Kitaev-Preskill encoding, and coherent state encoding. Then we discuss intermediate models of optical computing such as boson sampling and its variants. Finally, we review some recent work in optical implementations of adiabatic quantum computing and analog optical computing. We also provide a brief description of the relevant aspects from complexity theory needed to understand the results surveyed.


2012 ◽  
Author(s):  
Paul Alsing ◽  
Michael Fanto ◽  
A. M. Smith

Sign in / Sign up

Export Citation Format

Share Document