CLUSTER STATE QUANTUM COMPUTATION AND THE REPEAT-UNTIL-SUCCESS SCHEME

DOI10.1142/S0217979208046025zbMATH Open1192.81086OpenAlexW1968487233WikidataQ63255633 ScholiaQ63255633MaRDI QIDQ3532344FDOQ3532344

Authors: L. C. Kwek 

Publication date: 3 November 2008

Published in: International Journal of Modern Physics B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217979208046025

Recommendations

• MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES
• Hybrid quantum computation based on repeat-until-success scheme
• Cluster-state quantum computation
• scientific article
• The one-way quantum computer--a non-network model of quantum computation

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Quantum computational networks
• A universal two-bit gate for quantum computation

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hybrid quantum computation based on repeat-until-success scheme
• Scheme for efficient construction of 2-dimensional qutrit cluster state
• CONTROLLING THE QUANTUM COMPUTATIONAL SPEED
• Scheme for Implementing Quantum Search Algorithm in a Cluster State Quantum Computer
• Title not available (Why is that?)
• AN ECONOMICAL ROUTE TO ONE-WAY QUANTUM COMPUTATION
• Cluster states from Heisenberg interactions

This page was built for publication: CLUSTER STATE QUANTUM COMPUTATION AND THE REPEAT-UNTIL-SUCCESS SCHEME

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3532344)