Geodesic derivative in quantum circuit complexity analysis

DOI10.1080/09500340.2010.493245zbMATH Open1206.81031OpenAlexW2028726143MaRDI QIDQ3072483

Howard E. Brandt

Publication date: 3 February 2011

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

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

zbMATH Keywords

geodesicsJacobi fieldsquantum computingquantum complexityquantum circuits

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity and performance of numerical algorithms (65Y20) Combinatorial complexity of geometric structures (52C45) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• A Panoramic View of Riemannian Geometry
• Title not available (Why is that?)
• Title not available (Why is that?)

Related Items (2)

Duality quantum computer and the efficient quantum simulations ⋮ Differential geometric treewidth estimation in adiabatic quantum computation

This page was built for publication: Geodesic derivative in quantum circuit complexity analysis

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