{"entities":{"Q7366310":{"pageid":31544075,"ns":120,"title":"Item:Q7366310","lastrevid":108034703,"modified":"2026-10-27T14:31:44Z","type":"item","id":"Q7366310","labels":{"en":{"language":"en","value":"Near-Optimal Quantum Algorithm and Complexity Analysis for Riccati Problems"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"e4794c62ed591ec55cb9ec695760878ec8776ef2","datavalue":{"value":"quant-ph","type":"string"},"datatype":"string"},"type":"statement","id":"Q7366310$FA66AFFD-2B1D-4294-AB7F-57007C9FADF0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fea8258efc0c807aa3a84f12ebcd68838427a662","datavalue":{"value":{"time":"+2026-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7366310$2EAA55B8-0FE7-4A56-98B9-7E9F329D8783","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"fc48e63455686200b4d2f744f699ada13fc5dc58","datavalue":{"value":"2609.37207","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7366310$91340D79-0FFA-4A6E-B33A-AFF86103DCEC","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"13d9c1cadda847e7436fb42fa2d416653088b26f","datavalue":{"value":{"entity-type":"item","numeric-id":1720932,"id":"Q1720932"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7366310$B69C8B8B-A478-4D63-A2BD-12BC691D2A73","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3c895c84e97f0717142479e4a050094d98e2a6d2","datavalue":{"value":{"entity-type":"item","numeric-id":1744213,"id":"Q1744213"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7366310$9F1D209F-B6CC-4390-AA2B-3432C4595AAF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fe1eec23d5e6a10d52e48a9339fb2069b5333c43","datavalue":{"value":{"entity-type":"item","numeric-id":1987581,"id":"Q1987581"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7366310$97E3CB51-CD1A-465F-BB59-D6B2740A9F89","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3d92ddc8af455e6eed160fb5669eb55a11bb3ce6","datavalue":{"value":{"entity-type":"item","numeric-id":2174655,"id":"Q2174655"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7366310$E6340031-3A49-490F-A348-A21314293176","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9a0d147fb6eb1af4040631a8094aa297594923f9","datavalue":{"value":{"entity-type":"item","numeric-id":775953,"id":"Q775953"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7366310$32094280-AF9E-4BE3-81BC-3766DB6B0601","rank":"normal"}],"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7366310$AD4356C9-EB73-4F22-A1BC-A3F3FF8723E1","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7366310$A1423D37-57BB-4E66-B07C-40178E2A79E1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Near-Optimal Quantum Algorithm and Complexity Analysis for Riccati Problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Near-Optimal_Quantum_Algorithm_and_Complexity_Analysis_for_Riccati_Problems"}}}}}