Translating non-trivial algorithms from the circuit model to the measurement-based quantum computing model

DOI10.1080/09500340.2015.1014437MaRDI QIDQ2962900zbMATH OpenOpenAlexFDO

Authors A. Matthew Smith, G. E. Lott, M. L. Fanto, Paul M. Alsing

Publication date 17 February 2017

Published in Journal of Modern Optics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09500340.2015.1014437

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Scheme for Implementing Quantum Search Algorithm in a Cluster State Quantum Computer
• scientific article; zbMATH DE number 5320278
• The Role of Classical Computation in Measurement-Based Quantum Computation
• scientific article; zbMATH DE number 1406145
• MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES

Cites work

• scientific article; zbMATH DE number 5076264 (Why is no real title available?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Teleportation-based Toffoli gate on cluster states via the Bell state analysis

This page was built for publication: Translating non-trivial algorithms from the circuit model to the measurement-based quantum computing model

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