{"entities":{"Q6874236":{"pageid":20741998,"ns":120,"title":"Item:Q6874236","lastrevid":75276544,"modified":"2026-04-18T10:31:46Z","type":"item","id":"Q6874236","labels":{"en":{"language":"en","value":"An efficient quantum algorithm for the traveling salesman problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8145287"}},"aliases":{},"claims":{"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":"Q6874236$AFCFA125-23A2-43A5-AD6C-A5152B4F7FBC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"331ea9e6a15c4be2f276ddc1aad958b0b0062b29","datavalue":{"value":{"text":"An efficient quantum algorithm for the traveling salesman problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6874236$04A3B2D3-50ED-4EF8-86B6-08230CE14D1B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"24c8f9ec4d69fd8ff7e1da19eb2fdfdbec848d23","datavalue":{"value":"10.2478/QIC-2025-0004","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6874236$972CB694-E203-4A81-94E6-2F02BE66D27D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"06907bc23bb5d9bd7fe768d2d26c108eb5a8d5da","datavalue":{"value":{"entity-type":"item","numeric-id":6874234,"id":"Q6874234"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6874236$C5246938-803C-47DA-8D3B-D7408BF142A5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"93d628d0674eb84a87a38a29e38e345bd0cc5d0e","datavalue":{"value":{"entity-type":"item","numeric-id":6874235,"id":"Q6874235"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6874236$874CC30C-AE4D-47B0-B158-056BB24E4E78","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b21b5978d19af6bc033631087bb3a74e44694e96","datavalue":{"value":{"entity-type":"item","numeric-id":959467,"id":"Q959467"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6874236$E58149B8-40F1-46B2-8E78-3C97F8A4A777","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f9465350e3ed26ff8f9abea488186e90133b0283","datavalue":{"value":{"entity-type":"item","numeric-id":822581,"id":"Q822581"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6874236$348FA3F6-3339-4A8C-99C5-C1C6550799CE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bdb87f8516afb7b173d52ad3e233f2c893f896fc","datavalue":{"value":{"entity-type":"item","numeric-id":2409132,"id":"Q2409132"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6874236$68DA93AF-4B6B-4585-8124-A9AA6033FF01","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"da1687156af0c33947a064340b028080bf72270a","datavalue":{"value":{"entity-type":"item","numeric-id":6774631,"id":"Q6774631"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6874236$DB17F70F-D16C-4641-A9BE-3FAF51F7AF33","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e571645b356301f487ab7394319b4e1cbef86888","datavalue":{"value":{"time":"+2026-01-15T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6874236$287BE510-B97E-497E-97FA-826E7A66A5D1","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"7af17f227fda8daecc6b4cd26e5d774fa965085f","datavalue":{"value":"81P68","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6874236$9966D939-720B-470A-9BCC-D95DCA88D3E8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d49e87838bc3cca1b2ca46cd3cc36550e9683434","datavalue":{"value":"68Q12","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6874236$28B7CEB6-528C-4435-8409-53EF5CE144F2","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"0c3d8a88cada70686fdc073930daf8ce38c52354","datavalue":{"value":"8145287","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6874236$8477197A-C3F2-4071-89DD-E38348A72046","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"c39a117a349789e54237c0a3254f5a10c0a6517e","datavalue":{"value":{"entity-type":"item","numeric-id":6830565,"id":"Q6830565"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6874236$A46E1332-189A-465A-9DBA-8D21C62A7A41","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"398999db83e6f0b9619e9606c6c09b8be1baa252","datavalue":{"value":"traveling salesman problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q6874236$6D85DEBD-4AC7-4596-8B72-359689D3F05E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"35f6e12279431f0167e4b6d99fb9654e2fb19b1f","datavalue":{"value":"Hamiltonian cycle problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q6874236$B40C3E1C-C308-48D7-BA31-09895B332B1D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3d822a508c168cfec0f69e22beaf74548816a936","datavalue":{"value":"efficient quantum algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6874236$80E283D6-9598-4D0D-BBCE-3E49CE411CAF","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":"Q6874236$829BF840-8868-4264-BFDD-8A7C0A0734E6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An efficient quantum algorithm for the traveling salesman problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_efficient_quantum_algorithm_for_the_traveling_salesman_problem"}}}}}