Computational complexity and applications of quantum algorithm

DOI10.1016/J.AMC.2011.05.024zbMath1245.81021OpenAlexW2053599681MaRDI QIDQ440659

Masanori Ohya, Satoshi Iriyama

Publication date: 19 August 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.05.024

zbMATH Keywords

computational complexityquantum algorithmquantum Turing machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Related Items (1)

Performance of Grover's search algorithm with diagonalizable collective noises

Cites Work

• Unnamed Item
• Unnamed Item
• Note on a universal quantum Turing machine
• Mathematical foundations of quantum information and computation and its applications to nano- and bio-systems
• Complexities and their applications to characterization of chaos
• Compound channels, transition expectations, and liftings
• New quantum algorithm for studying NP-complete problems
• Ubiquitous Quantum Structure
• Rigorous Estimation of Computational Complexity for OMV SAT Algorithm
• Language Classes Defined by Generalized Quantum Turing Machine
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum complexity theory

This page was built for publication: Computational complexity and applications of quantum algorithm