enOn Converses to the Polynomial Method

Συγγραφείς: Briët, Jop, Escudero Gutiérrez, Francisco

Συνεισφορές: Le Gall, François, Morimae, Tomoyuki

Θεματικοί όροι: completely bounded polynomials, Quantum query complexity, polynomial method, Theory of computation → Quantum complexity theory, Mathematics of computing → Functional analysis

Quantum complexity of minimum cut

Συγγραφείς: Apers, Simon, Lee, Troy

Συνεισφορές: Apers, Simon, Simon Apers and Troy Lee

Θεματικοί όροι: 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]

Περιγραφή αρχείου: application/pdf; No full-text files

Σύνδεσμος πρόσβασης: 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

A Unified Framework of Quantum Walk Search

Συγγραφείς: Apers, Simon, Gilyén, András, Jeffery, Stacey

Συνεισφορές: Simon Apers and András Gilyén and Stacey Jeffery, Apers, Simon

Θεματικοί όροι: FOS: Computer and information sciences, Quantum Physics, FOS: Physical sciences, Généralités, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, Theory of computation → Quantum complexity theory, 01 natural sciences, Theory of computation → Graph algorithms analysis, Graph Theory, Computer Science - Data Structures and Algorithms, 0103 physical sciences, Quantum Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Quantum Walks, Quantum Physics (quant-ph), [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph]

Περιγραφή αρχείου: application/pdf; No full-text files

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/1912.04233
https://ir.cwi.nl/pub/29168/1912.04233.pdf
https://arxiv.org/pdf/1912.04233
https://drops.dagstuhl.de/opus/volltexte/2021/13651/pdf/LIPIcs-STACS-2021-6.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr1912.html#abs-1912-04233
https://ir.cwi.nl/pub/29168
https://drops.dagstuhl.de/opus/volltexte/2021/13651/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.6
https://inria.hal.science/hal-02436653v1
https://doi.org/10.4230/lipics.stacs.2021.6

A quantum linearity test for robustly verifying entanglement

Συγγραφείς: Natarajan, Anand, Vidick, Thomas

Πηγή: 49th Annual ACM SIGACT Symposium on Theory of Computing, Montreal, Canada, 19-23 June 2017

Θεματικοί όροι: Theory of computation → Quantum complexity theory, Interactive proof systems, Complexity classes, Quantum Interactive Proofs, Self-Testing, Nonlocal Games, Quantum PCP Conjecture

Relation: https://arxiv.org/abs/1610.03574; https://authors.library.caltech.edu/communities/caltechauthors/; eprintid:78915; https://doi.org/10.1145/3055399.3055468

Διαθεσιμότητα: https://doi.org/10.1145/3055399.3055468

A Unified Framework of Quantum Walk Search

Συγγραφείς: Apers, Simon, Gilyén, András, Jeffery, Stacey

Συνεισφορές: Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Centre National de la Recherche Scientifique (CNRS), QuSoft, Centrum Wiskunde & Informatica (CWI), Universiteit van Amsterdam = University of Amsterdam (UvA), California Institute of Technology (CALTECH), Supported by the Institute for Quantum Information and Matter, an NSF Physics FrontiersCenter (NSF Grant PHY-1733907). Supported by an NWO Veni Innovational Research Grant under projectnumber 639.021.752, an NWO WISE Grant, and QuantERA project QuantAlgo 680-91-03. SJ is a CIFAR Fellowin the Quantum Information Science Program.

Πηγή: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
https://inria.hal.science/hal-02436653
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), Mar 2021, Saarbr\"ucken, Germany. ⟨10.4230/LIPIcs.STACS.2021.6⟩

Θεματικοί όροι: Quantum Algorithms, Quantum Walks, Graph Theory, Theory of computation → Graph algorithms analysis, Theory of computation → Quantum complexity theory, [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Θέμα γεωγραφικό: Saarbr\"ucken, Germany

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

Διαθεσιμότητα: https://inria.hal.science/hal-02436653
https://doi.org/10.4230/LIPIcs.STACS.2021.6

Quantum Complexity of Minimum Cut

Συγγραφείς: Apers, Simon, Lee, Troy

Συνεισφορές: Centre National de la Recherche Scientifique (CNRS), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)

Πηγή: 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⟩

Θεματικοί όροι: 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]

Θέμα γεωγραφικό: Toronto

Time: Toronto, Canada

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

Διαθεσιμότητα: https://hal.science/hal-04239951
https://doi.org/10.4230/LIPIcs.CCC.2021.28

Hardness amplification for entangled games via anchoring

Συγγραφείς: Bavarian, Mohammad, Vidick, Thomas, Yuen, Henry

Πηγή: 49th Annual ACM SIGACT Symposium on Theory of Computing, Montreal, QC, June 19-23, 2017

Θεματικοί όροι: Theory of computation → Quantum complexity theory, Entangled games, parallel repetition, hardness amplification

Relation: https://authors.library.caltech.edu/communities/caltechauthors/; https://doi.org/10.1145/3055399.3055433; eprintid:78913

Διαθεσιμότητα: https://doi.org/10.1145/3055399.3055433