Quantum computational complexity in curved spacetime

DOI10.1142/9789813109032_0009MaRDI QIDQ2973069zbMATH OpenOpenAlexFDO

Authors Marco Lanzagorta, Jeffrey Uhlmann

Publication date 31 March 2017

Published in Information and Complexity (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/bbcd7be30cad004984c88c9f95cd83d8c61a9b56

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum coding (general) (81P70) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Other types of codes (94B60)

Recommendations

• Quantum computation as geometry
• Noise effects in the quantum search algorithm from the viewpoint of computational complexity
• Error scaling in fault tolerant quantum computation
• Computational complexity and applications of quantum algorithm
• Complexity of Grover's algorithm: an algebraic approach

Cited in

(2)

• scientific article; zbMATH DE number 5082675 (Why is no real title available?)
• Quantum information processing in the neighborhood of a black hole

This page was built for publication: Quantum computational complexity in curved spacetime

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