Výsledky vyhľadávania - "Theory of computation → Quantum query complexity"

Certificate Games

Autori: Chakraborty, Sourav Gál, Anna Laplante, Sophie a ďalší

Prispievatelia: Chakraborty, Sourav Gál, Anna Laplante, Sophie a ďalší

Predmety: certificate complexity, zero-communication two-player games, boolean function complexity, block sensitivity, Theory of computation → Quantum query complexity, query complexity, [INFO] Computer Science [cs], ddc:004, sensitivity, Theory of computation → Computational complexity and cryptography, Theory of computation → Circuit complexity

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.32

Quantum Property Testing in Sparse Directed Graphs

Autori: Apers, Simon Magniez, Frédéric Sen, Sayantan a ďalší

Prispievatelia: Apers, Simon Magniez, Frédéric Sen, Sayantan a ďalší

Zdroj: 29th International Conference on Randomization and Computation
https://hal.science/hal-05343010
29th International Conference on Randomization and Computation, Aug 2025, Berkeley, United States. ⟨10.4230/LIPIcs.APPROX/RANDOM.2025.32⟩

Predmety: Theory of computation → Quantum query complexity, sublinear and near linear time algorithms, Theory of computation → Streaming, collision finding, dual polynomial method, bounded-degree directed graphs, quantum computing, property testing, [INFO]Computer Science [cs]

Geografické téma: Berkeley, United States

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2410.05001; ARXIV: 2410.05001

Dostupnosť: https://hal.science/hal-05343010
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.32

Quantum complexity of minimum cut

Autori: Apers, Simon Lee, Troy Simon Apers and Troy Lee

Prispievatelia: Apers, Simon Lee, Troy Simon Apers and Troy Lee

Predmety: FOS: Computer and information sciences, Quantum algorithms, Quantum Physics, Mathematics of computing → Graph algorithms, quantum query complexity, Minimum cut, FOS: Physical sciences, Généralités, 0102 computer and information sciences, Theory of computation → Quantum complexity theory, 01 natural sciences, minimum cut, Quantum query complexity, Computer Science - Data Structures and Algorithms, Theory of computation → Quantum query complexity, Data Structures and Algorithms (cs.DS), ddc:004, Quantum Physics (quant-ph), [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph]

Popis súboru: application/pdf; No full-text files

Prístupová URL adresa: http://arxiv.org/abs/2011.09823
https://www.narcis.nl/publication/RecordID/oai%3Acwi.nl%3A31117
https://drops.dagstuhl.de/opus/volltexte/2021/14302/pdf/LIPIcs-CCC-2021-28.pdf/
https://dblp.uni-trier.de/db/conf/coco/coco2021.html#ApersL21
https://ir.cwi.nl/pub/31117
https://drops.dagstuhl.de/opus/volltexte/2021/14302/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.28

Quantum Complexity of Minimum Cut

Autori: Apers, Simon Lee, Troy Centre National de la Recherche Scientifique (CNRS) a ďalší

Prispievatelia: Apers, Simon Lee, Troy Centre National de la Recherche Scientifique (CNRS) a ďalší

Zdroj: CCC '21: Proceedings of the 36th Computational Complexity Conference ; https://hal.science/hal-04239951 ; CCC '21: Proceedings of the 36th Computational Complexity Conference, Jul 2021, Toronto, Canada. ⟨10.4230/LIPIcs.CCC.2021.28⟩

Predmety: Quantum algorithms, quantum query complexity, minimum cut, Theory of computation → Quantum query complexity, Mathematics of computing → Graph algorithms, Theory of computation → Quantum complexity theory, [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph]

Geografické téma: Toronto

Time: Toronto, Canada

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2011.09823; ARXIV: 2011.09823

Dostupnosť: https://hal.science/hal-04239951
https://doi.org/10.4230/LIPIcs.CCC.2021.28