k-forrelation optimally separates Quantum and classical query complexity
Saved in:
| Published in | Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing |
|---|---|
| Format | Conference Proceeding |
| Language | English |
| Online Access | Get full text |
| DOI | 10.1145/3406325.3451040 |
Cover
| BookMark | eNotz7FOwzAUhWEPMEBhZvULpNi-dmqPqAKKVAkhwRzdONdShOMExxHk7Smi09mO_u-aXaQxEWN3Umyl1OYetKhBmS1oI4UWV-zwWYUxZ4pY-jHxcSr9gDGufKYJMxaa-duCqSwDx9RxH3Gee4-Rfy2UV-7HYYr005f1hl0GjDPdnnfDPp4e3_eH6vj6_LJ_OFaoaluqGqyC0CpUXpJyRntnSO52obNta6y1QhIYoTvyrXUtYLCudgqMN9C5oGHDxP_vkiZcv0-tzZRPzXltpGj-kM0Z2ZyR8Av0DEza |
|---|---|
| ContentType | Conference Proceeding |
| DBID | ADTOC UNPAY |
| DOI | 10.1145/3406325.3451040 |
| DatabaseName | Unpaywall for CDI: Periodical Content Unpaywall |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 10.1145/3406325.3451040 |
| GroupedDBID | ADTOC UNPAY |
| ID | FETCH-LOGICAL-a268t-63823fb2a2c1e2954c95e177fd8bb588801e3504decb89b3af8969235c53d9f43 |
| IEDL.DBID | UNPAY |
| IngestDate | Sun Oct 26 03:03:04 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a268t-63823fb2a2c1e2954c95e177fd8bb588801e3504decb89b3af8969235c53d9f43 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://dl.acm.org/doi/pdf/10.1145/3406325.3451040 |
| ParticipantIDs | unpaywall_primary_10_1145_3406325_3451040 |
| PublicationTitle | Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing |
| Score | 2.3802295 |
| SourceID | unpaywall |
| SourceType | Open Access Repository |
| Title | k-forrelation optimally separates Quantum and classical query complexity |
| URI | https://dl.acm.org/doi/pdf/10.1145/3406325.3451040 |
| UnpaywallVersion | publishedVersion |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA6lPYgXFSsqKjl48ZDa5rW7RxFL8VAqWKinJY_Jpe22tF20_npnH1YRL72HEGaSfN8wM98Qcqt4iLRxgVnFPZNJ7JgxPmbWGuG4iZ02ZZXvUA_G8nmiJg3Cv3th_Az3mZcp_OJNL32oBW3VvUDsEVx1hMR7JDFMb2mF_LtJWuPh6OGt1u35Z-UhOcizpdm-m9nsF3j0j6qGvnWpOVjUjEw7-cZ23OcfRcb9znVM2j_NenS0g6ET0oDslAymLBRzN6pKN7rAj2GO59rSNZRi37CmLzkaNZ9Tk3nqCg5duIsiTKy2tCw0hw9k6G0y7j-9Pg5YPTSBGa7jDdNFYi9YbrjrQZHEc4mCXhQFH1urMN7t9kCorvTgbJxYYUKcaGR5yinhkyDFGWlmiwzOCQ3SRABICSFYGaBrdTABAQ05h7ORhAtyt7NruqzEMdKq0VmltVXS2iqXe6y9Is3NKodrRPuNvand-wUsl6lP |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA6lPYgXFSsqKjl48ZDa5rW7RxFL8VAqWKinJY_Jpe22tF20_npnH1YRL72HEGaSfN8wM98Qcqt4iLRxgVnFPZNJ7JgxPmbWGuG4iZ02ZZXvUA_G8nmiJg3Cv3th_Az3mZcp_OJNL32oBW3VvUDsEVx1hMR7JDFMb2mF_LtJWuPh6OGt1u35Z-UhOcizpdm-m9nsF3j0j6qGvnWpOVjUjEw7-cZ23OcfRcb9znVM2j_NenS0g6ET0oDslAymLBRzN6pKN7rAj2GO59rSNZRi37CmLzkaNZ9Tk3nqCg5duIsiTKy2tCw0hw9k6G0y7j-9Pg5YPTSBGa7jDdNFYi9YbrjrQZHEc4mCXhQFH1urMN7t9kCorvTgbJxYYUKcaGR5yinhkyDFGWlmiwzOCQ3SRABICSFYGaBrdTABAQ05h7ORhAtyt7NruqzEMdKq0VmltVXS2iqXe6y9Is3NKodrRPuNvand-wUsl6lP |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+53rd+Annual+ACM+SIGACT+Symposium+on+Theory+of+Computing&rft.atitle=k-forrelation+optimally+separates+Quantum+and+classical+query+complexity&rft_id=info:doi/10.1145%2F3406325.3451040&rft.externalDocID=10.1145%2F3406325.3451040 |