{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/qgopt-riemannian-optimization-for-quantum","title":"QGOpt: Riemannian optimization for quantum technologies","arxiv_id":"2011.01894","date":"2020-11-03","proceeding":null,"authors":["I. A. Luchnikov","A. Ryzhov","S. N. Filippov","H. Ouerdane"],"abstract":"Many theoretical problems in quantum technology can be formulated and addressed as constrained optimization problems. The most common quantum mechanical constraints such as, e.g., orthogonality of isometric and unitary matrices, CPTP property of quantum channels, and conditions on density matrices, can be seen as quotient or embedded Riemannian manifolds. This allows to use Riemannian optimization techniques for solving quantum-mechanical constrained optimization problems. In the present work, we introduce QGOpt, the library for constrained optimization in quantum technology. QGOpt relies on the underlying Riemannian structure of quantum-mechanical constraints and permits application of standard gradient based optimization methods while preserving quantum mechanical constraints. Moreover, QGOpt is written on top of TensorFlow, which enables automatic differentiation to calculate necessary gradients for optimization. We show two application examples: quantum gate decomposition and quantum tomography.","url_abs":"https://arxiv.org/abs/2011.01894v4","url_pdf":"https://arxiv.org/pdf/2011.01894v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"qgopt-riemannian-optimization-for-quantum","repo_url":"https://github.com/LuchnikovI/QGOpt","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2011.01894","atlas_url":"https://app.syntology.ai/?focus=2011.01894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.01894"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/LuchnikovI/QGOpt","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"unverified":4},"by_repo_kind":{"official":{"samples":4,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"785bf89691800c45","entry":"adj","repo":"LuchnikovI/QGOpt","repo_kind":"official","path":"QGOpt/manifolds/utils.py","file_url":"https://github.com/LuchnikovI/QGOpt/blob/HEAD/QGOpt/manifolds/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"785bf89691800c45"}},{"code_sha256_prefix":"660ce07c9f2cb61d","entry":"complex_to_real","repo":"LuchnikovI/QGOpt","repo_kind":"official","path":"QGOpt/manifolds/convert.py","file_url":"https://github.com/LuchnikovI/QGOpt/blob/HEAD/QGOpt/manifolds/convert.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"660ce07c9f2cb61d"}},{"code_sha256_prefix":"c5511e5294637f8a","entry":"lyap_symmetric","repo":"LuchnikovI/QGOpt","repo_kind":"official","path":"QGOpt/manifolds/utils.py","file_url":"https://github.com/LuchnikovI/QGOpt/blob/HEAD/QGOpt/manifolds/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"c5511e5294637f8a"}},{"code_sha256_prefix":"5834a546c6a1e301","entry":"real_to_complex","repo":"LuchnikovI/QGOpt","repo_kind":"official","path":"QGOpt/manifolds/convert.py","file_url":"https://github.com/LuchnikovI/QGOpt/blob/HEAD/QGOpt/manifolds/convert.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"5834a546c6a1e301"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}